An adaptive clustering approach to dynamic load balancing

Hau Yee Sit, Kei Shiu Ho, Hong Va Leong, Wing Pong Robert Luk, Lai Kuen Ho

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

15 Citations (Scopus)

Abstract

With the rapidly increasing reliance to distributed systems following the prosperity of low cost networking and the Internet, development of effective techniques for task distribution becomes one of the important issues in distributed computing. During the past few years, most of the load balancing algorithms in practical use employed migration policy with a fixed number of tasks in each step. This paper proposes a novel task transfer scheme with an adaptive number of tasks transferred between the participating servers for load balancing. The adaptation is achieved by a data mining technique, namely, clustering, via employing the distance-weighted nearest neighborhood algorithm. Experiment results show that our proposed algorithm yields the best performance when compared with several other common approaches.
Original languageEnglish
Title of host publicationProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Pages415-420
Number of pages6
Publication statusPublished - 16 Aug 2004
EventProceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN - Hong Kong, Hong Kong
Duration: 10 May 200412 May 2004

Conference

ConferenceProceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
CountryHong Kong
CityHong Kong
Period10/05/0412/05/04

ASJC Scopus subject areas

  • Computer Science(all)

Cite this