loading...
Scheduling Strategies for Multitasking in a Distributed System
Washington, D.C. April 16-April 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SIMSYM.2000.84490433rd Annual Simulation Symposium
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Helen D. Karatza, Aristotle University of Thessaloniki
In this paper, 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 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.
Index Terms:
Scheduling, Distributed Systems, Performance, Simulation
Citation:
Helen D. Karatza, "Scheduling Strategies for Multitasking in a Distributed System," ss, pp.83, 33rd Annual Simulation Symposium, 2000
Usage of this product signifies your acceptance of the Terms of Use.