Skip to main content
SpringerLink
Log in
Book cover

Panhellenic Conference on Informatics

PCI 2001: Advances in Informatics pp 336–350Cite as

TOPPER: An Integrated Environment for Task Allocation and Execution of MPI Applications onto Parallel Architectures

  • Conference paper
  • First Online:

  • 438 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2563))

Abstract

Although the use of parallel computing systems has significantly expanded in the last years, the existence of many processing elements is not fully exploited, due to the interprocessor communication overhead. In this paper we present an integrated software environment for optimizing the performance of parallel programs on multiprocessor architectures. TOPPER can efficiently allocate the tasks of a parallel application on the various nodes of a multiprocessing machine, using several algorithms for task clustering, cluster merging and physical mapping. The programmer outlines the application’s task computation and communication requirements along with the multiprocessor network available in two similar graphs. TOPPER aims to minimize the application’s overall execution time, proposing an efficient task allocation. In the case of MPI programs, TOPPER proves more powerful, since the application is automatically executed on the target machine with the provided task mapping.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Stone H.: “Multiprocessor Scheduling with the Aid of Network Flow Algorithms”, IEEE Transactions on Software Engineering, Vol.3, No.1, pp.85–93, 1997. 337

    Article  Google Scholar 

  2. George A., Heath M.T. and Liu J.: “Parallel Cholesky Factorization on a Shared Memory Processor”, Linear Algebra and Applications, Vol.77, pp.165–187, 1986. 341

    Article  MATH  Google Scholar 

  3. Lo V.: “Heuristic Algorithms for Task Assignment in Distributed Systems”, IEEE Transactions on Computers, Vol.37, No.11, pp.1384–1397, 1988. 337

    Article  MathSciNet  Google Scholar 

  4. Sarkar V.: “Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors”, Cambridge, MA, MIT Press, 1989. 338

    Google Scholar 

  5. Monien B. and Sudborough H.: “Embedding one Interconnection Network in Another”, Computational Graph Theory, Springer-Verlag, Computing Supplement, Vol.7, pp.257–282, 1990. 337

    MathSciNet  Google Scholar 

  6. Papadimitriou C.H. and Yannakakis M.: “Toward an Architecture-independent Analysis of Parallel Algorithms”, SIAM J. Computing, Vol.19, pp.322–328, 1990. 337

    Article  MATH  MathSciNet  Google Scholar 

  7. Lo V., Rajopadhye S., Gupta S., Keldsen D., Mohamed M., Nitzberg B., Telle J. And Zhong X.: “OREGAMI: Tools for Mapping Parallel Computations to Parallel Architectures”, International Journal of Parallel Programming, Vol.20, No.3, pp.237–270, 1991. 336, 338, 343

    Article  Google Scholar 

  8. Yang T. and Gerasoulis A.: “PYRROS: Static Task Scheduling and Code Generation for Message Passing Multiprocessors”, Proceedings 6th Conference on Supercomputing (ICS92), pp.428–437, New York, NY, 1992. 336, 338

    Google Scholar 

  9. Lewis T. and El-Rewini H.: “Parallax: a Tool for Parallel Program Scheduling”, IEEE Parallel and Distributed Technology, Vol.1, No.2, pp.62–72, 1993. 336

    Article  Google Scholar 

  10. Ali H. and El-Rewini H.: “Task Allocation in Distributed Systems: a Split Graph Model”, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol.14, pp.15–32, 1993. 336

    MATH  MathSciNet  Google Scholar 

  11. El-Rewini H., Lewis T. G. and Ali H.: “Task Scheduling in Parallel and Distributed Systems”, Prentice Hall, 1994. 336

    Google Scholar 

  12. Yang T. and Gerasoulis A.: “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors”, IEEE Transactions on Parallel and Distributed Systems, Vol.5, No.9, pp.951–967, 1994. 338, 340, 341

    Article  Google Scholar 

  13. Koziris N., Papakonstantinou G. and Tsanakas P.: “Optimal Time and Efficient Space Free Scheduling for Nested Loops”, The Computer Journal, Vol.39, No.5, pp.439–448, 1996. 337

    Article  Google Scholar 

  14. Liou J. C., Palis. M.A.: “A Comparison of General Approaches to Multiprocessor Scheduling”, Proceedings 11th Parallel Processing Symposium (IPPS’97), pp.152–156, Geneva, Switzerland, 1997. 338

    Google Scholar 

  15. Koziris N., Romesis M., Papakonstantinou G. and Tsanakas P.: “An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures”, Proceedings PDP’2000 Conference, pp.406–413, Rhodes, 2000. 337, 339, 343

    Google Scholar 

  16. Konstantinou D. and Panagiotopoulos A.: Thesis, Department of Electrical & Computer Engineering, NTUA, Athens, 2000. 340, 341

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Systems Lab, Computer Science Division Department of Electrical & Computer Engineering, National Technical University of AthensZografou Campus, 15773, Zografou, Greece

    Dimitris Konstantinou & Nectarios Koziris

Authors
  1. Dimitris Konstantinou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nectarios Koziris
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Informatics, Aristotle University, 54006, Thessaloniki, Greece

    Yannis Manolopoulos

  2. Dept. of Computer Science, University of Cyprus, P.O. Box 20537, 1678, Nicosia, Cyprus

    Skevos Evripidou  & Antonis C. Kakas  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Konstantinou, D., Koziris, N. (2003). TOPPER: An Integrated Environment for Task Allocation and Execution of MPI Applications onto Parallel Architectures. In: Manolopoulos, Y., Evripidou, S., Kakas, A.C. (eds) Advances in Informatics. PCI 2001. Lecture Notes in Computer Science, vol 2563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38076-0_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-38076-0_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07544-8

  • Online ISBN: 978-3-540-38076-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation