.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
distributed systems
heuristic algorithms
load balancing
multiprocessors
parallel processors
scheduling
task allocation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容