메뉴 건너뛰기




Volumn , Issue , 2008, Pages 489-490

Self-aggregation techniques for load balancing in distributed systems

Author keywords

[No Author keywords available]

Indexed keywords


EID: 57949103241     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SASO.2008.38     Document Type: Conference Paper
Times cited : (5)

References (6)
  • 2
    • 0024748907 scopus 로고
    • Dynamic load balancing for distributed memory multiprocessors
    • G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput., 7(2):279-301, 1989.
    • (1989) J. Parallel Distrib. Comput , vol.7 , Issue.2 , pp. 279-301
    • Cybenko, G.1
  • 3
  • 4
    • 46749148785 scopus 로고    scopus 로고
    • Routing with load balancing in ad hoc network: A mobile agent approach
    • IEEE Computer Society
    • N. Nehra, R. B. Patel, and V. K. Bhat. Routing with load balancing in ad hoc network: A mobile agent approach. In ACIS-ICIS, pages 489-495. IEEE Computer Society, 2007.
    • (2007) ACIS-ICIS , pp. 489-495
    • Nehra, N.1    Patel, R.B.2    Bhat, V.K.3
  • 5
    • 57949083044 scopus 로고    scopus 로고
    • Aggregation Dynamics in Overlay Networks and Their Implications for Self-Organized Distributed Applications
    • F. Saffre, R. Tateson, J. Halloy, M. Shackleton, and J. L. Deneubourg. Aggregation Dynamics in Overlay Networks and Their Implications for Self-Organized Distributed Applications. The Computer Journal, 2008.
    • (2008) The Computer Journal
    • Saffre, F.1    Tateson, R.2    Halloy, J.3    Shackleton, M.4    Deneubourg, J.L.5
  • 6
    • 0033353458 scopus 로고    scopus 로고
    • Analysis of nearest neighbor load balancing algorithms for random loads
    • P. Sanders. Analysis of nearest neighbor load balancing algorithms for random loads. Parallel Comput., 25(8):1013-1033, 1999.
    • (1999) Parallel Comput , vol.25 , Issue.8 , pp. 1013-1033
    • Sanders, P.1


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