Actors as a Parallel Programming Model

This paper shows that asynchronous message-passing actor languages can compete with classical synchronous, shared memory, PRAM languages. We prove the equivalence between these two computational models through their ability to express NC problems. This result corroborates the robustness of the NC class which encompasses problems exhibiting data-level parallelism.

[1]  Phillip B. Gibbons.  A more practical PRAM model , 1989, SPAA '89.

[2]  Guy Vidal-Naquet,et al.  Formalisation of the Behavior of Actors by Colored Petri Nets and Some Applications , 1991, PARLE.

[3]  Eli Upfal,et al.  Efficient schemes for parallel communication , 1982, PODC '82.

[4]  Gul A. Agha,et al.  ACTORS - a model of concurrent computation in distributed systems , 1985, MIT Press series in artificial intelligence.

[5]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[6]  Leslie M. Goldschlager,et al.  A universal interconnection pattern for parallel computers , 1982, JACM.

[7]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[8]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[9]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  Sanguthevar Rajasekaran,et al.  Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..

[11]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[12]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.