A Cost Model for Asynchronous and Structured Message Passing

Authors:
Emmanuel Melin;Bruno Raffin;Xavier Rebeuf;Bernard Virot
Affiliations:
-;-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 6
Cited 0

Structural complexity 2

Structural complexity 2
A bridging model for parallel computation

Communications of the ACM
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Scalable parallel geometric algorithms for coarse grained multicomputers

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
General purpose parallel computing

Lectures on parallel computation
A structured synchronization and communication model fitting irregular data accesses

Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a cost model that relies on an asynchronous and structured parallel execution model for message passing. We show that it is possible to define a complexity function for programs that yields a symbolic date for each communication event. By ordering these dates, an upper bound for the network load can be computed. In contrast to classical approaches this cost computation can handle asynchronism for message passing and communication/computation overlap.