Henri E. Bal, Robbert van Renesse, and Andrew S. Tanenbaum. Implementing distributed algorithms using remote procedure call. In Proceedings of the  Home/Search   Document Details and Download   Summary   Related Articles   Check

....make command might need to do six compilations, so six processors could be taken out of the pool for the time necessary to do the compilation and then returned. Alternatively, with a five pass compiler, 5 x 6 = 30 processors could be allocated for the six compilations, gaining even more speedup [6, 7]. Third are the specialized servers, such as directory, file, and block servers, data base servers, bank servers, boot servers, and various other servers with specialized functions. Fourth are the wide area network gateways, which are used to link Amoeba systems at different sites in possibly ....

Bal, H. E., Renesse, R. van, and Tanenbaum, A. S., "Implementing Distributed Algorithms Using Remote Procedure Calls," Proc. of the 1987 National Computer Conf ., pp. 499-506, Chicago, IL, June 1987.

....dynamically allocatable processors together form the so called processor pool . These processors may be allocated for compiling or text formatting purposes, or for distributed or parallel algorithms. Among other applications, we have implemented a parallel make [10] and parallel heuristic search [11]. Specialized servers include filing servers such as the Bullet file server, and the directory server. The directory server is used in conjunction with the Bullet server. It s function is to handle naming and protection of Bullet server files and other objects in a simple, uniform way. Servers ....

Bal, H. E., Renesse, R. van, and Tanenbaum, A. S., "Implementing Distributed Algorithms Using Remote Procedure Calls," Proc. of the 1987 National Computer Conf., pp. 499-506, Chicago, IL (June 1987).

....make command might need to do six compilations, so six processors could be taken out of the pool for the time necessary to do the compilation and then returned. Alternatively, with a five pass compiler, 5 x 6 = 30 processors could be allocated for the six compilations, gaining even more speedup [6, 7]. Third are the specialized servers, such as directory, file, and block servers, data base servers, bank servers, boot servers, and various other servers with specialized functions. Fourth are the wide area network gateways, which are used to link Amoeba systems at different sites in possibly ....

Bal, H.E., Renesse R. van, and Tanenbaum, A.S.: "Implementing Distributed Algorithms Using Remote Procedure Calls," Proc. 1987 National Computer Conference, pp. 499-506, June 1987.

....but that support for applications that run on multiple machines is weak. The current IPC mechanisms, with Remote Procedure Call as the most popular one, are adequate only for the simpler distributed applications, as they do not address any of the internal management issues of distribution [Ham84, BvRT87, TvR88] Our goal is to add stronger functionality and semantics to the existing Mach and Chorus message interfaces, rather than defining a new interface. This functionality and semantics will take the form of Horus news groups. In this section we will first look at the existing Mach and Chorus ....

Henri E. Bal, Robbert van Renesse, and Andrew S. Tanenbaum. Implementing distributed algorithms using remote procedure call. In Proceedings of the

....In our research, we are studying the implementation of parallel applications on distributed systems. We started out by implementing several coarse grained parallel applications on top of the Amoeba system, using Remote Procedure Calls (RPC) Birrell and Nelson 1984] for interprocess communication [Bal et al. 1987]. RPC is widely used in the distributed systems community ############# This research was supported in part by the Netherlands organization for scientific research (N.W.O. under grant 125 30 10. for implementing distributed servers (e.g. file servers) Tanenbaum and Van Renesse 1985] For ....

....model, it is very difficult to let processes share data that are always kept up todate. A halfway solution is to let each worker maintain its own local minimum and update this local variable whenever the worker gets a new job. This approach still suffers from a significant search overhead, however [Bal et al. 1987]. With the shared data object model, on the other hand, right X: box Manager arrow J: box wid 1.5 boxwid arrow Wm: box Worker arrow M: box wid 0.75 boxwid ht 0.75 boxht Wh:box Worker with .s at Wm.n (0, 0.5 boxht) Wl:box Worker with .n at Wm.s (0, 0.5 boxht) arrow from J.e to Wh.w ....

[Article contains additional citation context not shown here]

Bal, H. E., Van Renesse, R., and Tanenbaum, A. S., Implementing Distributed Algorithms Using Remote Procedure Calls, Proc. AFIPS Nat. Computer Conf., Vol. 56, pp. 499-506, AFIPS Press, Chicago, Ill., June 1987.

....1 and P processors. Thus, by definition, the speedup with 1 processor is always 1.0. With 10 processors, the Orca program is 9.96 times faster as with one processor. It is interesting to compare the performance of the Orca TSP program with an earlier implementation of TSP in C, on top of Amoeba [Bal et al. 1987]. The C Amoeba version uses Remote Procedure Call for interprocess communication. It is similar to the Orca version, except that replication of the shared variable mi n imum is dealt with by the programmer rather than the RTS. If a worker in the C Amoeba version finds a better full route, it does ....

Bal, H. E., Van Renesse, R., and Tanenbaum, A. S., Implementing Distributed Algorithms Using Remote Procedure Calls, Proc. AFIPS Nat. Computer Conf., Vol. 56, pp. 499-506, AFIPS Press, Chicago, IL, June 1987.

No context found.

