메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages

Cooperative load balancing for a network of heterogeneous computers

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; COMPUTER SIMULATION; GAME THEORY; PROBLEM SOLVING;

EID: 33847133949     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639393     Document Type: Conference Paper
Times cited : (20)

References (18)
  • 1
    • 0018467197 scopus 로고
    • Models for dynamic load balancing in a heterogeneous multiple processor system
    • May
    • 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.
    • (1979) IEEE Trans. Comput , vol.C-28 , Issue.5 , pp. 354-361
    • Chow, Y.C.1    Kohler, W.H.2
  • 7
    • 0026830905 scopus 로고
    • An algorithm for optimal static load balancing in distributed computer systems
    • March
    • C. Kim and H. Kameda. An algorithm for optimal static load balancing in distributed computer systems. IEEE Trans. on Computers, 41(3):381-384, March 1992.
    • (1992) IEEE Trans. on Computers , vol.41 , Issue.3 , pp. 381-384
    • Kim, C.1    Kameda, H.2
  • 9
    • 0028436560 scopus 로고
    • A decomposition algorithm for optimal static load balancing in tree hierarchy network configuration
    • May
    • J. Li and H. Kameda. A decomposition algorithm for optimal static load balancing in tree hierarchy network configuration. IEEE Trans. Parallel and Distributed Systems, 5(5):540-548, May 1994.
    • (1994) IEEE Trans. Parallel and Distributed Systems , vol.5 , Issue.5 , pp. 540-548
    • Li, J.1    Kameda, H.2
  • 13
    • 0000291018 scopus 로고
    • The bargaining problem
    • April
    • J. Nash. The bargaining problem. Econometrica, 18(2):155-162, April 1950.
    • (1950) Econometrica , vol.18 , Issue.2 , pp. 155-162
    • Nash, J.1
  • 15
    • 21844445526 scopus 로고
    • The arbitrated solution for multi-objective convex programming
    • A. Stefanescu and M. V. Stefanescu. The arbitrated solution for multi-objective convex programming. Rev. Roum. Math. Pure Appl., 29:593-598, 1984.
    • (1984) Rev. Roum. Math. Pure Appl , vol.29 , pp. 593-598
    • Stefanescu, A.1    Stefanescu, M.V.2
  • 16
    • 84949527760 scopus 로고    scopus 로고
    • Optimizing static job scheduling in a network of heterogeneous computers
    • August
    • 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.
    • (2000) Proc. of the Intl. Conf. on Parallel Processing , pp. 373-382
    • Tang, X.1    Chanson, S.T.2
  • 17
    • 0022045550 scopus 로고
    • Optimal static load balancing in distributed computer systems
    • April
    • A. N. Tantawi and D. Towsley. Optimal static load balancing in distributed computer systems. Journal of the ACM, 32(2):445-465, April 1985.
    • (1985) Journal of the ACM , vol.32 , Issue.2 , pp. 445-465
    • Tantawi, A.N.1    Towsley, D.2
  • 18
    • 0034297879 scopus 로고    scopus 로고
    • A game theoretic framework for bandwidth allocation and pricing in broadband networks
    • October
    • H. Yaiche, R. R. Mazumdar, and G. Rosenberg. A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE / ACM Trans. Networking, 8(5):667-678, October 2000.
    • (2000) IEEE / ACM Trans. Networking , vol.8 , Issue.5 , pp. 667-678
    • Yaiche, H.1    Mazumdar, R.R.2    Rosenberg, G.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.