Selfish grids: Game-theoretic modeling and NAS/PSA benchmark evaluation

IEEE Transactions on Parallel and Distributed Systems

Volumn 18, Issue 5, 2007, Pages 621-636

  Kwok, Yu Kwong ^a   Hwang, Kai ^b   Song, ShanShan ^c  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c ORACLE CORPORATION   (United States)

Author keywords

Grid computing; NAS workload; Nash equilibrium; Noncooperative games; Online scheduling; Optimal strategies; Parameter sweep application (PSA); Performance evaluation; Selfish behaviors; Virtual organizations

Indexed keywords

NASH EQUILIBRIUM; NONCOOPERATIVE GAMES; ONLINE SCHEDULING; OPTIMAL STRATEGIES; PARAMETER SWEEP APPLICATION (PSA); PERFORMANCE EVALUATION; SELFISH BEHAVIORS;

BENCHMARKING; COMPUTER SIMULATION; GAME THEORY; MATHEMATICAL MODELS; SCHEDULING ALGORITHMS;

GRID COMPUTING;

EID: 34247628327     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2007.1013     Document Type: Article

References (48)

1. A. Akella, S. Seshan, R. Karp, and S. Shenker, "Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP," Proc. ACM SIGCOMM'02, pp. 117-130, Aug. 2002.
2. E. Altman, T. Basar, and R. Srikant, "Nash Equilibria for Combined Flow Control and Routing in Networks: Asymptotic Behavior for a Large Number of Users," IEEE Trans. Automatic Control, vol. 47, no. 6, pp. 917-930, June 2002.
3. E. Altman, T. Basar, T. Jimenez, and N. Shimkin, "Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms," J. Parallel and Distributed Computing, vol. 61, no. 9, pp. 1367-1381, Sept. 2001.
4. Handbook of Game Theory with Economic Applications, vol. 2, R. Aumann and S. Hart, eds. Elsevier, 1994.
5. D.K. Barry, Web Services and Service-Oriented Architectures. Morgan Kaufmann, 2003.
6. Grid Computing: Making the Global Infrastructure a Reality, F. Berman, G. Fox, and T. Hey, eds. John Wiley & Sons, 2003.
7. T. Boulogne, E. Altman, H. Kameda, and O. Pourtallier, "Mixed Equilibrium (ME) for Multiclass Routing Games," IEEE Trans. Automatic Control, vol. 47, no. 6, pp. 903-916, June 2002.
8. T.D. Braun et al., "A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems," J. Parallel and Distributed Computing, vol. 61, no. 6, pp. 810-837, June 2001.
9. J. Bredin, R.T. Maheswaran, C. Imer, T. Basar, D. Kotz, and D. Rus, "A Game-Theoretic Formulation of Multi-Agent Resource Allocation," Proc. ACM Int'l Conf. Autonomous Agents (Agents '00), pp. 349-356, June 2000.
10. R. Buyya, "Economic-Based Distributed Resource Management and Scheduling for Grid Computing," PhD thesis, Monash Univ., Apr. 2002.
11. X.-R. Cao, H.-X. Shen, R. Milito, and P. Wirth, "Internet Pricing with a Game Theoretical Approach: Concepts and Examples," IEEE /ACM Trans. Networking, vol. 10, no. 2, pp. 208-216, Apr. 2002.
12. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman, "Heuristics for Scheduling Parameter Sweep Applications in Grid Environments," Proc. Heterogeneous Computing Workshop (HCW '00), pp. 349-363, May 2000.
13. K.-M. Chao, R. Anane, J.-H. Chen, and R. Gatward, "Negotiating Agents in a Market-Oriented Grid," Proc. Int'l Symp. Cluster Computing and the Grid (CCGrid '02), pp. 436-437, May 2002.
14. K. Czajkowski, I. Foster, N. Karonis, C. Kesselman, S. Martin, W. Smith, and S. Tuecke, "Resource Management Architecture for Metacomputing Systems," Proc. Fourth Int'l Workshop Job Scheduling Strategies for Parallel Processing, pp. 62-82, Mar. 1998.
15. A. Czumaj and A. Ronen, "On the Expected Payment of Mechanisms for Task Allocation," Proc. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 98-106, July 2004.
16. Ö. Ercetin and L. Tassiulas, "Market-Based Resource Allocation for Content Delivery in the Internet," IEEE Trans. Computers, vol. 52, no. 12, pp. 1573-1585, Dec. 2003.
17. I. Foster, C. Kesselman, and S. Tueke, "The Anatomy of the Grid: Enabling Scalable Virtual Organizations," Int'l J. Supercomputing Applications, vol. 15, no. 3, pp. 200-222, 2001.
18. I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufman, 1999.
19. P. Ghosh, N. Roy, S.K. Das, and K. Basu, "A Game Theory Based Pricing Strategy for Job Allocation in Mobile Grids," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '04), pp. 82-91, Apr. 2004.
20. J. Gray, "Distributed Computing Economics," Technical Report MSR-TR-2003-24, Microsoft Research, Mar. 2003.
21. D. Grosu and A.T. Chronopoulos, "Algorithmic Mechanism Design for Load Balancing in Distributed Systems," IEEE Trans. Systems, Man, and Cybernetics, vol. 34, no. 1, pp. 77-84, Feb. 2004.
22. D. Grosu and A.T. Chronopoulos, "Noncooperative Load Balancing in Distributed Systems," J. Parallel and Distributed Computing, vol. 65, no. 9, pp. 1022-1034, Sept. 2005.
23. D. Grosu, A.T. Chronopoulos, and M.Y. Leung, "Load Balancing in Distributed Systems: An Approach Using Cooperative Games," Proc. 16th IEEE Int'l Parallel and Distributed Processing Symp., pp. 501-510, Apr. 2002.
24. T. Groves, "Incentive in Teams," Econometrica, vol. 41, no. 4, pp. 617-631, July 1973.
25. L.V. Kalé, S. Kumar, and J. DeSouza, "A Malleable-Job System for Time-Shared Parallel Machines," Proc. Int'l Symp. Cluster Computing and the Grid (CCGrid '02), pp. 230-237, May 2002.
26. Y.-K. Kwok, S. Song, and K. Hwang, "Selfish Grid Computing: Game-Theoretic Modeling and NAS Performance Results," Proc. Int'l Symp. Cluster Computing and the Grid (CCGrid '05), vol. 2, pp. 1143-1150, May 2005.
27. K. Larson and T. Sandholm, "Miscomputing Ratio: Social Cost of Selfish Computing," Proc. Int'l Conf. Autonomous Agents and Multi-Agent Systems (AAMAS '03), pp. 273-280, 2003.
28. D. Lehmann, L.I. O'Callaghan, and Y. Shoham, "Truth Revelation in Approximately Efficient Combinatorial Auctions," J. ACM, vol. 49, no. 5, pp. 577-602, Sept. 2002.
29. V. Lo and J. Mache, "Job Scheduling for Prime Time vs. Non-Prime Time," Proc. Conf. Cluster Computing (Cluster '02), pp. 488-493, Sept. 2002.
30. R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan, "Experiences Applying Game Theory to System Design," Proc. ACM SIGCOMM '04, pp. 183-190, Sept. 2004.
31. J.F. Nash Jr., "The Bargaining Problem," Econometrica, vol. 18, no. 2, pp. 155-162, Apr. 1950.
32. J.F. Nash Jr., "Non-Cooperative Games," Annals of Math., second series, vol. 54, no. 2, pp. 286-295, Sept. 1951.
33. N. Nisan, "Algorithms for Selfish Agents: Mechansim Design for Distributed Computation," Proc. 16th Symp. Theoretical Aspects of Computer Science, pp. 1-17, 1999.
34. N. Nisan and A. Ronen, "Algorithmic Mechanism Design," Proc. ACM Symp. Theory of Computing, pp. 129-140, 1999.
35. S. Olafsson, "Games on Networks," Proc. IEEE, vol. 85, no. 10, pp. 1556-1562, Oct. 1997.
36. M.J. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, 1994.
37. C.H. Papadimitriou, "Algorithms, Games, and the Internet," Proc. ACM Symp. Theories of Computing (STOC '01), pp. 749-753, July 2001.
38. K. Ranganathan, M. Ripeanu, A. Sarin, and I. Foster, "Incentive Mechanisms for Large Collaborative Resource Sharing," Proc. Int'l Symp. Cluster Computing and the Grid (CCGrid'04), pp. 1-8, Apr. 2004.
39. O. Regev and N. Nisan, "The POPCORN Market - An Online Market for Computational Resources," Proc. ACM Int'l Conf. Information and Computation Economies (ICE'98), pp. 148-157, Oct. 1998.
40. J.B. Rosen, "Existence and Uniqueness of Equilibrium Points for Concave N-Person Games," Econometrica, vol. 33, no. 3, pp. 520-534, July 1965.
41. T. Roughgarden and E. Tardos, "How Bad Is Selfish Routing?" J. ACM, vol. 49, no. 2, pp. 236-259, Mar. 2002.
42. R. Sami, "Distributed Algorithmic Mechanism Design," PhD thesis, Yale Univ., Dec. 2003.
43. S. Song, K. Hwang, and Y.-K. Kwok, "Trusted Grid Computing with Security Binding and Trust Integration," J. Grid Computing, vol. 3, nos. 1-2, pp. 53-73, June 2005.
44. D.E. Volper, J.C. Oh, and M. Jung, "GameMosix: Game-Theoretic Middleware for CPU Sharing in Untrusted P2P Environment," Proc. Conf. Parallel and Distributed Computing and Systems (SPDCS), 2004.
45. M.P. Wellman, J.K. Mackie-Mason, D.M. Reeves, and S. Swaminathan, "Exploring Bidding Strategies for Market-Based Scheduling," Proc. ACM Conf. Electronic Commerce (EC '03), pp. 115-124, June 2003.
46. R. Wolski, J.S. Plank, T. Bryan, and J. Brevik, "G-Commerce: Market Formulations Controlling Resource Allocation on the Computational Grid," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '01), Apr. 2001.
47. H. Yaïche, R.R. Mazumdar, and C. Rosenberg, "A Game Theoretic Framework for Bandwidth Allocation and Pricing in Broadband Networks," IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 667-678, Oct. 2000.
48. M.K.H. Yeung, "On Channel Adaptive Wireless Cache Invalidation and Game Theoretic Power Aware Wireless Data Access," MPhil thesis, Univ. of Hong Kong, Aug. 2004.