Published April 18, 2012
| Submitted
Report
Open
A Distributed Implementation Method for Parallel Programming
- Creators
- Martin, A. J.
Abstract
A method is described for implementing on a finite network of processing "cells", called the "implementation graph", programs whose potential parallelism is not fixed by the implementation but varies according to the input parameters. First, programming constructs are described permitting a computation, regarded as a dynamic structure called the "computation graph", to diffuse through the implementation graph. Second, the implementation problem of mapping an unbounded number of computation nodes on a finite number of cells is tackled. Processor allocation and message buffering completely disappear from the programmer's concerns. The mechanism proposed is considered a generalization of the stack mechanism.
Additional Information
Appears in INFORMATION PROCESSING 80, S.H. Lavington (ed.) North-Holland Publishing Company. Acknowledgement is due to Edsger W. Dijkstra, C.S. Scholten, and the members of the Tuesday Afternoon Club for valuable comments and criticisms.Attached Files
Submitted - 5045_TM_80.pdf
Files
5045_TM_80.pdf
Files
(2.6 MB)
Name | Size | Download all |
---|---|---|
md5:f3fa94eaf9416b2942cccb25d348584a
|
2.6 MB | Preview Download |
Additional details
- Eprint ID
- 30168
- DOI
- 10.7907/Z9QZ27X4
- Resolver ID
- CaltechAUTHORS:20120418-114041991
- Created
-
2012-04-18Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Memorandum
- Series Volume or Issue Number
- 1980.5045