DMCA
PVM: A Framework for Parallel Distributed Computing (1990)
Venue: | Concurrency: Practice and Experience |
Citations: | 788 - 27 self |
Citations
254 |
ªA Algorithm for Mutual Exclusion in Decentralized Systems,º
- Maekawa
- 1985
(Show Context)
Citation Context ...cesses is deemed to have acquired the lock. Different strategies, varying in their approach, efficiency, and level of failure resiliency have been proposed and representative methods are described in =-=[12, 13, 14]-=-. The strategy adopted in PVM is somewhat different from these approaches, but thes- algorithm is efficient and, more importantly, is integrated with the required distribution to all pvmds of lock loc... |
99 |
Programming for parallelism.
- Karp
- 1987
(Show Context)
Citation Context ...n from a barrier call with a negative result value. In addition to barriers, or as an alternative, the waituntil construct is also provided as a means of synchronization. This construct (suggested in =-=[10]-=-) takes an event name as an argument and blocks until another process indicates the occurrence of that event by using the ready primitive mentioned earlier. 2.3. Shared Memory and Mutual Exclusion The... |
36 |
Efficient solution to the distributed mutual exclusion problem
- Agrawal, Abbadi
- 1989
(Show Context)
Citation Context ...cesses is deemed to have acquired the lock. Different strategies, varying in their approach, efficiency, and level of failure resiliency have been proposed and representative methods are described in =-=[12, 13, 14]-=-. The strategy adopted in PVM is somewhat different from these approaches, but thes- algorithm is efficient and, more importantly, is integrated with the required distribution to all pvmds of lock loc... |
23 |
A tree based algorithm for distributed mutual exclusion," ACM transactions on computer system
- Raymond
- 1989
(Show Context)
Citation Context ...cesses is deemed to have acquired the lock. Different strategies, varying in their approach, efficiency, and level of failure resiliency have been proposed and representative methods are described in =-=[12, 13, 14]-=-. The strategy adopted in PVM is somewhat different from these approaches, but thes- algorithm is efficient and, more importantly, is integrated with the required distribution to all pvmds of lock loc... |
16 |
P.: Marionette: a System for Parallel Distributed Programming Using a Master/Slave Model
- Sullivan, Anderson
- 1988
(Show Context)
Citation Context ...ber project [15] is somewhat different in that the targeted environment is a collection of homogeneous multi-processors. One of the operating modes within DPUP, as well as projects such as Marionette =-=[7]-=- and MSPCM [8], uses the master-slave approach, where a central controlling process is responsible for, or is involved in, every system event. In addition to affecting performance and being an unnatur... |
15 |
Matrix Algorithms on a Hypercube I
- Fox, Otto
- 1987
(Show Context)
Citation Context ...vailable, a hybrid algorithm, at a sufficiently high level of granularity, may be used to advantage. A straightforward, but illustrative example is matrix multiplication using subblock decompositions =-=[18]-=-. In an environment consisting of different types of scalar machines and multiprocessors, highly effective and efficient algorithms for matrix multiplication can be implemented, with some subblocks be... |
13 |
User datagram protocol,” Internet Request For Comments
- Postel
- 1980
(Show Context)
Citation Context ...virtual circuits --- for the projected use of PVM, the overheads and scalability limitations of using such a service directly did not warrant its adoption. In the test implementations of PVM, the UDP =-=[11]-=- protocol was used; this deliberate choice of a simple datagram protocol also permits relatively simple porting or protocol conversion when PVM is to be installed under a different operating system en... |
6 |
Guide to Parallel Programming on Sequent
- Osterhaug
- 1986
(Show Context)
Citation Context ... PVM locking facilities for resource sharing between other components that executed on other architectures. An example code skeleton depicting this situation on a Sequent shared memory multiprocessor =-=[19]-=- is shown in Figure 6. 2.4. Miscellaneous Facilities In addition to the primary constructs described in the preceding sections, a few miscellaneous constructs are also provided. The status construct t... |
5 |
DPUP: A distributed processing utilities package
- Gardner, Gerard, et al.
- 1986
(Show Context)
Citation Context ...n several situations. Several projects similar to PVM have been undertaken in the past, and some are ongoing. A few representative examples are listed below, with comparisons to PVM. The DPUP library =-=[4]-=- emulates a loosely coupled multiprocessor on a local network, as does the dsim [5] system and the Cosmic environment [6]. The two latter systems require the preconfiguration of a virtual machine on w... |
3 |
The Amber System: Parallel Programming on a Network of Multiprocessors
- al
- 1989
(Show Context)
Citation Context ...the Cosmic environment [6]. The two latter systems require the preconfiguration of a virtual machine on which applications execute and support only basic message passing mechanisms. The Amber project =-=[15]-=- is somewhat different in that the targeted environment is a collection of homogeneous multi-processors. One of the operating modes within DPUP, as well as projects such as Marionette [7] and MSPCM [8... |
2 |
A Master-Slaves Parallel Computation Model
- Riccardi, Traversat, et al.
- 1989
(Show Context)
Citation Context ...5] is somewhat different in that the targeted environment is a collection of homogeneous multi-processors. One of the operating modes within DPUP, as well as projects such as Marionette [7] and MSPCM =-=[8]-=-, uses the master-slave approach, where a central controlling process is responsible for, or is involved in, every system event. In addition to affecting performance and being an unnatural model for c... |
2 |
Some Performance Comparisons for a Fluid Dynamics Code", Parallel Computing
- Lozier, Rehm
- 1989
(Show Context)
Citation Context ...ithin a unified framework, and cumbersome, and sometime impractical, to execute the system on a single machine. An example of such a system is the fluid dynamics application termed BF3D, described in =-=[17]-=-. This application is not only compute intensive; it uses large amounts of memory, creates very large quantities of output data, and requires 2D and 3D graphics terminals to display results. The algor... |
2 |
Designing Efficient Barriers in Communication Networks
- Finkel, Styer, et al.
- 1990
(Show Context)
Citation Context ...lict resolution rules and highest priority to incoming requests, undesirable inconsistencies are avoided.s- Barrier synchronization in PVM is accomplished by using an efficient algorithm described in =-=[20]-=-. The algorithm considers the pvmd processes as being the vertices in a logical quadratic network. In such a network each vertex i has outgoing links to j such that j = i + 2 r modN, where N is the nu... |
1 |
Design of a Simulation Interface for a Parallel Computing Environment
- Narang, Flanery, et al.
- 1990
(Show Context)
Citation Context ...ut management, and graphical display components of the system. Another example of an application with differing requirements for individual sub-algorithms is the Global Environment Simulation project =-=[2]-=-, a large simulation effort to study contaminant concentrations and dispersal characteristics as a function of various environmental factors. The ideal computational requirements of this simulation ar... |
1 |
Hypercube Simulation on a Local Area Network, Oak Ridge National Laboratory Report ORNL/TM-10685
- Dunigan
- 1988
(Show Context)
Citation Context ...ast, and some are ongoing. A few representative examples are listed below, with comparisons to PVM. The DPUP library [4] emulates a loosely coupled multiprocessor on a local network, as does the dsim =-=[5]-=- system and the Cosmic environment [6]. The two latter systems require the preconfiguration of a virtual machine on which applications execute and support only basic message passing mechanisms. The Am... |
1 |
The C programmer's Abbreviated Guide to
- Seitz, Seizovic, et al.
- 1988
(Show Context)
Citation Context ...sentative examples are listed below, with comparisons to PVM. The DPUP library [4] emulates a loosely coupled multiprocessor on a local network, as does the dsim [5] system and the Cosmic environment =-=[6]-=-. The two latter systems require the preconfiguration of a virtual machine on which applications execute and support only basic message passing mechanisms. The Amber project [15] is somewhat different... |