• 论文 •    

基于排队理论的对等网络任务调度模型

孟宪福,张晓燕   

  1. 大连理工大学 计算机科学与工程系,辽宁大连116024
  • 出版日期:2009-11-15 发布日期:2009-11-25

Peer to peer task scheduling model based on queue theory

MENG Xian-fu,ZHANG Xiao-yan   

  1. Department of Computer Science & Engineering, Dalian University of Technology, Dalian 116024, China
  • Online:2009-11-15 Published:2009-11-25

摘要: 为更好地满足不同用户对服务质量的要求,更好地利用计算资源,提出了可进行任务划分的调度模型。首先根据对等网络环境下的任务需求状况,将任务分为实时任务与非实时任务;然后根据任务调度的特点和所存在的任务类型,并利用排队理论,分别描述了两种不同的任务调度模型,进而给出任务调度规则和排队规则。通过实验,分析了任务调度模型对不同算法的影响,表明了进行任务划分和引入排队机制的有效性。

关键词: 排队理论, 对等网络, 任务调度, 排队模型, 实时任务

Abstract: The task scheduling model based on task classification was proposed to satisfy different users'requirement for service quality and make good use of resources. Firstly, the tasks were divided into real-time tasks and non-real-time tasks according to the status of task requirements. Then,two different task scheduling models based on the scheduling characteristics and existing task types were depicted by using queue theory, and consequently the queuing rules and task scheduling rules were put forward. Experiments were used to analyze the influences of the proposed task scheduling model on the existing algorithms, and it revealed the effectiveness of task classification and importing queuing theory in the task scheduling.

Key words: queue theory, peer to peer, task scheduling, queuing model, real-time task

中图分类号: