Grid scheduling by on-line rectangle packing

Networks

Volumn 44, Issue 2, 2004, Pages 106-119

  Caramia, Massimiliano ^a   Giordani, Stefano ^b   Iovanella, Antonio ^b  

^a FONDAZIONE POLICLINICO UNIVERSITARIO A GEMELLI IRCCS   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Grid scheduling; On line algorithms; Rectangle packing

Indexed keywords

ALGORITHMS; DATA PROCESSING; DATABASE SYSTEMS; INTEGRATION; INTERNET; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

GRID SCHEDULING; ON-LINE ALGORITHMS; RECTANGLE PACKING;

LARGE SCALE SYSTEMS;

EID: 4444361604     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20021     Document Type: Article

References (25)

1. J.E. Beasley, An exact two-dimensional non-guillotine cutting tree search procedures, Operat Res 33 (1985), 49-64.
2. F. Berman, A. Chien, K. Cooper, J. Dongarra, I. Foster, D. Gannon, L. Johnsson, K. Kennedy, C. Kesselman, J. Mellor-Crummey, D. Reed, L. Torczon, and R. Wolski, The GrADS project: Software support for high-level Grid application development, Int J Supercomput Applicat 15 (2001), 327-344.
3. F. Berman, R. Wolski, S. Figueira, J. Shopf, and G. Shao, Application-level scheduling on distributed heterogeneous networks, Proceedings of Supercomputing '96, 1996.
4. D. Blitz, A. Van Vliet, and G.J. Woeginger, Lower bounds on the asymptotic worst case ratio of the on-line bin packing problem, Unpublished, 1996.
5. A. Borodin and R. El-Yaniv, Online computation and competitive analysis, Cambridge University Press, New York, 1998.
6. M. Caramia, S. Giordani, and A. Iovanella, An on-line algorithm for the rectangle packing problem with Rejection, Experimental and efficient algorithms, K. Jansen et al. (Editors), Lecture notes in computer science 2647, Springer-Verlag, Berlin, 2003, pp. 59-69.
7. H. Casanova, G. Orbetelli, F. Berman, and R. Wolski, The AppLeS parameter sweep template: User-level middleware for the Grid, Proceedings of Supercomputing '00, 2000.
8. J. Csirik and A. Van Vliet, An on-line algorithm for multidimensional bin packing, Operat Res Lett 13 (1993), 149-158.
9. H. Dail, H. Casanova, and F. Berman, A decoupled scheduling approach for the GrADS program development environment, Proceedings of the 2002 ACM/IEEE conference on Supercomputing, Baltimore, MD, November 16-22, 2002, CD-ROM. ACM, 2002.
10. M. Drozdowski, Scheduling multiprocessor tasks. An over-view, Eur J Operat Res 94 (1996), 215-230.
11. D.G. Feitelson and L. Rudolph (Editors), Job scheduling strategies for parallel processing, Proceedings of the 7th International Workshop, Cambridge, MA, Lecture notes in computer science 2221, Springer-Verlag, Berlin, 2001.
12. A. Fiat and G.J. Woeginger (Editors), Online algorithms: The state of the art, Lecture notes in computer science 1442, Springer-Verlag, Berlin, 1998.
13. I. Foster and C. Kesselman, The Grid: Blueprint for a new computing infrastructure, Morgan Kaufmann, San Mateo, CA, 1999.
14. R.W. Haessler and P.E. Sweeney, Cutting stock problems and solution procedures, Eur J Operat Res 54 (1991), 141-150.
15. D.S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, J Assoc Comput Machinery 32 (1985), 130-136.
16. E. Hopper and B.C.H. Turton, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, Eur J Operat Res 128 (2001), 34-57.
17. E. Hopper and B.C.H. Turton, A review of the application of meta-heuristic algorithms to 2D strip packing problems, Artif Intell Rev 16 (2001), 257-300.
18. C.C. Lee and D.T. Lee, A simple on-line bin packing algorithm, J ACM 32 (1985), 562-572.
19. J. Leung, T. Tam, C.S. Wong, G. Young, and F. Chin, Packing squares into square, J Parallel Distrib Comput 10 (1990), 271-275.
20. A. Lodi, S. Martello, and M. Monaci, Two-dimensional packing problems: A survey, Eur J Operat Res 141 (2002), 241-252.
21. C. Imreh, Online strip packing with modifiable boxes, Operat Res Lett 29 (2001), 79-85.
22. K. Ranganathan and I. Foster, Decoupling computation and data scheduling in distributed data-intensive applications, Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing (HPDC-11), Edinburgh, Scotland, July 23-26, IEEE Computer Society 2002, pp. 352-358.
23. D. Shmoys, J. Wien, and D.P. Williamson, Scheduling parallel machines on-line, SIAM J Comput 24 (1995), 1313-1331.
24. A. Su, F. Berman, R. Wolski, and M.M. Strout, Using AppLeS to schedule simple SARA on the computational Grid, Int J High Perform Comput Appl 13 (1999), 253-262.
25. Y.L. Wu, W. Huang, S.C. Lau, C.K. Wong, and G.H. Young, An effective quasi-human based heuristic for solving the rectangle packing problem, Eur J Operat Res 141 (2002), 341-358.