Facilitating Parallel Programming in PVM Using Condensed Graphs

Authors:
John P. Morrison;Ronan W. Connolly
Affiliations:
-;-
Venue:
Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Year:
1999

Citing 8
Cited 0

The Manchester prototype dataflow computer

Communications of the ACM - Special section on computer architecture
The RMIT data flow computer: a hybrid architecture

The Computer Journal - Special issue on parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing

PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Cilk: an efficient multithreaded runtime system

PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
TreadMarks: Shared Memory Computing on Networks of Workstations

Computer
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Functional Programming and Parallel Graph Rewriting

Functional Programming and Parallel Graph Rewriting
Overview of VPE: A Visual Environment for Message-Passing Parallel Programming

Overview of VPE: A Visual Environment for Message-Passing Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the implementation of the Condensed Graph (CG) Computing Model using the PVM system. This model enables the programmer to write solutions to problems to run on a PVM System without the programmer having to create a parallel solution or embed PVM library routines into their program. This paper describes the basic concepts behind the CG Model. It then describes how the CG Model is implemented using the PVM System.