Scheduling Jobs on Grid Processors
We study a new kind of on-line bin packing motivated by a problem arising when scheduling jobs on the Grid. In this bin packing problem, the set of items is given at the beginning, and variable-sized bins arrive one by one. A closely related problem was introduced by Zhang in 1997. Our main result answers a question posed in that paper in the affirmative: we give an algorithm with a competitive ratio strictly better than 2, for our problem as well as Zhang’s problem.
KeywordsTotal Size Competitive Ratio Large Item Item Size Grid Schedule
Unable to display preview. Download preview PDF.
- 1.Boyar, J., Favrholdt, L.M.: Scheduling jobs on grid processors. Technical Report IMADA preprint PP-2006-6, University of Southern Denmark (2006)Google Scholar
- 2.Garey, M.R., Graham, R.L., Ullman, J.D.: An analysis of some packing algorithms. In: Combinatorial algorithms (Courant Computer Science Symposium 9), pp. 39–47 (1972)Google Scholar
- 3.Graham, R.L.: Bounds on multiprocessing anomalies and related packing algorithms. In: Proc. 1972 Spring Joint Computer Conference, pp. 205–217 (1972)Google Scholar
- 6.Vinter, B.: Personal communication (2006), http://mig-2.imada.sdu.dk:8092/MiG/MiG/About_MiG.html