Abstract
In this paper we present an autonomous and complete tool for optimizing the performance parallel programs on multiprocessor architectures. The concern of TOPPER’s users is bound to the construction of two separate graphs, describing the overall application’s task partitioning and interprocess communication requirements, as well as the architecture of the available multiprocessor system. TOPPER proceeds with the elaboration of these two graphs and proposes an efficient task mapping, aiming to minimize the application’s overall execution time. When the communication between the various tasks is carried out with the use of MPI routines, the tool not only proposes an optimal task allocation but also can execute automatically the parallel application on the target multiprocessing machine.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Ali et H. El-Rewini. Task Allocation in Distributed Systems: A Split Graph Model. Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 14, pp. 15–32, October 1993.
H. El-Rewini, T. G. Lewis and H. Ali. Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994.
N. Koziris, G. Papakonstantinou and P. Tsanakas. Optimal Time and Efficient Space Free Scheduling for Nested Loops. The Computer Journal, vol. 39, no 5, pp 439–448, 1996.
C. H. Papadimitriou and M. Yannakakis. Toward an Architecture-Independent Analysis of Parallel Algorithms. SIAM J. Comput., vol. 19, pp. 322–328, 1990.
V. Sarkar. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. Cambridge, MA: MIT Press, 1989.
A. Gerasoulis and T. Yang. On the Granularity and Clustering of Directed Acyclic Task Graphs. IEEE Trans. Parallel Distrib. Syst., vol. 4, no. 6, pp. 686–701, Jan. 1993.
T. Yang and A. Gerasoulis. PYRROS: Static Task Scheduling and Code Generation for Message Passing Multiprocessors. Proc 6 th Int’l Conf. Supercomputing (ICS92), ACM Press, New York, N. Y., 1992, pp. 428–437.
D. Konstantinou and A. Panagiotopoulos, Thesis, Dept. of Electrical Engineering, NTUA, Athens 2000
V. Lo, S. Rajopadhye, S. Gupta, D. Keldsen, M. Mohamed, B. Nitzberg, J. Telle and X. Zhong. OREGAMI: Tools for Mapping Parallel Computations to Parallel Architectures. Int’l Journal of Parallel Programming, vol. 20, no. 3, 1991, pp. 237–270.
N. Koziris, M. Romesis, G. Papakonstantinou and P. Tsanakas. An efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures, (PDP2000), IEEE Press, pp. 406–413, Rhodes, Greece.
J.-C. Liou and Michael. A Palis. A Comparison of General Approaches to Multiprocessor, 11th International Parallel Processing Symposium (IPPS’97), Geneva, Switzerland, April 1997, pp. 152–156.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Konstantinou, D., Koziris, N., Papakonstantinou, G. (2001). TOPPER: A Tool for Optimizing the Performance of Parallel Applications. In: Cotronis, Y., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2001. Lecture Notes in Computer Science, vol 2131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45417-9_23
Download citation
DOI: https://doi.org/10.1007/3-540-45417-9_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42609-7
Online ISBN: 978-3-540-45417-5
eBook Packages: Springer Book Archive