Abstract
We started by describing an experiment which mixed Linda and time-warp to construct an implementation of time-warp on top of Linda. As a result of this experience and coupled with the development of an implementation of the concurrent object oriented language EuLisp we realised that the numerous concurrency abstractions could be elegantly packaged using classes and specialization to reflect the different interaction protocols whilst still permitting different abstractions to cooperate. Hence we conclude that object oriented techniques are valuable as a means of expressing and controlling concurrency and that there is more to concurrent object-oriented programming than simply viewing objects as units of concurrency. To exercise this new implementation a persistent concurrent OO simulation of a railway network has been developed.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Banâtre J-P. & Le Metayer D., A new computational model and its discipline of programming, INRIA Research Report, 566, 1986.
Burdorf C. & Cammerata S., Prefetching Simulation Objects in a Persistent Simulation Environment, to appear in the Journal of Object-oriented Programming.
Burdorf C. & Marti J.B., Non-Preemptive Time Warp Scheduling Algorithms Operating Systems Review, April, 1990, ACM Press.
Carriero N. & Gelernter D., Linda in Context, Communications of the ACM, Vol. 32, No. 4, April 1989, pp 444–459.
Chandy K.M. & Misra J., Parallel Program Design: A Foundation, Addison-Wesley, ISBN 0-201-05866-9.
Gabriel R.P. & McCarthy J.M., Queue-based Multiprocessing Lisp, Proceedings of 1984 ACM Conference on Lisp and Functional Programming, published by ACM, New York, 1984.
Graube N., Architectures réflexives et implémentations des langages à taxonomie de classes en Lisp: Applications à ObjVlisp, Common Lisp Object System et Telos, Thèse Doctorat de l'Université PARIS 6, December 1989.
Halstead, R.H., Multilisp: A Language for Concurrent Symbolic Computation, ACM TOPLAS 7, October 1985, pp501–538.
Hoare, C.A.R., Communicating Sequential Processes, Prentice Hall, ISBN:0-13-153289-8.
Hutchinson D.J.C., Building Block for Parallel Programmers School of Mathematical Sciences, University of Bath, Ph.D. thesis.
Jefferson D., Virtual Time, ACM TOPLAS 7, pp404–425, 1985.
Kranz D.A., Halstead R.H. & Mohr E., Mul-T: A High-Performance Parallel Lisp, in Proceedings of SIGPLAN '89 Conference on Programming Language Design and Implementation, published by ACM Press, New York, pp 81–90.
Levy J-J., et al, Management of Futures in CAML, INRIA Rapports de Recherche, 1990.
Lin Y-B & Lazowska E.D., Reducing the State Saving Overhead for Time Warp Parallel Simulation, Dept. of Computer Science and Engineering, University of Washington, Technical Report 90-02-03.
Melenk H. & Neun W., Parallel Polynomial Operations in the Buchberger Algorithm, Proceedings of the European Workshop on Parallelism and Algebra, Grenbole, 1988.
Osborne R.B., Speculative Computation in MultiLisp, published in the Proceedings of the 1990 ACCM Conference on Lisp and Functional Programming, ACM Press, ACM, New York, pp198–208.
Padget J.A. and many others, Some Desiderata for the Standardisation of LISP, published in the Proceedings of 1986 ACM Conference on LISP and Functional Programming, ACM Press, ACM, New York, pp54–66.
Padget J.A., Bradford R.J., & Fitch J.P., Concurrent Object-Oriented Programming, to appear in The Computer Journal.
Padget J.A. & Merrall S., Bridging the MIMD—SIMD Gap, in the proceedings of the BCS Parallel Specialist Interest Group Workshop on Abstract Machine Models, March, 1991.
Padget J.A. & Nuyens G., The EuLisp Definition, to be published by the Commission of the European Communities.
Piquer J., Parallélisme et Distribution en Lisp, Thèse d'école Polytechnique, Palaiseau, 1991.
Rowe L.A., A Shared Object Hierarchy, in Proceedings of the International Workshop on Object-Oriented Database Systems, published by IEEE, 1986.
Rowe, L. A., PICASSO Shared Object Hierarchy, Proceedings of the First CLOS Users and Implementors Workshop, Palo Alto, Ca, October 1988.
Tinker P. & Katz M., Parallel Execution of Sequential Scheme with Para-Tran, in Conference Record of the 1988 ACM Symposium on Lisp and Functional Programming, ACM Press, ACM, New York, pp 28–39.
Sabot G., The Paralation Model, MIT Press, 1988.
Valiant L.G., The Bulk Synchronous Parallel Model, Harvard University Department of Computer Science Technical Report TR-08-89.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Padget, J., Broadbery, P., Hutchinson, D. (1992). Mixing concurrency abstractions and classes. In: Banâtre, J., Le Métayer, D. (eds) Reasearch Directions in High-Level Parallel Programming Languages. HLPPP 1991. Lecture Notes in Computer Science, vol 574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55160-3_42
Download citation
DOI: https://doi.org/10.1007/3-540-55160-3_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55160-7
Online ISBN: 978-3-540-46762-5
eBook Packages: Springer Book Archive