.png){kind=icon}
.png){kind=icon}
Return
Efficient trigger-broadcasting in heterogeneous clusters
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2004.12.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Broadcasts in parallel computing environments are often used to trigger personal computations at the processors (or, nodes) that comprise the system. (The qualifier personal means that the triggered computations may differ in type and complexity at each node.) We present an algorithm for trigger-broadcasting in a node-heterogeneous cluster of workstations, which comes predictably close to minimizing the time for completing both the broadcast and the computations it triggers. The algorithm orchestrates its broadcast taking account of: the speeds of the cluster's constituent workstations, the speed of the cluster's network, and the complexities of the computations that the broadcast triggers. The algorithm is within a constant factor of optimal when the speeds of the cluster's workstations and of its network are independent of the number of workstations. The algorithm is exactly optimal when the cluster is homogeneous-no matter how diverse the personal computations are. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
cluster computing
NOWs
heterogeneous clusters
collective communication
broadcasting
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available