Modeling contention of sparse-matrix-vector multiplication (SMV) in three parallel programming paradigms
Pages 46 - 49
Abstract
We makes use of the LoPC model, which is inspired by both the LogP/PG and BSP models but accounts for contention for message processing resources in parallel programming models to derive a general estimate of execution cost. We carry out this cost estimate analysis for three dominate programming models: message passing, shared memory and distributed shared memory. We analyze a typical application SMV multiplication written in these programming models with irregular receiver-initiated synchronous communication. The LoPC estimate for this application is shown to be reasonably accurate when compared against measured values of runtime of actual empirical computations on an SGI O2000 multiprocessor machine.
References
[1]
Valiant L.G., A Bridging Model for Parallel Computation. Communications of the Association for Computing Machinery, 33(8), August 1990.
[2]
Alexandrov A., Ionescu M. F., Schauser K. E., and ScheimanC., LogGP: Incorporating Long Messages into the LogP Model-One Step Closer towards a realistic model of parallel computation. In Proc. Symposium on Parallel Algorithms and Architectures, Santa Barbara, CA 1995.
[3]
Frank M. I., Agarwal A., and Vernon M. K., LoPC: Modeling Contention in Parallel Algorithms, Proc. Of the sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Las Vegas, Nevada, 1997.
[4]
Reiser M., and Lavenberg S. S., Mean value analysis of closed multichain queueing networks, Technical Report RC-7023, IBM T.J. Watson Research Center, 1978.
[5]
Bard Y., Some extensions to multiclass queueing network analysis. In M. Arato, A. Butrimenko, and E. Gelembe, editors, Performance of Computer Systems, North Holland, 1979.
[6]
Lavenberg S. S. and Reiser M., Stationary State Probabilities of Arrival Instants for Closed Queueing Networks with Multiple Types of Customers, Journal of Applied Probability, 1980.
[7]
Bryant R. M., Krzesinski A. E., and Teunissen P., The MVA Preempt Resume Priority Approximation. In Proc. Of the 1983 ACM Sigmetrics Conference, 1983.
[8]
Glass G. W., Sastry S. S., and Gopal S., Validation and Application of the LoPC Model, Proc. Of the sixth ACM SIGPLAN Symposium on Principles of Parallel Programming, 1997.
[9]
SGI Inc., The Ultra Violet Tera Scale machine for High Productivity Computing, SGI Internal document, 2002.
Index Terms
- Modeling contention of sparse-matrix-vector multiplication (SMV) in three parallel programming paradigms
Recommendations
Modeling contention of giga-updates per second (GUPs) in three parallel programming paradigms
PDCN'07: Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networksIn this paper we make use of the LoPC model, which is inspired by both the LogP/PG and BSP models but accounts for contention for message processing resources in parallel programming models to derive a general estimate of execution cost. We carry out ...
Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors
SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architecturesWhen using a shared memory multiprocessor, the programmer faces the selection of the portable programming model which will deliver the best performance. Even if he restricts his choice to the standard programming environments (MPI and OpenMP), he has a ...
Combining Data and Computation Distribution Directives for Hybrid Parallel Programming: A Transformation System
This paper describes dSTEP, a directive-based programming model for hybrid shared and distributed memory machines. The originality of our work is the definition and an implementation of a unified high-level programming model addressing both data and ...
Comments
Information & Contributors
Information
Published In
February 2007
216 pages
ISBN:1595932976
DOI:10.1145/1216993
- General Chair:
- Shikharesh Majumdar,
- Program Chairs:
- Vittorio Cortellessa,
- Sebastian Uchitel,
- Daniel Yankelevich
Copyright © 2007 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 05 February 2007
Check for updates
Author Tags
Qualifiers
- Article
Conference
WOSP07
Sponsor:
Acceptance Rates
Overall Acceptance Rate 149 of 241 submissions, 62%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 258Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in