Resource allocation on computational grids using a utility model and the knapsack problem

Future Generation Computer Systems

Volumn 25, Issue 1, 2009, Pages 35-50

  Vanderster, Daniel C ^a   Dimopoulos, Nikitas J ^b   Parra Hernandez, Rafael ^c   Sobie, Randall J ^b,d  

^a CERN   (Switzerland)

^b UNIVERSITY OF VICTORIA   (Canada)

^c Enquisite Software Inc   (Canada)

^d INSTITUTE OF PARTICLE PHYSICS IPP   (Canada)

Author keywords

Grid computing; Knapsack problem; Metascheduling; Quality of service; Resource allocation; Simulation

Indexed keywords

PLANNING; RESOURCE ALLOCATION;

GRID COMPUTING; KNAPSACK PROBLEM; METASCHEDULING; QUALITY OF SERVICE; SIMULATION;

DATA DESCRIPTION;

EID: 51049096110     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2008.07.006     Document Type: Article

References (28)

1. I. Foster, C. Kesselman, S. Tuecke, The anatomy of the grid: Enabling scalable virtual organizations, International J. Supercomputer Applications 15
2. In: Foster I., and Kesselman C. (Eds). The Grid 2: Blueprint for a New Computing Infrastructure. 2nd ed. (2003), Morgan Kaufmann
3. R. Raman, M. Livny, M. Solomon, Matchmaking: Distributed resource management for high throughput computing, in: The Seventh International Symposium on High Performance Distributed Computing, 1998, pp. 140-146
4. Frey J., Tannenbaum T., Livny M., Foster I., and Tuecke S. Condor-g: A computation management agent for multi-institutional grids. Proceedings of the Tenth International Symposium on High Performance Distributed Computing (2001), IEEE Press
5. R. Buyya, H. Stockinger, J. Giddy, D. Abramson, Economic models for management of resources in peer-to-poeer and grid computing, in: Proceedings of the International Conference on Commercial Applications for High-Performance Computing, 2001
6. Abramson D., Buyya R., and Giddy J. A computational economy for grid computing and its implementation in the nimrod-g resource broker. Future Generation Computer Systems 18 8 (2002) 1061-1074
7. S. Venugopal, R. Buyya, L. Winton, A grid service broker for scheduling distributed data-oriented applications on global grids, in: Proceedings of the 2nd workshop on Middleware for grid computing, 2004, pp. 75-80
8. Venugopal S., and Buyya R. A Deadline and budget constrained scheduling algorithm for e-science applications on data grids. Proceedings of the 6th International Conference on Algorithms and Architectures for Parallel Processing. ICA3PP-2005. Lecture Notes in Computer Science vol. 3719 (2005), Springer-Verlag, Berlin, Germany, Melbourne, Australia
9. Ibarra O.H., and Kim C.E. Heuristic algorithms for scheduling independent tasks on nonidentical processors. Journal of the ACM 24 2 (1977) 280-289
10. Braun T.D., Siegel H.J., Beck N., Bölöni L.L., Maheswaran M., Reuther A.I., Robertson J.P., Theys M.D., Yao B., Hensgen D., and Freund R.F. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel Distributed Computing 61 6 (2001) 810-837
11. Maheswaran M., Ali S., Siegel H.J., Hensgen D., and Freund R.F. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing 59 November (1999) 671-680
12. Casanova H., Legrand A., Zagorodnov D., and Berman F. Heuristics for scheduling parameter sweep applications in grid environments. Proceedings of the 9th Heterogeneous Computing Systems Workshop. HCW 2000 (2000), IEEE CS Press, Los Alamitos, CA, USA, Cancun, Mexico
13. S. Vadhiyar, J. Dongarra, A metascheduler for the grid, in: Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, HPDC-11, 2002, pp. 343-351
14. Khan S., Li K.F., Manning E.G., Watson R., and Shoja G.C. Optimal quality of service routing and admission control using the utility model. Future Generation Computer Systems 19 October (2003) 1063-1073
15. J. Gomoluch, M. Schroeder, Market-based resource allocation for grid computing, in: Middleware 2003 Workshops, Rio de Janeiro, Brazil, 2003, pp. 211-218
16. P. Barham, B. Dragovic, K. Fraser, S. Hand, T. Harris, A. Ho, R. Neugebauer, I. Pratt, A. Warfield, Xen and the Art of Virtualization, in: Proceedings of the 19th ACM Symposium on Operating Systems Principles, 2003
17. D.C. Vanderster, N.J. Dimopoulos, R.J. Sobie, Metascheduling multiple resource types using the MMKP, in: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing, September 2006, pp. 231-237
18. R. Parra-Hernandez, A Study of Knapsack-based Admission and Allocation Techniques, Ph.D. Thesis, University of Victoria, Canada, 2005
19. Pirkul H. A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Research Logistics (1987) 161-172
20. Loulou R., and Michaelides E. New greedy-like heuristics for the multidimensional 0-1 knapsack problem. Operations Research (1979) 1101-1114
21. Parra-Hernandez R., and Dimopoulos N. Heuristic approaches for solving the multidimensional knapsack problem (mkp). WSEAS Transactions on Systems (2002) 248-253
22. Parra-Hernandez R., and Dimopoulos N. A new heuristic for solving the multi-choice multidimensional knapsack problem. IEEE Transactions on Systems, Man, and Cybernetics 35 5 (2005) 708-717
23. D. Feitelson, A. Weil, Utilization and predictability in scheduling the IBM SP2 with backfilling, in: Parallel Processing Symposium, 1998
24. J.K. Ousterhout, Scheduling techniques for concurrent systems, in: Proceedings of the 3rd International Conference on Distributed Computer Systems, 1982, pp. 22-30
25. NPACI JOBLOG Job Trace Repository, [Online]. Available:http://joblog.npaci.edu/ (2000)
26. Casanova H. Simgrid: A toolkit for the simulation of application scheduling. Proceedings of the 1st International Symposium on Cluster Computing and the Grid. Washington, DC, USA (2001), IEEE Computer Society 430-437
27. Devore J.L. Probability and Statistics for Engineering and the Sciences. fourth ed. (1995), Thomson Brooks/Cole
28. G. Mounie, C. Rapine, D. Trystram, Efficient approximation algorithms for scheduling malleable tasks, in: Proceedings of the 11th annual ACM Symposium on Parallel Algorithms and Architecture, 1999, pp. 23-32