HLPPP 1991: Reasearch Directions in High-Level Parallel Programming Languages pp 157-173 | Cite as
Intermediate uniformly distributed tuple space on transputer meshes
Abstract
Linda is a paradigm for high-level parallel programming that offers a novel alternative to conventional models of process coordination and communication. The basis of the Linda model is a global, logically shared tuple space through which process interaction and synchronization are achieved, providing a conceptually simple approach to parallel programming. There is evidence that suggests a need for a new programming methodology to support transputer-based applications, and Linda, as an attractive and elegant alternative to existing methodologies, has great potential for this role. This paper describes the implementation of a particular tuple space model, intermediate uniform distribution, on transputer meshes and discusses the nature of the overheads inherent in the implementation. It is concluded that although the specific tuple space model is not ideally suited to transputer-based systems and the implementation, as it stands, is too inefficient to be of practical use, the approach requires further exploration in order to exhaust its full research potential.
Keywords
Communication Overhead Distribute Hash Table Tuple Space Successful Match Request QueuePreview
Unable to display preview. Download preview PDF.
References
- S. Ahuja, N. Carriero and D. Gelernter [1986], Linda and Friends, IEEE Computer, 19 (8), August, 26–34Google Scholar
- S. Ahuja, N. Carriero, D. Gelernter and V. Krishnaswamy [1988], Matching Language and Hardware for Parallel Computation in the Linda Machine, IEEE Trans. Computers, 37 (8), August, 921–929Google Scholar
- H. Bal, J. Steiner and A. Tanenbaum [1989], Programming Languages for Distributed Computing Systems, ACM Computing Surveys, 21 (3), September, 261–322Google Scholar
- R. Bjornson, N. Carriero, D. Gelernter and J. Leichter [1987], Linda, The Portable Parallel, Yale Univ. Dept. of Computer Science Research Report 520, FebruaryGoogle Scholar
- N. Carriero [1987], Implementing Tuple Space Machines, Yale Univ. Dept. of Computer Science Research Report 567, December (also a 1987 Yale Univ. Ph.D Thesis)Google Scholar
- N. Carriero, D. Gelernter and J. Leichter [1986], Distributed Data Structures in Linda, Proc. ACM Symp. Princ. Prog. Lang., (January 13–15, St. Petersburg, Fla.), 236–242Google Scholar
- N. Carriero and D. Gelernter [1988], How to write Parallel Programs: A Guide to the Perplexed, Yale Univ. Dept. of Computer Science Research Report 628, NovemberGoogle Scholar
- C. Faasen [1990], Subject: Out-Set Protocol, Linda Users Group Bulletin Board, 11 MayGoogle Scholar
- C. Faasen [1991], Implementing Tuple Space on Transputer Meshes, Research report submitted in partial fulfilment of the requirements for the degree of MSc, Dept. of Computer Science, Univ. of the Witwatersrand, FebruaryGoogle Scholar
- D. Gelernter [1985], Generative Communication in Linda, ACM Trans. Prog. Lang. Syst., 7 (1), January, 80–112Google Scholar
- D. Gelernter [1988], Getting the Job Done, BYTE, 13 (12), November, 301–309Google Scholar
- C. Hoare [1978], Communicating Sequential Processes, Comm. ACM, 21 (8), August, 666–677CrossRefGoogle Scholar
- INMOS [1988], The Transputer Databook, INMOS LimitedGoogle Scholar
- INMOS [1989], Transputer Handbook, INMOS LimitedGoogle Scholar
- J. Leichter [1990], Subject: re: Linda Semantics Question, Linda Users Group Bulletin Board, 18 MayGoogle Scholar
- D. Pountain [1989], Occam 2, BYTE, October, 279–284Google Scholar
- D. Pountain [1990], Virtual Channels: The Next Generation of Transputers, BYTE, April, 3–12Google Scholar
- A. Rabagliati [1990], Subject: New Electronics Article, Sept 1990, North American Transputer User's Group Bulletin Board, 23 OctoberGoogle Scholar