The goal of this thesis is to develop a methodology for building networks of small computers capable of the same tasks now performed by single larger computers. Such networks promise to be both easier to scale and more economical in many instances. The mu calculus, a simple syntactic formalism for r...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Halstead, Robert H. (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1978
Schlagworte:	Computer Hardware Computer Systems Message processing Multiprocessors Networks Non-radio Communications Synchronization(electronics) Datenfluss Rechnernetz
Zusammenfassung:	The goal of this thesis is to develop a methodology for building networks of small computers capable of the same tasks now performed by single larger computers. Such networks promise to be both easier to scale and more economical in many instances. The mu calculus, a simple syntactic formalism for representing message-passing computations, is presented and augmented to serve as the semantic basis for programs running on the network. The augmented version includes cells, tokens, and semaphores, as well as primitives for side-effect-free computation. Tokens, a novel construct, allow certain simple communication and synchronization tasks without involving fully general side effects. The network implementation presented supports object references, keeping track of them by using a new concept, the reference tree. A reference tree is a group of neighboring processors in the network that share knowledge of a common object. Also discussed are mechanisms for handling side effects on objects and strategy issues involved in allocating computations to processors. (Author).
Beschreibung:	Zugl.: Cambridge, Mass., Mass. Inst. of Techn., Diss., 1978
Beschreibung:	172 S.