Loosely-Coupled Processes (Preliminary Version)
A system of processes in which the interactions are solely through messages is often called loosely-coupled. Such systems are attractive from a programming viewpoint. They are designed by decomposing a specification into its separable concerns, each of which could then be implemented by a process; the operation of the system can be understood by asserting properties of the message sequences transmitted among the component processes. A key attribute of loosely-coupled systems is a guarantee that a message that has been sent cannot be unsent. As a consequence, a process can commence its computation upon receiving a message, with the guarantee that no future message it receives will require it to undo its previous computations.
KeywordsShared Variable Local Store Component Process Mutual Exclusion Safety Property
Unable to display preview. Download preview PDF.
- Chandy, K. Mani and Stephen Taylor, “A Primer for Program Composition Notation,” Caltech-CS-TR-90-10, June 20, 1990.Google Scholar
- Eswaran, K. P., Gray, J. N., Lorie, R. A. and I. L. Traiger, “The Notions of Consistency and Predicate Locks in a Database System,” C. ACM 19(11):624-633,November 1976.Google Scholar
- Gaifman, H., Maher, M. J., and E. Shapiro [ 1990. “Replay, Recovery, Replication and Snapshot of Nondeterministic Concurrent Programs,” Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, 76100, Israel, July 1990.Google Scholar
- Lenoski, D., Gharachorloo, K., Laudon, J., Gupta, A., Hennessy, J., Horowitz, M. and Lam, M, M., “Design of Scalable Shared-Memory Multiprocessors: The DASH Approach,” Proc. ACM, Compcon, February, 1990.Google Scholar
- Lenoski, D., Laudon, J., Gharachorloo, K., Gupta, A. and Hennessy, J., “The Directory-Based Cache Coherence Protocol for the DASH Multiprocessor,” Proc. IEEE, 17th Annual International Symposium on Computer Architecture, 148-159, Seattle, WA, May, 1990.Google Scholar
- Steele, Guy L. Jr., “Making Asynchronous Parallelism Safe for the World,” Proc. 17th Annual ACM Symposium on Principles of Programming Languages, San Francisco, CA, January 17-19, 1990, pp. 218 - 231.Google Scholar
- Vishnubhotla, Prasad , Prasad . “Concurrency and Synchronization in the ALPS Programming Language,” TR56, Ohio State University, 1989.Google Scholar