Partitioning declarative programs into communicating processes

Authors:
John M. A. Roy;Mark D. Nagel;Lubomir Bic
Affiliations:
Department of Information and Computer Science, University of California, Irvine, CA;Department of Information and Computer Science, University of California, Irvine, CA;Department of Information and Computer Science, University of California, Irvine, CA
Venue:
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Year:
1990

Citing 9
Cited 0

Simulating computer systems: techniques and tools

Simulating computer systems: techniques and tools
Incorporating data flow ideas into von neumann processors for parallel execution

IEEE Transactions on Computers
Future scientific programming on parallel machines

Journal of Parallel and Distributed Computing - Special Issue on Languages, Compilers and environments for Parallel Programming
Hyperflow

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Implementing functional programs on a hypercube multiprocessor

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
I-structures: data structures for parallel computing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic data/program partitioning using the single assignment principle

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
A process-oriented model for efficient execution of dataflow programs

Journal of Parallel and Distributed Computing
Process Decomposition Through Locality of Reference

Process Decomposition Through Locality of Reference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Process-Oriented Dataflow System (PODS) is an execution model that combines the von Neumann and dataflow models of computation to gain the benefits of each. Central to PODS is the concept of array distribution and its effects on partitioning and mapping processes. In this paper, we present and discuss the results of executing the classic matrix multiply algorithm (with 1024 data points) on a PODS simulator. The key result is that PODS can take advantage of the parallelism in matrix multiply using a simple automated partitioning scheme.