A game-theoretic model and algorithm for load balancing in distributed systems

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 146-

  Grosu, D ^a   Chronopoulos, A T ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

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

References (19)

1. E. Altman, T. Basar, T. Jimenez, and N. Shimkin. Routing in two parallel links: Game-theoretic distributed algorithms. to appear in: J. of Parallel and Distributed Computing, 2001.
2. T. Basar and G. J. Olsder. Dynamic Noncooperative Game Theory. SIAM, 1998.
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. 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.
6. H. Kameda, J. Li, C. Kim, and Y. Zhang. Optimal Load Balancing in Distributed Computer Systems. Springer Verlag, London, 1997.
7. 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.
8. 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.
9. L. Kleinrock. Queueing Systems - Volume 1: Theory. John Wiley and Sons, 1975.
10. Y. A. Korilis, A. A. Lazar, and A. Orda. Capacity allocation under noncooperative routing. IEEE Trans. Automatic Control, 42(3):309-325, March 1997.
11. 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.
12. 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.
13. D. G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, Reading, Mass., 1984.
14. A. Orda, R. Rom, and N. Shimkin. Competitive routing in multiuser communication networks. IEEE/ACM Trans. Networking, 1(5):510-521, October 1993.
15. 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.
16. T. Roughgarden. Stackelberg scheduling strategies. In Proc. of the 33rd Annual ACM Symp. on Theory of Computing (STOC'2001), pages 104-113, July 2001.
17. 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.
18. 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.
19. A. N. Tantawi and D. Towsley. Optimal static load balancing in distributed computer systems. Journal of the ACM, 32(2):445-465, April 1985.