DocumentCode
2035574
Title
Scheduling strategies for multitasking in a distributed system
Author
Karatza, Helen D.
Author_Institution
Dept. of Inf., Aristotelian Univ. of Thessaloniki, Greece
fYear
2000
fDate
2000
Firstpage
83
Lastpage
90
Abstract
We study various policies for scheduling tasks in distributed processor queues. Their performance is studied and compared for a variety of workloads. It is our intention to find a policy that increases throughput and also is fair to jobs. Simulation results indicate that the policy that schedules the shortest task in a queue, when there is not any other task that has been waiting more than some configurable period of time, yields good system performance and also provides a guarantee for fairness in individual job execution
Keywords
distributed processing; multiprogramming; scheduling; software performance evaluation; virtual machines; distributed processor queues; distributed system; fairness; job execution; multitasking; performance; simulation; task scheduling; throughput; workloads; Multitasking; Processor scheduling; Reactive power;
fLanguage
English
Publisher
ieee
Conference_Titel
Simulation Symposium, 2000. (SS 2000) Proceedings. 33rd Annual
Conference_Location
Washington, DC
ISSN
1080-241X
Print_ISBN
0-7695-0598-8
Type
conf
DOI
10.1109/SIMSYM.2000.844904
Filename
844904
Link To Document