Abstract
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 [1], the Prep-P Mapping Preprocessor [2] and the Simple Simon Programming Environment [3] — that could form the basis of an integrated, comprehensive parallel environment.
Sponsored by ONR contracts N00014-86-K-0218 & -0264 and N00014-84-K-0647 and NSF grant DCR-8416878.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lawrence Snyder, “Parallel Programming and the Poker Programming Environment,” Computer 17 (7), pp. 27–37 (1984).
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).
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).
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).
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).
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).
Lawrence Snyder, “Introduction to the Configurable, Highly Parallel Computer,” Computer 15 (1), pp. 47–56, 1982.
Workshop on Performance Efficient Parallel Programming. Zary Segall and Lawrence Snyder (eds.), Technical Report Carnegie-Mellon University (1986).
B. Kernighan and S. Lin, “An Efficient Heuristic Procedure for Partitioning Graphs,” Bell System Technical Journal 49(2) (February, 1970 ).
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.
Zary Segall and Larry Rudolph, “PIE - A Programming and Instrumentation Environment for Parallel Processing,” Technical Report CMU-CS-85–128, Carnegie-Mellon University, 1985.
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.
Peter C. Bates, “Debugging Programs in a Distributed System Environment,” University of Massachusetts, COINS Technical Report 86–05 (January 1986).
Peter C. Bates and Jack C. Wileden, “High-level debugging of Distributed Systems: The Behavioral Abstraction Approach,” Journal of System Software 3, pp. 255–244 (1983).
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).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Plenum Press, New York
About this chapter
Cite this chapter
Berman, F., Cuny, J., Snyder, L. (1988). Unifying Programming Support for Parallel Computers. In: Tewksbury, S.K., Dickinson, B.W., Schwartz, S.C. (eds) Concurrent Computations. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-5511-3_20
Download citation
DOI: https://doi.org/10.1007/978-1-4684-5511-3_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-5513-7
Online ISBN: 978-1-4684-5511-3
eBook Packages: Springer Book Archive