TY - GEN
T1 - HiHCoHP - Toward a realistic communication model for hierarchical hyperclusters of heterogeneous processors
AU - Cappello, F.
AU - Fraigniaud, P.
AU - Mans, B.
AU - Rosenberg, Arnold L.
N1 - Funding Information:
Acknowledgments of Support. B. Mans: ARC-CNRS Australian-French project #99N92/0523 and LRI. A. L. Rosenberg: NSF Grants CCR-97-10367 and CCR-00-73401, a Fulbright Senior Scholar Award, CNRS, and LRI.
Publisher Copyright:
© 2001 IEEE.
PY - 2001
Y1 - 2001
N2 - A parameterized model of hyperclusters of processors-clusters of clusters of... of clusters of processors-is formulated under which a hypercluster enjoys generality along three orthogonal axes: (1) Its processors are heterogeneous: they may have different computational powers (speed of computation and memory access). (2) Its constituent clusters are interconnected via a hierarchy of networks of possibly differing bandwidths and speeds. (3) Its clusters at each level of the hierarchy are heterogeneous: they may differ in size. The model accounts for architectural details such as the bandwidths and transit costs of both networks and their ports. The algorithmic tractability of the model is demonstrated via broadcast and reduction algorithms, which are predictably efficient in general and actually optimal in special circumstances.
AB - A parameterized model of hyperclusters of processors-clusters of clusters of... of clusters of processors-is formulated under which a hypercluster enjoys generality along three orthogonal axes: (1) Its processors are heterogeneous: they may have different computational powers (speed of computation and memory access). (2) Its constituent clusters are interconnected via a hierarchy of networks of possibly differing bandwidths and speeds. (3) Its clusters at each level of the hierarchy are heterogeneous: they may differ in size. The model accounts for architectural details such as the bandwidths and transit costs of both networks and their ports. The algorithmic tractability of the model is demonstrated via broadcast and reduction algorithms, which are predictably efficient in general and actually optimal in special circumstances.
UR - http://www.scopus.com/inward/record.url?scp=84981294508&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84981294508&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2001.924978
DO - 10.1109/IPDPS.2001.924978
M3 - Conference contribution
AN - SCOPUS:84981294508
T3 - Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001
BT - Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001
Y2 - 23 April 2001 through 27 April 2001
ER -