loading...
An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience
Santa Fe, New Mexico April 26-April 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.130317218th International Parallel and Distr ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Arnold L. Rosenberg, University of Massachusetts Amherst
By adding a computational component to the communication-oriented HiHCoHP model of [6], while specializing that model to a single heterogeneous cluster (HNOW, for short) built upon a single network, we obtain a model suitable for designing algorithms for an HNOW and analyzing these algorithms, either mathematically or via simulations. We describe this model and discuss the rationale for its detailed depiction of an HNOW?s features and for the way it represents those features. We review two algorithmic studies that attest to the model?s mathematical tractability and brie.y discuss ongoing experimental work aimed at validating the model?s predictive value.
Citation:
Arnold L. Rosenberg, "An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience," ipdps, vol. 8, pp.171b, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 7, 2004
Usage of this product signifies your acceptance of the Terms of Use.