Abstract
In the past years computing has been moving from the sequential world to the parallel one, from centralised organisation to a decentralised. In parallel programming the goal of the design process cannot be reduced to optimise a single metrics like for example speed. While evaluating a parallel program a problem specific function of execution time, memory requirements, communication cost, implementation cost, and others have to be taken into consideration. The paper deals with the use of an idea of program granularity in the evaluation of parallel programs. The obtained results suggest that the presented method can be used for performance evaluation of parallel programs.
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.
References
Cosnard M., Trystan D., Parallel Algorithms and Architectures, International Thomson Publishing Company, London 1995.
Foster I., Designing and Building Parallel Programs, Addison-Wesley Pub., 1995 (also available at http://www.mcs.anl.gov/dbpp/text/book.html).
Gustafson J.L., Reevaluating Amdahl’s Law, Communication of the ACM, May 1988, pp. 532–533
Grama A.Y., Gupta A., Kumar V., Isoefficiency: Measuring the Scalability of Parallel Algorithms and Architectures, IEEE Parallel & Distributed Technology, August 1993, pp. 12–21.
Huzar Z., Kwiatkowski J., Magott J., Dataflow Processing Modeling in Performance Extension of LOTOS, Proceedings of the IASTED International Conference Parallel and Distributed Processing Systems-Euro-PDS’97, Barcelona, Spain-1997, pp. 335–339.
Konieczny D., Kwiatkowski J., Skrzypczynski G., Parallel Search Algorithms for the Distributed environments, Proceedings of the 16th IASTED International Conference APPLIED INFORMATICS, Garmisch-Partenkirchen, Germany-1998, pp. 324–327.
Kwiatkowski J., Performance Evaluation if Parallel Programs, Proceedings of the International Conference Parallel Processing and Applied Mathematics PPAM’99, Kazimierz Dolny, Poland 1999, pp. 75–85
Kumar V., Grama A., Gupta A., Karypis G., Introduction to Parallel Computing, The Benjamin/Cummings Pub. Inc., 1995
Lewis T, Revini H., Introduction to Parallel Computing, Prentice-Hall, 1992
Peterson D., Chamberlain D., Beyond Execution Time: Expanding the Use of Performance Models, IEEE Parallel & Distr. Technology, summer 1994, pp. 37–49
Sahni S., Thanvantri V., Performance Metrics: Keeping the Focus on Runtime, IEEE Parallel & Distributed Technology, spring 1996, pp. 43–56
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwiatkowski, J. (2002). Evaluation of Parallel Programs by Measurement of Its Granularity. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive