Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....p, do not change dynamically his restrictions on further inputs; so it cannot model recon gurable systems based on broadcast. In [5] Ene and Muntean introduce b calculus as a framework which combine mobility and broadcast (as it is the case for processes which use group communications la PVM [9], buses based recon gurable architectures or Packet Radio Networks) In [8] the authors develops for b calculus a theory of co inductive equivalences and congruences. Bisimulations have been successfully used in processes algebra to compare two systems according to their operational ability to ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jiang, and V. Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994.

....(Cambridge and Bath algebra system) It gives an overview of the system packages and the specification of the main interfaces. The first version of CABAL by Norman and Fitch [93] was written as a small system for polynomial algebra. It used the PVM (parallel virtual machine) communication library [51, 50]. This report is based on our new development of the system [88] based on the message passing interface (MPI) In addition, the memory model has been extended. New packages for multiprecision integers, matrix algebra and Grobner base computations have been added. As CABAL 2.0 is a much larger ....

....Virtual Machine (PVM) was the first widely available established communication middleware. The PVM model provides a virtual machine on a heterogeneous, loosely coupled networks of workstations. The virtual machine is an abstraction that presents the di#erent machines as a single parallel computer [50], and communication is achieved through message passing. Several systems have been built on the PVM model, and first versions of CABAL [93] were based on this model. The virtual machine concept in PVM places stronger requirements on process management facilities, making PVM stronger than MPI in ....

A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge, Mass., 1994.

.... in parallel languages such APL[3] DAP Fortran [4] Parallel Pascal[5] Parallel Forth[6] C [7] CM lisp [8] FGPC [9] and MPL[10] aCe has been implemented on top of native C compilers such as gcc and Maspar MPL and on top of message passing libraries such as Cray SHMEM, MPI [11] and PVM [12]. In this paper, we will focus on particular features of aCe C (from now on will refer to it as aCe) with examples. For more details on the language, we refer the readers to see the language reference manual [2] There are many texts that introduce parallel programming [13] 20] Most focus on ....

Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R. and Sunderam, V.S., PVM - A Users' Guide and Tutorial for Networked Parallel Computing, MIT Press, 1994.

....be executed at the other process. the new send has to wait for the send bu er to be free 5.2 PVM library The Parallel Virtual Machine (PVM) version 3.3. 11 is a message passing system that enables a heterogeneous network of computers to be used as a single, distributed memory parallel computer [27]. This network is referred to as the virtual machine. A PVM program may run any number of tasks or processes using an SPMD or MPMD paradigm. A communication daemon (called pvmd) is started on each host of the virtual machine. Each message sent by a process will be forwarded to the pvmd on the ....

Al Geist, Adam Beguelin, Jack Dongorra, Weicheng Jiang, Robert Mancheck and Vaidy Sunderam. PVM A Users' Guide and Tutorial for Networked Parallel Computing. The MIT press, Cambridge, Massachusetts, London, England, 1994. Available from ftp: //netlib2.cs.utk.edu/pvm3/book/pvm-book.ps.

....packages aimed at both shared and distributed memory programming paradigms. Some have been written from scratch. Others, such as ScaLAPACK [3] build on the work of sequential libraries. ScaLAPACK is a subset of LAPACK that is portable across any system supporting the message passing systems PVM [12] or MPI [20] Design issues, and the provision of an amenable user interface, have certainly been attended to in the development of these software packages, for example, the BLAS (Basic Linear Algebra Subprograms) 6] 7] 8] 9] 17] as the basic building blocks for LAPACK. The BLAS define ....

Geist, A., Beguelin, A., Dongarra, J., Manchek, R., Jiang W., and Sunderam, V. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994.

....so it cannot model recon gurable systems based on broadcast. To summarise, it seems that there is not a framework which try to analyse (at least at theoretical level) what it happens if we combine mobility and broadcast (as it is the case for processes which use group communications a la PVM [6], buses based recon gurable architectures or Packet Radio Networks) The aim of this paper is to introduce a new process calculus, whose unique and basic communication primitive is broadcast, and which permits to model recon gurable group communication systems. The rest of the paper is as follows. ....

.... communication primitives b calculus provide a framework to specify and analyse systems which interact by a broadcast (or multicast) mechanism combined with mobility of processes ( names, addresses) We take here, as an example programs which use communication primitives of PVM like libraries ([6]) PVM is a software system that permits a network of heterogeneous computers to be used as a single parallel computer (the virtual machine) Thus large computational problems may be solved using the power of many computers. PVM supplies functions to automatically start up tasks on the virtual ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jiang, and V. Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994.

....Conceptually, this is not different from DM MIMD computing, but the communication between processors is often orders of magnitude slower. Many packages to realise distributed computing, commercial, and non commercial are available. Examples of these are PVM (standing for Parallel Virtual Machine) [7], and MPI (Message Passing Interface, 8, 15] PVM and MPI have been adopted for instance by Convex, Cray, IBM and Intel for the transition stage between distributed computing and MPP on the clusters of their favorite processors and they are available on a large amount of distributed memory MIMD ....

