Mixed programming metaphors in a shared dataspace model of concurrency
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 16 (12), 1361-1373
- https://doi.org/10.1109/32.62445
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- A UNITY-style programming logic for shared dataspace programsIEEE Transactions on Parallel and Distributed Systems, 1990
- Distributed programming in ArgusCommunications of the ACM, 1988
- Object-oriented programming: an objective sense of styleACM SIGPLAN Notices, 1988
- Data parallel algorithmsCommunications of the ACM, 1986
- On interprocess communicationDistributed Computing, 1986
- An example of stepwise refinement of distributed programs: quiescence detectionACM Transactions on Programming Languages and Systems, 1986
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Associons: A Program Notation with Tuples Instead of VariablesACM Transactions on Programming Languages and Systems, 1981
- The Closure Statement: A Programming Language Construct Allowing Ultraconcurrent ExecutionJournal of the ACM, 1981
- An improved algorithm for decentralized extrema-finding in circular configurations of processesCommunications of the ACM, 1979