ACM Home Page
Please provide us with feedback. Feedback
The CODE 2.0 graphical parallel programming language
Full text PdfPdf (1.05 MB)
Source International Conference on Supercomputing archive
Proceedings of the 6th international conference on Supercomputing table of contents
Washington, D. C., United States
Pages: 167 - 177  
Year of Publication: 1992
ISBN:0-89791-485-6
Authors
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 40,   Citation Count: 17
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/143369.143405
What is a DOI?

ABSTRACT

CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by an integrated graphical/textual interface, a powerful dynamic model of parallel computation, and an integrated concept of program component reuse. Portability is approached by the declarative expression of synchronization and communication operators at a high level of abstraction in a manner which cleanly separates overall computation structure from the primitive sequential computations that make up a program. Execution efficiency is approached through a systematic class hierarchy that supports hierarchical translation refinement including special case recognition. This paper reports results obtained through experimental use of a prototype implementation of the CODE 2.0 system. CODE 2.0 represents a major conceptual advance over its predecessor systems (CODE 1.0 and CODE 1.2) in terms of the expressive power of the model of computation which is implemented and in potential for attaining efficiency across a wide spectrum of parallel architectures through the use of class hierarchies as a means of mapping from logical to executable program representations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

BAB92
 
BAI91
BEG91a
 
BEG91b
A. Beguelin and G. Null, Collected Papers on Phred, Dept. of Computer Science, Univ. of Colorado, CU- CS-511-91, Jan., 1991.
 
BRO85
J.C. Browne, Formulation and Programming of Parallel Computers: a Unified Approach, Proe. Intl. Conf. Par. Proc., 1985, pp. 624-631.
 
BRO89
 
BRO90
 
EIG91
R. Eigenmann, and W. Blume, An Effectiveness Study of Parallelizing Compiler Techniques, Proe. intl. Conf. Par. Proe., 1991, pp. II 17-25.
 
HIR91
S. Hiranandani, K. Kennedy, and C.-W. Tseng, Compiler Support for Machine-Independent Parallel Programming in Fortran D, Rice University, CRPC-TR91132, 1991.
 
JAI91
 
LAU90
R. Lauwereins. et al., GRAPE: A CASE Tool for Digitial Signal Parallel Processing, IEEE ASSP Magazine, Apr. 1990.
 
LEE89
 
LEW90
T.G. Lewis and W. Rudd, Architecture of the Parallel Programming Support Environment, Proc. CompCon'90, San Francisco, CA, Feb. 26 - Mar. 2, 1990.
 
LUS87
 
MAY92
W. Mayne, Florida State University, personal communication, Apr. 1992.
 
NEW91
P. Newton, CODE 2.0 Prototype, unpublished internal documentation, University of Texas at Austin, July 16, 1991.
 
SOB90
 
SUN91
 
WER90
 
WER91

CITED BY  17

Collaborative Colleagues:
Peter Newton: colleagues
James C. Browne: colleagues