Programming Effort vs. Performance with a Hybrid Programming Model for Distributed Memory Parallel Architectures

Authors:
Andreas Rodman;Mats Brorsson
Affiliations:
-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 8
Cited 2

Integrating message-passing and shared-memory: early experience

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Cooperative shared memory: software and hardware for scalable multiprocessors

ACM Transactions on Computer Systems (TOCS)
Integration of message passing and shared memory in the Stanford FLASH multiprocessor

ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
The SPLASH-2 programs: characterization and methodological considerations

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
TreadMarks: Shared Memory Computing on Networks of Workstations

Computer
Quantifying the performance differences between PVM and TreadMarks

Journal of Parallel and Distributed Computing
On the Coexistence of Shared-Memory and Message-Passing in the Programming of Parallel Applications

HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Lessons Learned when Comparing Shared Memory and Message Passing Codes on Three Modern Parallel Architectures

HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking

A pilot study to compare programming effort for two parallel programming models

Journal of Systems and Software
Identifying Inter-task Communication in Shared Memory Programming Models

IWOMP '09 Proceedings of the 5th International Workshop on OpenMP: Evolving OpenMP in an Age of Extreme Parallelism

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate here the programming effort and performance of a programming model which is a hybrid between shared memory and message-passing. This model permits an easy implementation in shared memory, while still being able to benefit from performance advantages of message-passing for performance critical tasks. We have integrated message-passing with a software DSM system, and evaluated the programming effort and performance with three different applications and various degree of message-passing in the applications.In two of the applications we found that only a small fraction of the source code lines responsible for interprocess communication were performance critical and it was therefore easy to convert only those to message-passing primitives and still approach the performance of pure message-passing.