Modeling contention of sparse-matrix-vector multiplication (SMV) in three parallel programming paradigms

Authors:
Ahmed Sameh;Tarek El-Ghazawi;Yesha Yacoov
Affiliations:
The George Washington University, Washington, D.C.;The George Washington University, Washington, D.C.;University of Maryland, Baltimore County, Baltimore, MD
Venue:
WOSP '07 Proceedings of the 6th international workshop on Software and performance
Year:
2007

Citing 4
Cited 0

A bridging model for parallel computation

Communications of the ACM
LogGP: incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
LoPC: modeling contention in parallel algorithms

PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
The MVA Pre-empt resume priority approximation

SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

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.