Using Smalltalk for wait-free implementation of highly-concurrent objects

Authors:
W. Craig Scratchley
Affiliations:
-
Venue:
ACM SIGPLAN OOPS Messenger
Year:
1993

Citing 6
Cited 0

Taking concurrency seriously (position paper)

OOPSLA/ECOOP '88 Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming
Sticky bits and universality of consensus

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed, object-based programming systems

ACM Computing Surveys (CSUR)
Ultracomputers: a teraflop before its time

Communications of the ACM
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper I describe wait-free implementations of concurrent objects and show, with the help of an example, how the design of the Smalltalk language can allow a concurrent version of Smalltalk to easily support highly-concurrent objects. Specifically, I explain how a universal wait-free algorithm written in Smalltalk can allow arbitrary concurrent-objects to be easily implemented and used in concurrent applications.