TOPPER: A Tool for Optimizing the Performance of Parallel Applications
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.
KeywordsTask Allocation Parallel Application Task Graph Processor Graph Processor Network
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- H. El-Rewini, T. G. Lewis and H. Ali. Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994.Google Scholar
- V. Sarkar. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. Cambridge, MA: MIT Press, 1989.Google Scholar
- D. Konstantinou and A. Panagiotopoulos, Thesis, Dept. of Electrical Engineering, NTUA, Athens 2000Google Scholar
- 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.Google Scholar
- 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.Google Scholar