R. M. Needham and A. J. Herbert, The Cambridge Distributed Computing System, Addison-Wesley (1982).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....using all of its machinery and the standard library below. Finally, the current layer pointer is restored before exiting the handler. 7. Related Work Distributed batch systems are perhaps one of the oldest general purpose applications of distributed computing. Many, such as the Cambridge Ring [27], evolved as a response to the expense of centralized computing systems. Today, a large number of such systems are deployed at commercial and academic sites, including Condor [25] LoadLeveler [1] a descendant of Condor) LSF [38] Maui [22] NQE [3] and PBS [20] Several applicationspecific ....

R. Needham and A. Herbert. The Cambridge Distributed Computing System. Addison-Wesley, London, 1982.

.... principally associated with the Piconet low power room area radio network project [Bennett et al. 97] Its lineage can be traced back to the Tripos operating system, developed in Cambridge University s Computer Laboratory in the late 70s and used in the Cambridge Distributed Computing System [Needham et al. 82] which gave rise to a number of commercial and research operating systems including AmigaOS [Pountain 89] used in the Amiga personal computer, and ATMos [Virata 99] EEK s immediate precursor. Although these generations have shared almost no code with their successors they do share a number of ....

Needham R M, Herbert A J, "The Cambridge Distributed Computing System", Addison Wesley, Reading MA, 1982.

....would serve as terminals providing access to large, central, shared resources such as computing servers and file servers. For the central machines, the coming wave of shared memory multiprocessors seemed obvious candidates. The philosophy is much like that of the Cambridge Distributed System [NeHe82]. The early catch phrase was to build a UNIX out of a lot of little systems, not a system out of a lot of little UNIXes. The problems with UNIX were too deep to fix, but some of its ideas could be brought along. The best was its use of the file system to coordinate naming of and ....

R.M. Needham and A.J. Herbert, The Cambridge Distributed Computing System, Addison-Wesley, London, 1982

....Versioning is when a process makes a tree data structure publicly available and performs updates to that tree by providing altered records from any change upwards as far as the root of the tree. A similar data structure was used for support of some atomic operations in the Cambridge File Server [Needham82]. Such a server can then send an event to inform the clients to change to the alternate root pointer. Clients acknowledge the change by using an event in the other direction, freeing the server to make subsequent updates. Such a mechanism may be most suitable for name servers. In any ....

R. Needham and A. Herbert. The Cambridge distributed computing system. International computer science series. AddisonWesley (London), 1982. (p 57)

....is done completely automatically by what is called a distributed operating system. Few such systems have been designed, and even fewer have been implemented. Fewer still, are actually used by anyone (yet) One of the earliest distributed systems was the Cambridge Distributed Computing System [Needham and Herbert, 1982]. Later, other systems were developed, such as Locus [Walker et al. 1983] Mach [Accetta et al. 1986] V Kernel [Cheriton, 1988] and Chorus [Rozier et al. 1988] Most of the classical distributed systems literature, however, describes work on parts of, or aspects of distributed systems. There ....

Needham and Herbert [1982] R. M.Needhamand A. J. Herbert, The Cambridge Distributed Computing System, Addison-Wesley, Reading, MA, 1982.

....is unlikely that one model will ever dominate. Distribution may be provided at many levels in a computer system. For example systems such as NFS [SGK 85] provide distribution to the Unix file system whereas other systems such as Amoeba [MRT 90] Accent [RR81] and the Cambridge Distributed Systems [NH82] decentralise the operating system across a number of nodes. One of the design aims of these systems is to hide the distribution and create the illusion of a 2 single system. In contrast many programming languages provide language features such as RPC [Nel81, BN84] and the Ada rendezvous [DOD83] ....

Needham, R.M. & Herbert, A.J. The Cambridge Distributed Computing System. Addison Wesley, Wokingham (1982).

....Consider an integrated computer network where there is one native operating system for all the distributed hosts. This is called a distributed operating system (DOS) See Figure 2. Examples of DOSs include the V system [28] Eden [66] Amoeba [78] the Cambridge distributed computing system [79], Medusa [83] Locus [87] and Mach [93] Examples of real time distributed operating systems include MARS [59] and Spring [116] A DOS is designed with the network requirements in mind from its inception and it tries to manage the resources of the network in a global fashion. Therefore, ....

R.M. Needham and A.J. Herbert, The Cambridge Distributed Computing System, London: Addison-Wesley, 1982.

....and then locating the data blocks. We propose that the retrieval of the location of a file and its data blocks, i.e. the translation process is carried out in two steps, known as two step translation method, which is also used in the implementation of Cambridge File Server (CFS) Dion 1980] [Needham and Herbert 1982]. The description of two step translation method proposed for RHODOS is as follows: ffl 1 st step: To perform an operation on a file requires: system name of the file; and identification of the file server where the file is located. The system name of the file keeps the information about the ....

Needham, R. M. and Herbert, A. J. The Cambridge Distributed Computing System. Addison-Wesley

....possession of a capability gives an undeniable right to access an object it is important that programs not be able to manufacture capabilities. Such an ability would allow a program to access data which was not supposed to be available to it. Methods of protecting capabilities include segregation [47, 62], tagging [30, 46] and password schemes [11] A capability for an object can thus only be obtained by creating a new object or by being passed a capability by another program. Capabilities have three components. These are a unique name identifying the object, a set of access rights for the object ....

Needham, R. M. and Herbert, A. J. "The Cambridge Distributed Computing System", Addison Wesley, London, 1982.

....of a set of identical processes communicating in a circular fashion. Each process has two neighbors and all messages originating at the process must go through either of the neighbors. This topology of processes is common for local area networks with token ring such as the Cambridge Ring Network [Needham 84] All of the above networks show symmetry and it is desirable to have methods to reduce the global state space by exploiting this symmetry. We propose the following methods in this paper. 1. Symbolic Analysis : Instead of computing the actual global state, this method expresses the global state ....

R.M. Needham,A.J.Herbert, "The Cambridge Distributed Computing System, " Publ. Addison-Wesley Publishing Company, 1984.

....them transparently allows applications to work unchanged across local network boundaries. In this section we will have a look at some of these systems, and how they have been implemented. 4.1. The Cambridge Distributed Computing System The Cambridge Distributed Computing System [5] is an experiment of the University of Cambridge to provide a computing system consisting of processors connected by a fast communication network, the Cambridge Ring . Some of the system s processors perform dedicated services, such as a name service or a file service, whereas others form a ....

R. M. Needham and A. J. Herbert, The Cambridge Distributed Computing System, Addison-Wesley, Reading, MA, 1982.

....at the Computer Laboratory that the data transfer capabilities of ATM were first used to replace a workstation bus in the Desk Area Network [Hayter93] 2.1. 2 Distributed Processing Environments Early Distributed Processing Environments (DPEs) include the Cambridge Distributed Computing System [Needham82] which later matured into the ANSA architecture [Herbert94a] More recently the advent of object oriented technology progressed these approaches into systems like the Common Object Request Broker Architecture (CORBA) Vinoski97] This development, and especially the CORBA architecture is ....

R.M. Needham and A.J. Herbert. The Cambridge Distributed Computing System. Addison-Wesley Publishing Company, 1982. (p 15)

....resources may, for example, include generally useful facilities, such as those providing input and output functionality, as well as more specialised application oriented services. In a system where the number of resources is relatively small, such as the Cambridge Model Distributed System (CMDS) HN82] a basic name server suffices as a means of resource location. Such a utility provides a simple mapping from resource names to their location at given machine addresses. It operates on the assumption that clients of the name server will be familiar with the names of the resources in the system. ....

....i.e. they have a consistent interpretation across the network. Resolution of such names can be achieved using a single level mapping of the names to their corresponding network addresses. This mapping can be maintained by a central name server e.g. the Cambridge Model Distributed System (CMDS) HN82] name server, or by a number of distributed servers, each with responsibility either for the entire mapping or a portion thereof. Alternatively, a simple broadcast protocol may be utilised for resolution, whereby an entity wishing to locate an object s address can broadcast a request for it, ....

A. J. Herbert and R. M. Needham. The Cambridge distributed computing system. International Computer Science Series. Addison-Wesley, 1982.

....not necessarily prevent others from continuing. Distribution may be provided at many levels in a computer system. For example systems such as NFS [SGK 85] provide distribution to the Unix file system whereas other systems such as Amoeba [MRT 90] Accent [RR81] and the Cambridge Distributed Systems [NH82] decentralise the operating system across a number of nodes. One of the design aims of these systems is to attempt to hide the distribution and create the illusion of a single system. In contrast many programming languages provide language features such as RPC [Nel81] or the Ada rendezvous that ....