....where the user has to distribute the data over the processors and also the data exchange between processors has to be performed explicitely. The initial reluctance to use DM MIMD machines seems to have been decreased. Partly this is due to the now existing standard software for communication ([7, 15]) and partly because, at least theoretically, this class of systems is able to outperform all other types of machines. The advantages of DM MIMD systems are clear: the bandwidth problem between CPU and memory that haunts shared memory systems is avoided because the bandwidth scales up ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jaing, and V. Sunderam, PVM: A Users' Guide and Tutorial for Networked Parallel Computing, MIT Press, Boston, 1994.

....system can trade CPU cycles for improved memory and network bandwidth usage. Applications, such as large scale virtual environments and simulations [6, 8, 16] that span wide area networks are gaining in popularity. Many of these applications are written using message passing systems, such as PVM [9] and MPI [7] Unfortunately, the message passing communication abstraction makes constructing such applications difficult because it forces the programmer to focus on communication details, that is, what messages need to be sent to which processes. The DSM abstraction provides a more ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jiangand, and V. Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994.

....monitor and bound their own resource usage, further reducing monitoring overheads. Keywords: Performance Monitoring, Distributed Computing, Parallel Applications, Steering, Reactive Systems 1 Introduction Multi processor systems have been used to solve many computationally intensive problems [3, 14, 15, 16, 19]. However, these systems often fail to achieve the magnitude of expected speedup. Monitoring systems have been used to debug and optimize performance. The PDM system extends the abilities and features of past systems with efficient mobile and extensible code that can be decomposed and migrated to ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jiangand, and V. Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994.

....2. Aggregate bandwidth of the PVFS installation at PC # . Gigabit university backbone. Figure 3 depicts the resulting topology. The benefits are: # a faster connection to remote file servers and the Internet, # an improved performance of the FastEthernet based message passing libraries (PVM [11], MPICH [20] # the opportunity to build a larger FastEthernet based cluster consisting of 256 processors. Monitoring: The more autonomous nodes a cluster consists of the more time has to be spent to keep the system up and running. Since human resources are expensive, automated monitoring of ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jiang, and V. Sunderam, PVM: A Users' Guide and Tutorial for Networked Parallel Computing, MIT Press, 1994.

....for a DM MIMD system using a message passing model like MPI or PVM. SGI provides its Message Passing Toolkit of which we used version 1.1 and, in particular, version 3.0 of SGI s proprietary MPI implementation. We will not discuss PVM and MPI here. Details of these libraries can be found in [9, 18]. For the launching of MPI programs the mpirun script can be employed. It agrees with the mpirun script as is provided with the wide spread public domain workstation MPI implementation MPICH [3] Apart from the PVM and MPI libraries the Message Passing Toolkit contains the shmem library. This ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jaing, and V. Sunderam, PVM: A Users' Guide and Tutorial for Networked Parallel Computing, MIT Press, Boston, 1994.

....of only a few modified Euler steps. Since the numerical schemes in SP 1 and SP 3 are explicit, therefore the CFL condition, 4t 4x 2 2K where K = maxfk (n) i g, must be satisfied. A sequential Fortran program has been written to perform the above tasks. PVM (Parallel Virtual Machine) [Gei94] is used to provide distributive directives in order that the tasks can be distributed onto a network of Sun workstations. For the present studies, only two Sun workstations are required. Numerical Tests A number of tests was performed by taking the conductivity as k(u) a bu cu 2 du ....

Geist A. (1994) PVM - a User Guide and Tutorial for Networked Parallel Computing. MIT Press, London.

....this implementation, and in the following sections we describe additional experiments which were performed using this implementation. 3.6.1 Sort First Software Implementation We have written a parallel sort first software based implementation. PVM is used to provide multiprocessing capability [GEIS94]. A host program spawns processes for each graphics processor and the framebuffer. The system implements the MAHD loadbalancing algorithm in both the stochastic and previous frame forms. It also implements two systems for dealing with hierarchical graphics databases; these will be discussed in the ....

A. Geist, A. Beguelin, J. Dongarra,, R. Mancheck, W. Jiang, and V. Sunderam, PVM: A Users' Guide and Tutorial for Networked Parallel Computing, MIT Press, Cambridge, Mass., 1994 (also http://www.netlib.org/pvm3/book/pvm-book.html).

....into MPI the Jack J. Dongarra, Steve W. Otto, Marc Snir, and David Walker Standard MPP and Work st at ions for COMMUNICATIONS OF THE ACM July 1996 Vol. 39, No. 7 85 most useful features of several systems, rather than choosing a single system as the standard. MPI has roots in PVM [4, 5], Express [9] P4 [1] Zipcode [10] and PARMACS [2] and in systems sold by IBM, Intel, Meiko Scientific, Cray Research, and nCube. MPI is used to specify the communication among a set of processes forming a concurrent program. The message passing paradigm is attractive because of its wide ....

Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., and Sunderam, V. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge, Mass., 1994. The book is available electronically; see ftp://www.netlib.org/pvm3/ book/pvm-book.ps.

