1988
DOI: 10.21236/ada202182
|View full text |Cite
|
Sign up to set email alerts
|

A Concurrent Smalltalk Compiler for the Message-Driven Processor

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

1990
1990
1996
1996

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 2 publications
0
6
0
Order By: Relevance
“…Object location is not a problem novel to aggregates, so we do not focus on it here. The interested reader is referred to [94,58,62].…”
Section: Processing Nodementioning
confidence: 99%
“…Object location is not a problem novel to aggregates, so we do not focus on it here. The interested reader is referred to [94,58,62].…”
Section: Processing Nodementioning
confidence: 99%
“…Unlike [Horwat 1989], code is distributed at loadtime. The format of a pointer to a codeblock is shown in Figure 2-2.…”
Section: Codeblocksmentioning
confidence: 99%
“…The low sixteen bits of the descriptor hold the node number, and the high sixteen bits hold the local address, combining to provide a global address. Storing the node number in the low sixteen bits provides an efficiency bonus on the J-Machine as first described in [Horwat 1989 …”
Section: Framesmentioning
confidence: 99%
“…This added serialization is unacceptable for programming massively concurrent hardware. CA is based on the Actor model [4] and is descended from Concurrent Smalltalk (CST) [12,20,19]. Concurrency in CA is derived from asynchronous messages sends and synchronization through context futures.…”
Section: Introductionmentioning
confidence: 99%