.png){kind=icon}
Return
The GST load balancing algorithm for parallel and distributed systems
.png){kind=icon}
OA
AI
DOI：10.1016/S0888-613X(98)00017-6.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a new dynamic algorithm for the generalised load balancing problem. This new dynamic method provides a fast, efficient allocation of n interacting tasks among m processing nodes. This algorithm, the GST algorithm, is a novel and efficient method for dynamically partitioning a set of n interdependent, intercommunicating tasks, that form the parallel or distributed program, among m processing nodes connected in a given topology. The dynamic allocation uses information about the program's structure, derived at compilation time, to guide the allocation process. (C) 1998 Elsevier Science Inc. All rights reserved.
Keywords:
distributed systems
heuristic algorithms
load balancing
multiprocessors
parallel processors
scheduling
task allocation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
3.0K
Citations:
5.1K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more