Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
Uwe Schwiegelshohn , Technische Universität Dortmund, Robotics Research Institute, 44221, Germany
Andrei Tchernykh , CICESE Research Center, 22860 Ensenada, Baja California, Mexico
Ramin Yahyapour , Technische Universität Dortmund, IT and Media Center, 44221, Germany
This paper addresses nonclairvoyant and non-preemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processors that are divided into several machines. Jobs are independent, they have a fixed degree of parallelism, and they are submitted over time. Further, a job can only be executed on the processors belonging to the same machine. It is our goal to minimize the total makespan. We show that the performance of Garey and Graham’s list scheduling algorithm is significantly worse in Grids than in multiprocessors. Then we present a Grid scheduling algorithm that guarantees a competitive factor of 5. This algorithm can be implemented using a “job stealing” approach and may be well suited to serve as a starting point for Grid scheduling algorithms in real systems.
U. Schwiegelshohn, R. Yahyapour and A. Tchernykh, "Online scheduling in grids," 2008 IEEE International Parallel & Distributed Processing Symposium(IPDPS), Miami, FL, 2008, pp. 1-10.