By Topic

Task scheduling in distributed systems by work stealing and mugging - a simulation study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jovanovic, N. ; Dept. of Appl. Math. & Stat., State Univ. of New York, Stony Brook, NY, USA ; Bender, M.A.

We model and simulate the execution of parallel jobs represented by directed acyclic graphs on a system of networked distributed heterogeneous computers. We tested two online schedulers, the Enhanced Cilk Scheduler (ECS) and the Central Manager (CM). ECS is a decentralized scheduler, which implements work stealing and processor mugging techniques. CM is a centralized greedy scheduler. Our simulation results show that ECS is a well behaved scheduler particularly suited for scheduling task execution in dynamically changing systems because it is robust, requires little communication, and almost matches the performance of the CM scheduler.

Published in:

Information Technology Interfaces, 2002. ITI 2002. Proceedings of the 24th International Conference on

Date of Conference: