| Bal H.E., Steiner J.G., Tanenbaum A.S., Programming Languages for Distributed Systems, Vrije Universiteit Amsterdam, rapport IR-147 (feb. 1988) |
....language has been designed to support the object model on which the system is built; its constructs are carefully matched to those of the underlying system. Several recent research projects have followed a similar approach. A recent survey of languages for distributed applications is given in [Bal 88a] In the Eden system [Black 85a] applications were programmed in EPL [Black 85b] an extension of Concurrent Euclid; the design of Emerald [Black 86a, Black 86b, Jul 88] was based on the Eden experience. The olus language [Wilkes 86] was developed for the Clouds distributed system [LeBlanc 85] ....
Bal H.E., Steiner J.G., Tanenbaum A.S., Programming Languages for Distributed Systems, Vrije Universiteit Amsterdam, rapport IR-147 (feb. 1988)
....languages have their disadvantages, a serious one being the loss of portability since existing languages and applications cannot take advantage of new ideas and technologies. In spite of this, the idea of building support for distribution into the language is now gaining wide acceptance [BST89, CC91] and has been used in many systems in the recent past. Some of the earliest object models that were developed centered around what are known as passive objects objects which do not encapsulate a thread of activity within them. But an important attraction of distributed systems is ....
....distributed applications. At the highest level they can be categorized as process based models and object based CHAPTER 3. DIAMONDS AN OVERVIEW 32 ones. The former are characterized by a group of sequential processes executing in parallel and communicating via messages. Examples include CSP [BST89] The latter encapsulate the idea that the world can be modeled as a set of autonomous (Virtual Clusters) Active Objects Resource Management (Functional Design) Physical design OOD OOA in it. Source code with clustering hints embedded Static Analysis and Clusterization Cluster Clusters Ensemble N ....
Henri Bal, Jennifer Steiner, and Andrew S. Tanenbaum. Programming Languages for Distributed Systems. ACM Computing Surveys, 21(3), September 1989.
....Section 8 is provides a summary of this work and comparison with other approaches. 2 SMS Paradigm In the past two decades, many attempts have been made to provide programming tools to simplify the task of code development for parallel computing environments. Most surveys of this field [1] [2] 3]classify such attempts by the nature of the programming model which is to be assumed by the application programmer using them. This programming model is an idealization of a physical hardware environment, which may or may not be a close mapping of the actual hardware on which it is to be ....
....is that characterized by a fixed number of processors executing independent processes, exchanging both intermediate results and synchronization information. This is in contrast to models where processes are dynamically created on one processor by procedure calls on another) The usual taxonomy [1] characterizes any such model as either shared memory or message passing. In each case the programmer s view is of multiple processors, each executing asynchronously its own instruction stream, and each having its own private address space. In a shared memory environment, there is also a common ....
H.E. Bal, J.G. Steiner & A.S. Tanenbaum, "Programming Languages for Distributed Systems," ACM Comput. Surv. 21 (September 1989), 261--322.
....take place the object must state its willingness to answer a method call by an accept statement of the form accept(m 1 ; m n ) DLP is a distributed language in the sense that it supports processes, communication between processes and is able to handle failure arising in a communication. C.f. [Bal et al., 1989]. The distinguishing feature of DLP, compared with other approaches at combining logic programming with object oriented features and parallelism, is the possible occurrence of distributed backtracking in a rendez vous. In the absence of distributed backtracking an object could have been identified ....
H. Bal, J. Steiner and A. Tanenbaum, Programming languages for distributed systems, ACM Computing Surveys, 21 (3) (1989) pp. 262-322
.... paper on CSP [Hoare 1978] A message in CSP is sent from one process (the sender) to one other process (the receiver) The sender waits until the receiver has accepted the message (synchronous message passing) Many variations of message passing have been proposed [Andrews and Schneider 1983; Bal et al. 1988]. With asynchronous message passing, the sender continues immediately after sending the message. Remote procedure call and rendez vous are two way interactions between two processes. Broadcast and multicast are interactions between one sender and many receivers [Gehani 1984] Communication ports ....
.... routes rather than integers. 6. CONCLUSIONS We have classified several communication primitives for distributed programming that support the shared variable paradigm without the presence of physical shared memory. Of the many programming languages for distributed systems that are around today [Bal et al. 1988], several recent ones present a computational model based on sharing data. More significant, novel programming styles are emerging. Examples include distributed data structures and the replicated worker model of Linda [Ahuja et al. 1986] and incomplete messages, difference streams, and the ....
Bal, H. E., Steiner, J. G., and Tanenbaum, A. S., Programming Languages for Distributed Systems, IR-147, Vrije Universiteit, Amsterdam, The Netherlands, Feb. 1988.
No context found.
H.E. Bal and A.S. Tannenbaum. Programming Languages for Distributed Systems". 21(3):261--322, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC