We study the performance of master-slave algortihms on heterogeneous networks. The word heterogeneity refers here to both the processing and communication capabilities. Following an inductive approach, we derive a formula that predicts the performance for the general case. The computational results carried out on a heterogeneous cluster of PCs prove the effectiveness of the approach and the accuracy of the predictions. The numerical minimzation of this function provides an efficient approach for an optimal distribution of the work.
Citation:
Francisco Almeida, Daniel González, Luz Marina Moreno, Casiano Rodríguez, Jonay Toledo, "On the Prediction of Master-Slave algorithms over Heterogeneous Clusters," pdp, pp.433, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003