Cooperative power-aware scheduling in grid computing environments

Journal of Parallel and Distributed Computing

Volumn 70, Issue 2, 2010, Pages 84-91

  Subrata, Riky ^a   Zomaya, Albert Y ^a   Landfeldt, Bjorn ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Game theory; Grid computing; Scheduling

Indexed keywords

ASSOCIATED COSTS; COMMUNICATION LINKS; COMPUTING NODES; COOPERATIVE GAME; EFFICIENT SCHEDULING; ENERGY COST; ENERGY USAGE; GRID COMPUTING ENVIRONMENT; GRID SYSTEMS; HARDWARE COST; HIGH PERFORMANCE COMPUTING SYSTEMS; JOB SCHEDULING PROBLEM; NASH BARGAINING SOLUTION; PERFORMANCE PREDICTION; POWER-AWARE; POWER-AWARE SCHEDULING; ROBUST PERFORMANCE; SCHEDULING SCHEMES; TOTAL ENERGY;

COMPUTATION THEORY; COMPUTER SYSTEMS; COSTS; GAME THEORY; QUALITY OF SERVICE; SCHEDULING ALGORITHMS;

GRID COMPUTING;

EID: 72749127771     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2009.09.003     Document Type: Article

References (39)

1. A. Akella, R. Karp, C. Papadimitriou, S. Seshan, S. Shenker, Selfish behavior and stability of the Internet: A game-theoretic analysis of TCP, in: Proceedings ACM SIGCOMM, 2002, pp. 117-30, Pittsburgh, Pennsylvania, USA
2. Avvenuti M., Rizzo L., and Vicisano L. A hybrid approach to adaptive load sharing and its performance. Journal of Systems Architecture 42 (1997) 679-696
3. H. Aydi, P. Mejía-Alvarez, D. Mossé, R. Melhem, Dynamic and aggressive scheduling techniques for power-aware real-time systems, in: Proceedings 22nd IEEE Real-Time Systems Symposium, 2001, London
4. C. Boeres, A. Lima, V.E.F. Rebello, Hybrid task scheduling: Integrating static and dynamic heuristics, in: Proceedings 15th Symposium on Computer Architecture and High Performance Computing, 2003, pp. 199-206, Sao Paulo, Brazil
5. D.P. Bunde, Poweraware scheduling for makespan and flow, in: Proceedings 18th ACM Symposium on Parallelism in Algorithms and Architectures, 2006, pp. 190-96
6. J.J. Chen, T.W. Kuo, Multiprocessor energy-efficient scheduling for real-time tasks with different power characteristics, in: Proceedings International Conference on Parallel Processing, 2005, pp. 13-20
7. Chow Y.C., and Kohler W.H. Models for dynamic load balancing in a heterogeneous multiple processor system. IEEE Transactions on Computers 28 (1979) 354-361
8. Cooper R.B. Introduction to Queueing Theory. 2nd ed (1981), Elsevier, North Holland
9. Crovella M.E., and Bestavros A. Self-Similarity in world wide web traffic evidence and possible causes. IEEE/ACM Transactions on Networking 5 (1996) 835-846
10. Grosu D., and Chronopoulos A.T. Algorithmic mechanism design for load balancing in distributed systems. IEEE Transactions on Systems, Man and Cybernetics 34 (2004) 77-84
11. Grosu D., and Chronopoulos A.T. Noncooperative load balancing in distributed systems. Journal of Parallel and Distributed Computing 65 (2005) 1022-1034
12. D. Grosu, A.T. Chronopoulos, M.Y. Leung, Load balancing in distributed systems: An approach using cooperative games, in: Proceedings 16th International Parallel and Distributed Processing Symposium, 2002, pp. 501-10, Fort Lauderdale, Florida
13. Harchol-Balter M., and Downey A.B. Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems 15 (1997) 253-285
14. C. Im, S. Ha, Dynamic voltage scaling for real-time multi-task scheduling using buffers, in: Proceedings ACM SIGPLAN/SIGBED conference, 2004, pp. 88-94
15. Jain R. The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation and Modelling (1991), Wiley- Interscience, New York
16. Kim C., and Kameda H. An algorithm for optimal static load balancing in distributed computer systems. IEEE Transactions on Computers 41 (1992) 381-384
17. H.W. Kuhn, A.W. Tucker, Nonlinear programming, in: Proceedings 2nd Berkeley Symposium on Mathematical Statistics and Probability, 1951, pp. 481-92, Berkeley
18. Kwok Y.K., Hwang K., and Song S. Selfish grids: Game-theoretic modeling and NAS/PSA Benchmark evaluation. IEEE Transactions on Parallel and Distributed Systems 18 (2007) 621-636
19. A. Legrand, C. Touati, Non-cooperative scheduling of multiple bag-of-task applications, in: Proceedings IEEE Conference on Computer Communications, INFOCOM, 2007, pp. 427-35
20. Leland W.E., Taqqu M.S., Willinger W., and Wilson D.V. On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Transactions on Networking 2 (1994) 1-15
21. Lin H.-C., and Raghavendra C.S. A dynamic load-balancing policy with a central job dispatcher (LBC). IEEE Transactions on Software Engineering (1992) 148-158
22. K. Lu, R. Subrata, A.Y. Zomaya, Towards decentralized load balancing in a computational grid environment, in: Proceedings 1st International Conference on Grid and Pervasive Computing (published in Springer Verlag Lecture Notes in Computer Science), 2006, pp. 466-77, Taichung, Taiwan
23. Luenberger D.G. Linear and Nonlinear Programming. 2nd ed. (1984), Addison-Wesley, Reading, Massachusetts
24. R. Mahajan, M. Rodrig, D. Wetherall, J. Zahorjan, Experiences applying game theory to system design, in: Proceedings ACM SIGCOMM, 2004, pp. 183-90, Portland, Oregon, USA
25. Muthoo A. Bargaining Theory with Applications (1999), Cambridge University Press, Cambridge, UK
26. Nash J. The bargaining problem. Econometrica 18 (1950) 155-162
27. K. Ranganathan, M. Ripeanu, A. Sarin, I. Foster, Incentive mechanisms for large collaborative resource sharing, in: Proceedings IEEE International Symposium on Cluster Computing and the Grid, 2004, pp. 1-8
28. Roughgarden T., and Tardos É. How bad is selfish routing?. Journal of the ACM 49 (2002) 236-259
29. Shin D., and Kim J. Dynamic voltage scaling of mixed task sets in priority-driven systems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25 (2006) 438-453
30. Shivaratri N.G., Krueger P., and Singhal M. Load distributing for locally distributed systems. Computer (1992) 33-44
31. Stefanescu A., and Stefanescu M.V. The arbitrated solution for multi-objective convex programming. Revue Roumaine des Mathématiques Pures at Appliquees 29 (1984) 593-598
32. Subrata R., Zomaya A.Y., and Landfeldt B. Artificial life techniques for load balancing in computational grids. Journal of Computer and System Sciences 73 (2007) 1176-1190
33. Subrata R., Zomaya A.Y., and Landfeldt B. A cooperative game framework for QoS guided job allocation schemes in grids. IEEE Transactions on Parallel and Distributed Systems 57 (2008) 1413-1422
34. Subrata R., Zomaya A.Y., and Landfeldt B. Game theoretic approach for load balancing in computational grids. IEEE Transactions on Parallel and Distributed Systems 19 (2008) 66-76
35. Touati C., Altman E., and Galtier J. Generalized Nash bargaining solution for bandwidth allocation. Computer Networks 50 (2006) 3242-3263
36. R. Wolski, J.S. Plank, T. Bryan, J. Brevik, G-commerce: Market formulations controlling resource allocation on the computational grid, in: Proceedings IEEE IPDPS 2001, 2001, San Francisco, CA, USA
37. Wolski R., Spring N.T., and Hayes J. The network weather service: A distributed resource performance forecasting service for metacomputing. Journal Future Generation Computer Systems 15 (1998) 757-768
38. Yaiche H., Mazumdar R.R., and Rosenberg C. A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Transactions on Networking 8 (2000) 667-678
39. F. Yao, A. Demers, S. Shenker, A scheduling model for reduced CPU energy, in: Proceedings 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 374-82, Milwaukee, Wisconsin