Scheduling jobs on grid processors

Algorithmica (New York)

Volumn 57, Issue 4, 2010, Pages 819-847

  Boyar, Joan ^a   Favrholdt, Lene M ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

First Fit Decreasing; Grid scheduling problem; On line algorithms; Zhang's bin packing problem

Indexed keywords

BIN PACKING; BIN PACKING PROBLEM; COMPETITIVE RATIO; GRID SCHEDULING; ON-LINE ALGORITHMS; SCHEDULING JOBS; WORST ORDER RATIO;

ALGORITHMS;

BINS;

EID: 77952095524     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9257-0     Document Type: Article

References (15)

1. Boyar, J. Ellen, F.: Improved lower bounds for Grid scheduling. Unpublished manuscript (2008)
2. Boyar, J. Favrholdt, L.M.: The relative worst order ratio for on-line algorithms. In: 5th Italian Conference on Algorithms and Complexity. LNCS, vol. 2653, pp. 58-69. Springer, Berlin (2003). Extended version in ACM Trans. Algorithms 3(2), 22 (2007) (Pubitemid 36658331)
3. J. Boyar P. Medvedev 2008 The relative worst order ratio applied to seat reservation ACM Trans. Algorithms 4 4 48 10.1145/1383369.1383379 2446967 (Pubitemid 38977908)
4. J. Boyar L.M. Favrholdt K.S. Larsen 2007 The relative worst order ratio applied to paging J. Comput. Syst. Sci. 73 818 843 1115.68159 10.1016/j.jcss.2007.03.001 2320382 (Pubitemid 46627665)
5. Busch, M.: An investigation of the algorithms for solving the grid scheduling problem (in Danish). Bachelor project, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark (2006)
6. L. Epstein L.M. Favrholdt J.S. Kohrt 2006 Separating online scheduling algorithms with the relative worst order ratio J. Comb. Optim. 12 4 362 385 10.1007/s10878-006-9005-9 2265909 (Pubitemid 44546695)
7. Garey, M.R. Graham, R.L.Ullman, J.D.: An analysis of some packing algorithms. Combinatorial Algorithms (Courant Computer Science Symposium 9), 39-47 (1972)
8. Graham, R.L.: Bounds on multiprocessing anomalies and related packing algorithms. In: Proc. 1972 Spring Joint Computer Conference, pp. 205-217 (1972)
9. D.S. Johnson 1974 Fast algorithms for bin packing J. Comput. Syst. Sci. 8 272 314 0284.68023
10. Kohrt, J.S.: Online algorithms under new assumptions. PhD thesis, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark (2004)
11. A.R. Karlin M.S. Manasse L. Rudolph D.D. Sleator 1988 Competitive snoopy caching Algorithmica 3 1 79 119 0645.68034 10.1007/BF01762111 925479
12. C. Lee D. Lee 1985 A simple on-line bin-packing algorithm J. ACM 32 3 562 572 0629.68045 10.1145/3828.3833 (Pubitemid 15507405)
13. D.D. Sleator R.E. Tarjan 1985 Amortized efficiency of list update and paging rules Commun. ACM 28 2 202 208 10.1145/2786.2793 777385 (Pubitemid 15514486)
14. Vinter, B.: Personal communication. http://mig-2.imada.sdu.dk:8092/MiG/ Mig/ (2006)
15. G. Zhang 1997 A new version of on-line variable-sized bin packing Discrete Appl. Math. 72 193 197 0869.90041 10.1016/S0166-218X(96)00018-2 1429788 (Pubitemid 127411995)