| eCIT | Journal of Computing and Information Technology
|
|
Home E-Home Browse journal AuthorsInstructions to authorsBook review submission Login Journal staff & reviewersLoginAdmin login |
Volume 10, Number 3 (September, 2002), Pages 203-209 doi:10.2498/cit.2002.03.08 Nenad Jovanović Department of Applied Mathematics and Statistics, State University of New York, Stony Brook, United States Abstract 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 implementswork 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. Keywords distributed systems, parallel computing, scheduling, simulation Full text (PDF) |
IPG ZESOI, FER IPG Group |