....is a collection of parallel Fortran 77 routines for the solution of numerical and statistical problems. The library is primarily intended for distributed memory parallel machines, including networks and clusters, although it can readily be used on shared memory parallel systems that implement PVM [5] or MPI [11] The library supports parallelism and memory scalability, and has been designed to be portable across a wide range of parallel machines. The library assumes a Single Program Multiple Data (SPMD) model of parallelism in which a single instance of the user s program executes on each of ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jiang, and V. Sunderam, (1994), PVM: A Users' Guide and Tutorial for Networked Parallel Computing , The MIT Press, Cambridge, Massachusetts.

....to compute both sets. Their Matlab (see [Mat1990] routines have been translated in Fortran. In section 2, we briefly recall the methods for computing both sets and the main ideas of the algorithm. Since both computations can be parallelized in a natural way, we have implemented a PVM (see Geist, Beguelin, Dongara and al. 1994)) version of both codes. After recalling some basic ideas of PVM in section 3, the parallel implementation of the codes is described in section 4. The sequential and PVM versions have been included in the package. In section 5, numerical experiments on homogeneous and heterogeneous clusters of ....

....Computer 2 Workstation 2 Workstation 3 Workstation 4 Network : ethernet, FDDI, HiPPI . Figure 8: Example of a parallel virtual machine. PVM is a public domain message passing library which is accessible via netlib. We give a short overview of this package. A more detailed description is given in Geist, Beguelin, Dongara and al. 1994). This package allows the user to run code (Fortran or C) as if he runs it on a parallel computer just using the available computers connected via a network. An example of possible parallel virtual machine is given in Figure 8. According to the 10 terminology of Geist, Beguelin, Dongara and al. ....

[Article contains additional citation context not shown here]

A. Geist, A. Beguelin, J. Dongara, W. Jiang, R. Manchek, and V. Sunderam, (1994), PVM: A Users' Guide and Tutorial for 26 Networked Parallel Computing, The MIT Press, Cambridge, Massachusetts.

....derived data types, while keeping the in line with other Fortran developments at the DAO. The communication layer is implemented using MPI [12] however the communication interfaces defined in PILGRIM s primary layer could conceivably be implemented with other message passing libraries, e.g. PVM [13], or with other paradigms, e.g. Cray SHMEM [14] or even with shared memory primitives which are available on shared memory machines like the SGI Origin or SUN Enterprise. This document is structured in a bottom up fashion: in Section 2 requirements for PILGRIM are derived from GEOS DAS ....

Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994.

....The library is divided into chapters, each devoted to a branch of numerical analysis or statistics. The library is primarily intended for distributed memory parallel machines, including networks and clusters, although it can readily be used on shared memory parallel systems that implement PVM [6] or MPI [9] The library supports parallelism and memory scalability, and has been designed to be portable across a wide range of parallel machines. The library assumes a Single Program Multiple Data (SPMD) model of parallelism in which a single instance of the user s program executes on each of ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jiang, and V. Sunderam, (1994), PVM: A Users' Guide and Tutorial for Networked Parallel Computing , The MIT Press, Cambridge, Massachusetts.

....is a collection of parallel Fortran 77 routines for the solution of numerical and statistical problems. The library is primarily intended for distributed memory parallel machines, including networks and clusters, although it can readily be used on shared memory parallel systems that implement PVM [5] or MPI [12] The library supports parallelism and memory scalability, and has been designed to be portable across a wide range of parallel machines. The library assumes a Single Program Multiple Data (SPMD) model of parallelism in which a single instance of the user s program executes on each of ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jiang, and V. Sunderam, (1994), PVM: A Users' Guide and Tutorial for Networked Parallel Computing , The MIT Press, Cambridge, Massachusetts.

No context found.

A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994. The book is available electronically, the url is ftp://www.netlib.org/pvm3/book/pvm-book.ps.

....management. Currently, connections between clients and servers are made through TCP IP sockets. IBP client calls may be made by any process that can connect to an IBP server. IBP servers do not require administrative privileges to install and operate, so IBP has the flavor of software such as PVM [12] that can leverage the privileges of ordinary users to create a distributed computing platform. IBP servers can implement various storage allocation policies in order to control the local impact. For example, the IBP server may be allowed to allocate spare physical memory, or it may by directed to ....

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jaing, and V. Sunderam. PVM --- A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, Boston, 1994.

....Also, since both packages will be available on a wide variety of machines, code modifications required to change platforms should be minimal. There are various packages designed to provide a message passing interface that remains unchanged across multiple platforms, including PICL [13] PVM [12] and more recently, MPI [11] These packages are general libraries, however, and thus their interfaces are not as easily usable for linear algebra applications as we would like. In contrast, since the audience of the BLACS is known, the interface and methods of using the routines can be ....

A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994. The book is available electronically, the url is ftp://www.netlib.org/pvm 3/book/pvm-book.ps.

No context found.

Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994.

No context found.

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, W. Jaing, and V. Sunderam. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, Boston, 1994.

No context found.

Geist A., Beguelin A., Dongarra J, Jiang W., Manchek R. and Sunderam V. PVM: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press 1994.

First 50 documents

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