|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Gul Agha, Svend Frølund, WooYoung Kim, Rajendra Panwar, Anna Patterson, Daniel Sturman, "Abstraction and Modularity Mechanisms for Concurrent Computing," IEEE Concurrency, vol. 1, no. 2, pp. 3-14, May, 1993. | |||
| BibTex | x | ||
| @article{ 10.1109/88.218170, author = {Gul Agha and Svend Frølund and WooYoung Kim and Rajendra Panwar and Anna Patterson and Daniel Sturman}, title = {Abstraction and Modularity Mechanisms for Concurrent Computing}, journal ={IEEE Concurrency}, volume = {1}, number = {2}, issn = {1063-6552}, year = {1993}, pages = {3-14}, doi = {http://doi.ieeecomputersociety.org/10.1109/88.218170}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - IEEE Concurrency TI - Abstraction and Modularity Mechanisms for Concurrent Computing IS - 2 SN - 1063-6552 SP3 EP14 EPD - 3-14 A1 - Gul Agha, A1 - Svend Frølund, A1 - WooYoung Kim, A1 - Rajendra Panwar, A1 - Anna Patterson, A1 - Daniel Sturman, PY - 1993 VL - 1 JA - IEEE Concurrency ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/88.218170
The Actor model programming language concept, which provides basic building blocks for a wide variety of computational structures, is reviewed. The Actor model unifies objects and concurrency. Actors are autonomous, distributed, concurrently executing objects that can send each other messages asynchronously. The Actor model's communication abstractions and object-oriented design are discussed. Three mechanisms for developing modular and reusable components for concurrent systems are also discussed. The mechanism are synchronizers, modular specifications of resource management policies, and protocol customization of dependability.
Citation:
Gul Agha, Svend Frølund, WooYoung Kim, Rajendra Panwar, Anna Patterson, Daniel Sturman, "Abstraction and Modularity Mechanisms for Concurrent Computing," IEEE Concurrency, vol. 1, no. 2, pp. 3-14, May 1993, doi:10.1109/88.218170
Usage of this product signifies your acceptance of the Terms of Use.

