Abstract
Parallel processing has been the topic of extensive research over the past decade. Three factors stimulating this are the advent of cheap and powerful dataprocessing architectures, advances in the theory of concurrency and the computing demands of novel applications. This paper describes a parallel object-oriented machine, POOMA, primarily designed for symbolic and data-intensive applications. The paper outlines the characteristics of POOMA at the level of the parallel programming language POOL and of the architecture. The second part relates these characteristics to the above factors, and provides an informal assessment of the achievements. Finally, some conclusions will be drawn and directions for further research will be pointed out.
Preview
Unable to display preview. Download preview PDF.
References
IJ.J. Aalbersberg, A parallel Full-Text Document Retrieval System. PRISMA project, doc. no. 429, Philips Research Laboratories Eindhoven, The Netherlands, 1989.
P.H.M. America, J.W. de Bakker, J.N. Kok,,J.J.M.M Rutten, Operational semantics of a parallel object-oriented language, In Conference Record of the 13th symposium on Principles of Programming Languages. St. Petersburg, Florida. january 1986, 194–208.
P.H.M. America, J.W. de Bakker, J.N. Kok, J.J.M.M Rutten, A denotational semantics of a parallel object-oriented language., Report CS-R8626,Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, August 1986. Revised version in: America, P.H.M. & Rutten, J.J.M.M. 1989. A Parallel Object Oriented Language: design and semantic foundations. PhD thesis. Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, May 1989 (To appear in Information and Computation).
Pierre America, Definition of POOL2, a parallel object-oriented language, ESPRIT Project 415 Document 364, Philips Research Laboratories, Eindhoven, the Netherlands, April 1988.
P.H.M. America, F. de Boer, A proof system for a parallel language with dynamic process creation, ESPRIT Project 415-A, doc. no. 0445, Philips Research Laboratories Eindhoven, The Netherlands, October 1988.
J.K. Annot and R.A.H. van Twist, Deadlock freedom in packet switching networks. Proc. PARLE, Lecture Notes in Computer Science, Springer, Berlin, 1987, pp.68–85.
J.K. Annot, A deadlock free and starvation free network of packet switching communication processors. Parallel Computing, Vol. 9, pp.147–162, 1989.
B.A.W. Baugsto, J.F. Greipsland and J.Kamerbeek, Sorting large datafiles on POOMA, this issue
W. Bronnenberg: POOL and DOOM, Proceedings of the PARLE Conference, Springer Lecture Notes in Computer Science, Vol 365 (I), pp 356–373, 1989.
W.J.H.J. Bronnenberg, A.J. Nijman, E.A.M. Odijk, R.A.H. van Twist, DOOM: A Decentralized Object-Oriented Machine, IEEE Micro, October 1987, pp. 52–69.
Bertrand Meyer, Eiffel: programming for reusability and extendibility, ACM SIGPLAN Notices, 22(2):85–99, February 1987.
J.J.M.M. Rutten, Semantic correctness for a parallel object-oriented language, ESPRIT Project 415-A, doc. no. 0444, Philips Research Laboratories Eindhoven, The Netherlands, October 1988. Report CS-R8843, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands
Bjarne Stroustrup, The C++ Programming Language, Addison-Wesley, 1986.
W. van Beek, R.A.H. van Twist and M. Vlot, Evaluation of the Communication Network of POOMA, to appear in Proceedings ICCP,1990.
R.A.H. van Twist and E.A.M. Odijk, Networks for Parallel Computers. Proceedings VLSI and Computers, COMPEURO 87, pp.779–782, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Odijk, E.A.M. (1990). POOMA, POOL and parallel symbolic computing: An assessment. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_85
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive