Unifying Programming Support for Parallel Computers
Highly parallel computation requires programming support tools distinct from those that have been developed for sequential computation. In this paper, we discuss characteristics of parallel programming support that we have found to be useful. In addition, we describe a compatible collection of existing tools — taken from the Poker Parallel Programming Environment , the Prep-P Mapping Preprocessor  and the Simple Simon Programming Environment  — that could form the basis of an integrated, comprehensive parallel environment.
KeywordsParallel Program Graph Editor Code Segment Interconnection Structure Sequential Tool
Unable to display preview. Download preview PDF.
- Francine Berman, “Experience with an Automatic Solution to the Mapping Problem,” in The Characteristics of Parallel Algorithms, Leah Jamieson, Dennis Gannon and Robert Douglass (eds.), MIT Press (1987).Google Scholar
- Janice E. Cuny, Duane A. Bailey, John W. Hagerman, and Alfred A. Hough, The Simple Simon Programming Environment: A Status Report. COINS Technical Report 87–22 (May 1987).Google Scholar
- David A. Padua, David J. Kuck and Duncan H. Lawrie, “High-Speed Multiprocessors and Compilation Techniques, ” IEEE Trans. on Computers C-29(9), pp. 763–776 (September 1980).Google Scholar
- Arvind and Rishiyur S. Nikhil, “Executing a program on the MIT Tagged-Token Dataflow Architecture,” Parallel Architectures and Languages Europe, Lecture Notes in Computer Science 259, J.W. de Bakker, A.J. Nijman and P.C. Treleaven (eds.), Springer-Verlag, pp.1–29 (June 1987).Google Scholar
- Duane A. Bailey and Janice E. Cuny, “An Approach to Programming Process Interconnection Structures: Aggregate Rewriting Graph Grammars,” Parallel Architectures and Languages Europe, Lecture Notes in Computer Science 259, J.W. de Bakker, A.J. Nijman and P.C. Treleaven (eds.), Springer-Verlag, pp.112–123 (June 1987).Google Scholar
- Workshop on Performance Efficient Parallel Programming. Zary Segall and Lawrence Snyder (eds.), Technical Report Carnegie-Mellon University (1986).Google Scholar
- B. Kernighan and S. Lin, “An Efficient Heuristic Procedure for Partitioning Graphs,” Bell System Technical Journal 49(2) (February, 1970 ).Google Scholar
- Francine Berman and Patricia Haden, A Comparative Study of Mapping Algorithms for an Automated Parallel Programming Environment. Technical Report CS-088, Department of Computer Science, University of California, San Diego.Google Scholar
- Zary Segall and Larry Rudolph, “PIE - A Programming and Instrumentation Environment for Parallel Processing,” Technical Report CMU-CS-85–128, Carnegie-Mellon University, 1985.Google Scholar
- Karsten Schwan, Michael Kaelbling, and Rajiv Ramnath, “A Testbed for High-Performance Parallel Software,” Technical Report OSU-CISRC-TR 85–5, The Ohio State University, 1985.Google Scholar
- Peter C. Bates, “Debugging Programs in a Distributed System Environment,” University of Massachusetts, COINS Technical Report 86–05 (January 1986).Google Scholar
- Thomas J. LeBlanc and John M. Mellor-Crummey, Debugging Parallel Programs with Instant Replay. Butterfly Project Report 12, Computer Science Department, University of Rochester (September 1986).Google Scholar