Load balancing in distributed systems: An approach using cooperative games

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 501-510

  Grosu, D ^a   Chronopoulos, A T ^a   Leung, Ming Ying ^b  

^a University of Texas at San Antonio   (United States)

^b UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966693011     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1015536     Document Type: Conference Paper

References (31)

1. DIMACS Workshop on Computational Issues in Game Theory and Mechanism Design, November 2001, DIMACS Center, Rutgers University. http://dimacs.rutgers.edu/Workshops/gametheory/.
2. E. Altman, T. Basar, T. Jimenez, and N. Shimkin. Routing in two parallel links: Game-theoretic distributed algorithms. to appear in: Journal of Parallel and Distributed Computing, 2001.
3. Y. C. Chow and W. H. Kohler. Models for dynamic load balancing in a heterogeneous multiple processor system. IEEE Trans. Comput., C-28(5):354-361, May 1979.
4. R. M. Cubert and P. Fishwick. Sim++ Reference Manual. CISE, Univ. of Florida, July 1995.
5. X. Deng and C. Papadimitriou. On the complexity of cooperative solution concepts. Mathematics of Operations Research, 19(2):257-266, May 1994.
6. D. Fudenberg and J. Tirole. Game Theory. The MIT Press, 1994.
7. R. K. Jain, D.M. Chiu, and W. R. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer system. Technical Report DEC-TR-301, Digital Equipment Corporation, Eastern Research Lab, 1984.
8. H. Kameda, J. Li, C. Kim, and Y. Zhang. Optimal Load Balancing in Distributed Computer Systems. Springer Verlag, London, 1997.
9. H. Kameda and Y. Zhang. Uniqueness of the solution for optimal static routing in open BCMP queueing networks. Mathl. Comput. Modelling, 22(10-12):119-130, Nov.-Dec. 1995.
10. C. Kim and H. Kameda. Optimal static load balancing of multi-class jobs in a distributed computer system. In Proc. of the 10th Intl. Conf. on Distributed Computing Systems, pages 562-569, May 1990.
11. C. Kim and H. Kameda. An algorithm for optimal static load balancing in distributed computer systems. IEEE Trans. Comput., 41(3):381-384, March 1992.
12. L. Kleinrock. Queueing Systems - Volume 1: Theory. John Wiley and Sons, 1975.
13. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proc. of the 16th Annual Symp. on Theoretical Aspects of Computer Science, pages 404-413, 1999.
14. H. Lee. Optimal static distribution of prioritized customers to heterogeneous parallel servers. Computers Ops. Res., 22(10):995-1003, December 1995.
15. J. Li and H. Kameda. A decomposition algorithm for optimal static load balancing in tree hierarchy network configuration. IEEE Trans. Parallel and Distributed Syst., 5(5):540-548, May 1994.
16. J. Li and H. Kameda. Optimal static load balancing in star network configurations with two-way traffic. J. of Parallel and Distributed Computing, 23(3):364-375, December 1994.
17. J. Li and H. Kameda. Load balancing problems for multiclass jobs in distributed/parallel computer systems. IEEE Trans. Comput., 47(3):322-332, March 1998.
18. D. G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, Reading, Mass., 1984.
19. M. Mavronicolas and P. Spirakis. The price of selfish routing. In Proc. of the 33rd Annual ACM Symp. on Theory of Computing, pages 510-519, July 2001.
20. A. Muthoo. Bargaining Theory with Applications. Cambridge Univ. Press, Cambridge, U.K., 1999.
21. J. Nash. The bargaining problem. Econometrica, 18(2):155-162, April 1950.
22. L. M. Ni and K. Hwang. Adaptive load balancing in a multiple processor system with many job classes. IEEE Trans. Software Eng., SE-11(5):491-496, May 1985.
23. A. Orda, R. Rom, and N. Shimkin. Competitive routing in multiuser communication networks. IEEE/ACM Trans. Networking, 1(5):510-521, October 1993.
24. C. H. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In Proc. of the 41th IEEE Symp. on Foundations of Computer Science, pages 86-92, November 2000.
25. K. W. Ross and D. D. Yao. Optimal load balancing and scheduling in a distributed computer system. Journal of the ACM, 38(3):676-690, July 1991.
26. T. Roughgarden. Stackelberg scheduling strategies. In Proc. of the 33rd Annual ACM Symp. on Theory of Computing, pages 104-113, July 2001.
27. T. Roughgarden and E. Tardos. How bad is selfish routing? In Proc. of the 41th IEEE Symp. on Foundations of Computer Science, pages 93-102, November 2000.
28. A. Stefanescu and M. V. Stefanescu. The arbitrated solution for multi-objective convex programming. Rev. Roum. Math. Pure Appl., 29:593-598, 1984.
29. X. Tang and S. T. Chanson. Optimizing static job scheduling in a network of heterogeneous computers. In Proc. of the Intl. Conf. on Parallel Processing, pages 373-382, August 2000.
30. A. N. Tantawi and D. Towsley. Optimal static load balancing in distributed computer systems. Journal of the ACM, 32(2):445-465, April 1985.
31. H. Yaiche, R. R. Mazumdar, and C. Rosenberg. A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Trans. Networking, 8(5):667-678, October 2000.