Scalability of a load balancing algorithm, and its implementation on an Intel Paragon

Author

Boukerche, Azzedine ; Das, Sajal K.

Author_Institution

Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA

fYear

1999

fDate

1999

Firstpage

274

Lastpage

279

Abstract

This paper describes an efficient implementation of a load balancing algorithm based upon a process migration mechanism, and the notion of CPU-queue length which indicates the workload at each processor. The main objective is to reduce the message overhead in conservative simulation. The algorithms were tested on four simulation workload models to study the the scalability of our algorithm on an Intel Paragon multicomputer architecture using 64 processors. A significant decrease in run time and the message overhead associated with the conservative simulation was obtained with the use of the proposed dynamic load balancing algorithm as compared to the use of a static partitioning algorithm

Keywords

parallel architectures; performance evaluation; resource allocation; CPU-queue length; Intel Paragon; Intel Paragon multicomputer architecture; conservative simulation; dynamic load balancing algorithm; load balancing algorithm; message overhead; process migration mechanism; scalability; simulation workload models; static partitioning algorithm; Computational modeling; Heuristic algorithms; Load management; Partitioning algorithms; Performance gain; Protocols; Scalability; System recovery; Testing; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms, and Networks, 1999. (I-SPAN '99) Proceedings. Fourth InternationalSymposium on

Conference_Location

Perth/Fremantle, WA

ISSN

1087-4089

Print_ISBN

0-7695-0231-8

Type

conf

DOI

10.1109/ISPAN.1999.778951

Filename

778951