E. H. Baalbergen, `Parallel and distributed compilations in loosely-coupled systems: a case study', Proceedings of Workshop on Large Grain Parallelism, Providence, RI, October 1986.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....It is used at sites in four European countries which are connected via a wide area network. Contact: Sape J. Mullender, CWI Amsterdam, Netherlands or Andy Tanenbaum, Dept. of Mathematics and Computer Science, Vrije Universiteit, Postbus 7161, 1007 MC Amsterdam, Netherlands. References: [10], 11] 12] 13] 14] 15] 16] 17] 18] 19] 20] 21] 22] 23] 24] 25] 26] 27] 28] 29] 30] 31] 32] 2.4 Andrew Main Goal Andrew is a distributed computing environment being developed at the Carnegie Mellon University, Pittsburg in a workstation server ....

E. H. Baalbergen, "Parallel and Distributed Compilations in Loosely-Coupled Systems", In Proc. Workshop "Large Grain Parallelism", Providence, RI, October 1986.

....Compilation then takes as long as it takes to compile the biggest file. This kind of parallelism can be detected by programs such as make in Unix. This program builds an application using a file that describes the constituing components and their interdependencies. Versions of parallel make [Baalbergen, 1986] often build a graph describing the partial ordering for things to be done and thus detects the parallelism. Several language implementations attempt to provide mechanisms for expressing or exploiting parallelism. Basically, parallel languages come in two kinds: languages in which parallelism can ....

E. H. Baalbergen [1986]. Parallel and Distributed Compilations in Loosely-Coupled Systems. Proceedings of the Workshop on Large Grain Parallelism, Providence, RI, October 1986.

....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 ....

Baalbergen, E.H.: "Parallel and Distributed Compilations in Loosely Coupled Systems," Proc. Workshop on Large Grain Parallelism , Providence, RI, Oct 1986.

....a network of workstations. Finally, Section 8.4 discusses the measured effect of group management when multiple processor sharing applications are run simultaneously in a network. 8.1. Parallel Make Parallel make is a popular processor sharing application that has already been studied extensively [3, 4, 22]. Parallel make is similar to the traditional UNIX make program, except that parallel make runs several compilations simultaneously on a network of machines whereas traditional make invokes compilations sequentially on one machine. Thus, the running time of parallel make can be much shorter than ....

Baalbergen, Erik H., "Parallel and Distributed Compilations in Loosely-Coupled Systems: A Case Study", Proceedings of a Workshop on Large Grain Parallelism, Providence, RI, October 1986.

....make to reorder the dependency lists and overwrite a description file, or output a new description file. 3. PARALLELISM AND DISTRIBUTION Before discussing the techniques and problems of implementing a parallel make, we consider the relation between parallelism and distribution. Experiments [14] have shown that running several compilations in parallel on a single processor in general does not result in a significant speed up, since compilations are usually CPU bound. At best, while one process is doing I O, another one can compute. Several practical problems arise when running ....

....because each one may need several processes. If multiple processors are available, we can achieve a speed up by running each compilation on a different processor. The trick is to arrange for this parallelism without burdening the programmer with all the details. Several approaches are discussed in [14]. In what follows we will assume that the mechanics of forking off processes to remote CPUs is handled by the operating system. Our concern is what should be run in parallel, not how 278 parallel execution is achieved. We assume that the underlying operating system has a smart processor ....

E. H. Baalbergen, "Parallel and Distributed Compilations in Loosely-Coupled Systems: A Case Study," Proc. Workshop on Large Grain Parallelism, Providence, RI, October 1986.

No context found.

E. H. Baalbergen, "Parallel and Distributed Compilations in Loosely-Coupled Systems: A Case Study," Proc. Workshop on Large Grain Parallelism, Providence, RI, October 1986.

No context found.

E. H. Baalbergen, `Parallel and distributed compilations in loosely-coupled systems: a case study', Proceedings of Workshop on Large Grain Parallelism, Providence, RI, October 1986.

No context found.

E. H. Baalbergen. Parallel and distributed compilations in loosely-coupled systems: A case study. In Proceedings of Workshop on Large Grain Parallelism, Providence, RI, October 1986.

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