Needham, R.M. & Herbert, A.J. "The Cambridge Distributed Computing System". Addison-Wesley, Wokingham (1982).

....is done completely automatically by what is called a distributed operating system. Few such systems have been designed, and even fewer have been implemented. Fewer still, are actually used by anyone (yet) One of the earliest distributed systems was the Cambridge Distributed Computing System [Needham and Herbert, 1982] Later, other systems were developed, such as Locus [Walker at al, 1983] Mach [Accetta et al., 1986] V Kernel [Cheriton, 1988] and Chorus [Rozier et al. 1988] Most of the classical distributed systems literature, however, describes work on parts of, or aspects of distributed systems. There are ....

R. M. Needham and A. J. Herbert [1982]. The Cambridge Distributed Computing System. Addison Wesley, Reading, MA, 1982.

....netlib.bell labs.com. dard mutual exclusion algorithms [37] communications network design problems [65] or protocol design problems [2] 3] 22] 23] 7] 16] 36] 51] In the course of the work on SPIN, we have also constructed verification models for, e.g. the Cambridge ring protocol [56], and the IEEE logical link control protocol LLC 802.2 [52] Others constructed fragments of larger protocol applications such as XTP [70] and TCP IP. These and other unpublished models are available from the author. SPIN has also been applied to the verification of data transfer protocols [5] ....

R.M. Needham and A.J. Herbert, The Cambridge Distributed Computing System. London: Addison-Wesley, 1982. HOLZMANN: THE MODEL CHECKER SPIN 17 J:\PRODUCTION\TSE\2-INPROD\MAY\104928.0\104928_1.DOC regularpaper97.dot S 19,968 05/29/97 4:13 PM 17 / 17

....time. 3.1 Processor pool The processor pool model effectively avoids the idle workstation problem by logically decoupling the processor from the desktop platform and placing it in a pool. The first system based on the processor pool model was the Cambridge Distributed Computing System [NH82] The most cited system that incorporates a processor pool is the Amoeba system [TvRvS 90] while more recent systems include Plan 9 and Clouds [CDK94] In this model processes are allocated to processors for their lifetimes and thus process migration is unnecessary. In the Amoeba system, the ....

R.M. Needham and A.J. Herbert. The Cambridge Distributed Computing System. Addison-Wesley, Wokingham, 1982.

....transfer protocol (FTP) remote terminal protocol (Telnet) mail transfer protocol (MTP) etc. Internet datagrams are the common coin, decoupling higher levels from the details of the packet transport mechanism. Unlike other systems based on local networks, such as the Cambridge ring [36] or the Apollo domain system [31] the Alto system takes no advantage of the special properties of the Ethernet. Instead, all clients of the communication facilities use Internet datagrams, which present the same interface whether the data travels over the Ethernet, over a telephone line, or ....

R. M. Needham and A. J. Herbert. The Cambridge Distributed Computing System. AddisonWesley, 1982.

No context found.

R. M. Needham and A. J. Herbert, The Cambridge Distributed Computing System, Addison-Wesley (1982).

No context found.

R.M. Needham and A.J. Herbert. The Cambridge Distributed Computing System. Addison-Wesley, London, 1982.

No context found.

R.M. Needham and A.J. Herbert. The Cambridge Distributed Computing System. Addison-Wesley, London, 1982.

No context found.

R. M. Needham and A. H. Herbert, The Cambridge Distributed Computing System. Addison Wesley, Jan. 1982. ISBN 0-20114-092-6.

No context found.

R. M. Needham and A. H. Herbert, The Cambridge Distributed Computing System. Addison Wesley, Jan. 1982. ISBN 0-20114-092-6.

No context found.

R. M. Needham and A. J. Herbert, The Cambridge Distributed Computing System, Addison-Wesley, 1982.

No context found.

R.M. Needham and A.J. Herbert. The Cambridge distributed computing system. International Computer Science Series. Addison-Wesley Publishing Company, University of Cambridge, 1982.

No context found.

Needham, R.M., Herbert A.J., "The Cambridge Distributed Computing System," Addison-Wesley Publ., London, 1982.

No context found.

R.M. Needham,A.J.Herbert, "The Cambridge Distributed Computing System", Publ. Addison-Wesley Publishing Company, 1984.

No context found.

Needham, R.M. and Herbert, A.J.. The Cambridge Distributed Computing System. Addison-Wesley, London, 1982.

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