Skip to main content

Part of the book series: Informatik aktuell ((INFORMAT))

Abstract

Concurrent programs are developed to meet the demands of high performance computing of many new scientific and real time applications. concurrent programming is however still difficult because of the lack of tools that help in developing and debugging new efficient implementations. Concurrency, communication, synchronization, and non-determinism make the manual assessment of the correctness and of the efficiency of concurrent programs extremely difficult. Models of concurrent programs must thus be used since the early stages of their development to support their debugging and tuning. In this paper we discuss the role that Performance Evaluation techniques may play within this environment using as an example a methodology that has been recently proposed for the automatic construction of GSPN models of concurrent applications. In particular, it will be shown that a GSPN model of an application can be directly derived from its code and that its evaluation provides the parameters that are needed for obtaining the optimal allocation of the components of the application on the computational units of a parallel architecture.

This work has been supported in part by Ministero dell’Universita’ e della Ricerca Scientifica e Tecnologica - 40% Project - and by the Italian National Research Council - Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, Grant N. 91.00879.PF69.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. Ajmone Marsan, G. Balbo, and G. Conte. A class of generalized stochastic Petri nets for the performance analysis of multiprocessor systems.- ACM Transactions on Computer Systems, 2 (1), May 1984.

    Google Scholar 

  2. M. Ajmone Marsan, G. Balbo, and G. Conte. Performance Models of Multiprocessor Systems. MIT Press, Cambridge, USA, 1986.

    Google Scholar 

  3. G. Balbo, G. Chiola, S.C. Bruell, and P. Chen. An example of modelling and evaluation of a concurrent program using coloured stochastic Petri nets: Lamport’s fast mutual exclusion algorithm. IEEE Transactions on Parallel and Distributed Systems, 3 (1), January 1992.

    Google Scholar 

  4. G. Balbo, S. Donatelli, and G. Franceschinis. Understanding parallel programs behaviour through Petri net models. J. of Parallel and Distributed Computing, 15 (3), 1992.

    Google Scholar 

  5. G. Balbo, S. Donatelli, G. Franceschinis, A. Mazzeo, A. Mazzocca, and M. Ribaudo. On concurrent programs characterization. To appear on Performance Evaluation, 1993.

    Google Scholar 

  6. J. Darlington, A.J. Field, P.G. Harrison, P.H.J. Kelly, D.W.N. Sharp, and Q. Wu. Parallel programming using skeleton functions. In Proc. PARLE ’93, Parallel Architectures and Language Europe, number 694 in LNCS. Springer Verlag, 1993.

    Google Scholar 

  7. A. Ferscha. Modelling mappings of parallel computations onto parallel architectures with prm-net model. In Proc. IFIP-WG 10.3 Working Conference on Decentralized Systems, Lyon, December 1989.

    Google Scholar 

  8. C.A.R. Hoare. Communicating sequential process. Comm. of ACM, Aug 1978.

    Google Scholar 

  9. G. Iannello, A. Mazzeo, C. Savy, and G. Ventre. Parallel software development in disc programming enviroment. Future Generation Computer Systems, 5 (4), 1990.

    Google Scholar 

  10. O. Kramer and H. Muhlenbein. Mapping strategies in message-based multiproces¬sors system. Parallel Computing, 9, 1989.

    Google Scholar 

  11. T. Murata, B. Shenker, and S. Shatz. Detection of Ada static deadlocks using Petri nets invariants. IEEE Transactions on Software Engineering, 15 (3): 314–326, March 1989.

    Article  Google Scholar 

  12. S. Pelagatti. A Methodology for the Development and the Support of Massively Parallel Programs. PhD thesis, Informatics Department, University of Pisa, Pisa, Italy, March 1993. Technical Report TD/93.

    Google Scholar 

  13. C.V. Ramamoorty and W.T. Tsai A. Prakash. Software engineering: Problems and perspectives. IEEE Transactions on Computer, October 1984.

    Google Scholar 

  14. S. Shatz and J. Wang. Tutorial on Distributed Software Engeneering. IEEE-CS Press, 1989.

    Google Scholar 

  15. J.K. Aggarwal Soo-Young Lee. A mapping strategy for parallel processing. IEEE Transactions on Computers, C 36 (4), Apr 1987.

    Google Scholar 

  16. R. Taylor. A general purpose algorithm for analyzing concurrent programs. Comm. of ACM, 26, May 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balbo, G. (1993). Performance Evaluation and Concurrent Programming. In: Walke, B., Spaniol, O. (eds) Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78495-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-78495-8_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57201-5

  • Online ISBN: 978-3-642-78495-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics