1986
DOI: 10.1145/960112.28722
|View full text |Cite
|
Sign up to set email alerts
|

Object-oriented concurrent programming in ABCL/1

Abstract: An object-oriented computation model is presented which is designed for modelling and describing a wide variety of concurrent systems. In this model, three types of message passing are incorporated. An overview of a programming language called ABCL/1, whose semantics faithfully reflects this computation model, is also presented. Using ABCL/1, a simple scheme of distributed problem solving is illustrated. Furthermore, we discuss the reply destination mechanism and its applications. A distributed “same fringe” a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0
2

Year Published

1990
1990
2006
2006

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 119 publications
(33 citation statements)
references
References 5 publications
0
31
0
2
Order By: Relevance
“…Such service objects are special as they may be referred to by objects on other devices. Because of the inherent concurrency to which such service objects are exposed, we equip them with a model of concurrency and distribution which is heavily inspired by the actor model of computation [1] and its incarnation in stateful active objects in languages such as ABCL/1 [25]. We model service objects as stateful actors.…”
Section: Service Objects As Actorsmentioning
confidence: 99%
See 1 more Smart Citation
“…Such service objects are special as they may be referred to by objects on other devices. Because of the inherent concurrency to which such service objects are exposed, we equip them with a model of concurrency and distribution which is heavily inspired by the actor model of computation [1] and its incarnation in stateful active objects in languages such as ABCL/1 [25]. We model service objects as stateful actors.…”
Section: Service Objects As Actorsmentioning
confidence: 99%
“…Futures or promises are a frequently recurring abstraction in concurrent languages (e.g. in Multilisp [12], ABCL [25] and Argus [16]). They reconcile asynchronous message sends with return values without having to resort to clumsy callback methods.…”
Section: Message Passing Semanticsmentioning
confidence: 99%
“…A future variable [2,8] in distributed programming represents a value sent to be computed by another process. A calling process which tries to access a future variable before its value is returned is suspended until this answer arrives.…”
Section: The Programmer's Viewmentioning
confidence: 99%
“…A good approximation of this requirement is that the basic message mechanism is asynchronous and unilcrreral or that it has a send/no-wait semantics [28]. When the basic message mechanism has a send/wait semantics the programmers must take care to avoid deadlocks.…”
Section: Communicationmentioning
confidence: 99%