Abstract
A lot of research has focused on solving the problem of computation-aware task scheduling on heterogeneous systems. In this paper, we propose a clustering algorithm that, given a network topology, provides a network partition adapted to the communication requirements of the applications running on the machine. Also, we propose a criterion to measure the quality of each one of the possible mappings of processes to processors based on that network partition. Evaluation results show that these proposals can greatly improve network performance, providing a basis of a communication-aware scheduling technique.
Supported by the Spanish CICYT under Grant TIC97-0897-C04-01
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
V. Arnau et al., “On the Characterization of Interconnection Networks with Irregular Topology: A New Model of Communication Cost”, in PDCS’99, November 1999.
M. S. Bazaraa et al., Nonlinear Programming: Theory and Algorithms, J. Wiley, 1993.
J. Duato, “A new theory of deadlock-free adaptive routing in wormhole networks,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320–1331, December 1993.
R. Duda, P. Hart, Pattern Classification and Scene Analysis, J. Wiley, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arnau, V., Orduña, J.M., Moreno, S., Valero, R., Ruiz, A. (2000). A Clustering Approach for Improving Network Performance in Heterogeneous Systems. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_170
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_170
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive