Name
Abstract | ||
|---|---|---|
Graph Rewriting can be viewed as a rather general framework which encompasses a variety of 'New generation' computational models, ranging from functional language through logic languages of the commited choice variety to actor (object) languages.The language Concurrent Clean is a graph rewriting language augmented with annotations for expressing control of offloading and synchronisation in a distributed architecture. ZAPP is a simple work diffusion architecture which works well for suitable divide and conquer algorithms.In this paper we describe a scheme for extending ZAPP to support Concurrent Clean. An early experimental implementation on transputers is described, together with some preliminary performance measurements of basic kernel functions. A distinctive feature of our implementation is the use of the transputer process instructions to support concurrent graph rewriting directly. Our results show definite benefit from this approach. In addition, we demonstrate the expressive power of Concurrent Clean with respect to pipelining and programmer control of granularity. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1007/3-540-53932-8_54 | LECTURE NOTES IN COMPUTER SCIENCE |
DocType | Volume | ISSN |
Conference | 491 | 0302-9743 |
Citations | PageRank | References |
1 | 0.36 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. L. Mcburney | 1 | 24 | 2.85 |
| M. Ronan Sleep | 2 | 178 | 31.24 |