Bal, H.E., Renesse, R. van, and Tanenbaum, A.S. Implementing Distributed Algorithms using Remote Procedure Call, Proc. National Computer Conference , AFIPS, 1987. pp. 499-505.

....to have a higher level language in which to write parallel applications. A Ph.D. student, Henri Bal, undertook the design and implementation of such a language. In preparation, Bal and van Renesse implemented some example parallel programs (mostly coarse grained and non numerical) on Amoeba in C [4]. This demonstrated both the feasibility of writing applications on top of Amoeba, and that doing so required a great deal of effort. Even such simple things as sharing an integer counter between processes proved difficult, primarily because Amoeba s library routines for message passing, process ....

H. E. Bal, R. van Renesse, and A. S. Tanenbaum. Implementing Distributed Algorithms Using Remote Procedure Calls. In Proc. AFIPS Nat. Computer Conf., volume 56, pages 499--506. AFIPS Press, June 1987.

....will succeed in calling r emove head. Other processes will suspend until more elements are appended to the queue. 5.3. An example program We have used the object types discussed above to design a distributed Traveling Salesman Problem (TSP) algorithm, based on an earlier algorithm described in [Bal et al. 1987]. The algorithm uses one process to generate partial routes for the salesman (containing only part of the cities) and any number of worker processes to further expand (search) these partial solutions. A worker systematically generates all full routes that start with the given initial route, and ....

Bal, H. E., Van Renesse, R., and Tanenbaum, A. S., Implementing Distributed Algorithms Using Remote Procedure Calls, Proc. AFIPS Nat. Computer Conf., pp. 499-506, AFIPS Press, Chicago, Ill., June 1987.

....Traveling Salesman Problem In addition to various experiments with the UNIX software, we have also tried programming some applications in parallel. Typical applications are the traveling salesman problem [13] and alpha beta search [14] We briefly describe these below. More details can be found in [3]. In the traveling salesman problem, the computer is given a starting location and a list of cities to be visited. The idea is to find the shortest path that visits each city exactly once, and then return to the starting place. Using Amoeba we have programmed this application in parallel by having ....

Bal, H.E., Van Renesse, R., and Tanenbaum, A.S. Implementing Distributed Algorithms using Remote Procedure Call. Proc. Nat. Comp. Conf. , AFIPS, 1987. pp. 499-505.

....support for memory management and communication between processes on the same machine, but that support for applications that run on multiple machines is weak. The current IPC mechanisms, with Remote Procedure Call as the most popular one, are adequate only for the simpler distributed applications [7, 8, 9]. The new ISIS system has several well defined layers. This paper discusses each layer in turn. The lowest layers, which implement multicast transport and failure detection, are near completion and currently run on SUN OS using SUN LWP threads, on MACH using C Threads, and on the x kernel [10] ....

H. E. Bal, R. van Renesse, and A. S. Tanenbaum, "Implementing Distributed Algorithms using Remote Procedure Call," Proc. of the 1987 National Computer Conf., pp. 499-506, Chicago, IL, June 15-18, 1987.

No context found.

H.E. Bal, R. van Renesse, and A.S. Tanenbaum, "Implementing Distributed Algorithms Using Remote Procedure Calls," Proc. AFIPS Nat. Computer Conf., Chicago, IL 56, pp. 499-506, AFIPS Press (June 1987).

....more work. The taskbag is implemented as a distributed data structure, accessible by all workers. We have combined the advantages of (simulated) shared variables and taskbags in the design of a distributed Traveling Salesman Problem (TSP) algorithm, based on an earlier algorithm described in [Bal et al. 1987]. The algorithm uses one process to generate partial routes for the salesman (containing only part of the cities) and any number of worker processes to further expand (search) these partial solutions. A worker systematically generates all full routes that start with the given initial route, and ....

Bal, H. E., Van Renesse, R., and Tanenbaum, A. S., Implementing Distributed Algorithms Using Remote Procedure Calls, Proc. AFIPS Nat. Computer Conf., Vol. 56, pp. 499-506, AFIPS Press, Chicago, IL, June 1987.

....research, we are studying the implementation of parallel applications on distributed systems. We started out by implementing several coarse grained parallel applications on top of the Amoeba system, using an existing sequential language extended with message passing for interprocess communication [2]. We felt that, for parallel applications, both the use of message passing and a sequential base language have many disadvantages, making them complicated for applications programmers to use. Since then, we have developed a new language for distributed programming, called Orca [3, 4, 5] Orca is ....

H.E. Bal, R. van Renesse, and A.S. Tanenbaum, "Implementing Distributed Algorithms Using Remote Procedure Calls," Proc. AFIPS Nat. Computer Conf., Chicago, Ill. 56, pp. 499-506, AFIPS Press (June 1987).

No context found.

Bal, H.E., Renesse, R. van, and Tanenbaum, A.S.: "Implementing Distributed Algorithms using Remote Procedure Call," Proc. National Computer Conference , AFIPS, pp. 499505, 1987.

No context found.

Bal, H.E., Renesse, R. van, and Tanenbaum, A.S. Implementing Distributed Algorithms using - Remote Procedure Call, Proc. National Computer Conference , AFIPS, 1987. pp. 499-505.

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