A. Beguelin, et. al., PVM 3 User's Guide and Reference Manual, Oak Ridge National Laboratory, ORNL/TM-12187, May 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Automatic Generation of Control Programs for.. - Busch, Ziegler.. (2002) (Correct)
....of T x and of T y and x y) This method ensures a reproducible series of tournaments so that the experiment is independent of system parameters such as network trac or workstation load. The resulting minimal set of tournaments is distributed over a heterogenous network of workstations using PVM [11]. 3 Dynamic Simulation of Robots In our system we simulate robots in a three dimensional physical environment by using the DynaMechs software package (see [10] This C programming library takes a model description of the robot and simulates its dynamics. The robot is given by a set of rigid ....
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM 3 User's Guide and Reference Manual. Oak Ridge National Laboratory, 1993.
Adaptive Parallel Computations on Networks of Workstations - Nibhanupudi (2000) (Correct)
....libraries for distributed memory computers, which can be used to program networks of workstations. PVM [69] Parallel Virtual Machine) is a software package that allows a het erogeneous network of parallel and serial computers to appear as a single concurrent machine. The PVM user library [29] provides routines for initiating processes on other machines, for communicating between processes, and changing the configura tion of machines. Otto et al. [35] discuss three systems that transparently migrate load among the workstations in the network for PVM applications. Migratable PVM (MPVM) ....
A1 Geist and et al. PVM 3 USER's Guide and Reference Manual. Technical report, Oak Ridge National Laboratory, Oak Ridge, Tennessee, September 1994.
Unsupervised Learning on Traditional and Distributed Systems - Patanè (Correct)
....studies will regard the possibility of dealing with input patterns with variable cardinality. The MULTISOFT Machine In this chapter, the MULTISOFT machine is described [7] It is a cluster of 32 PCs, running the LINUX operating system and using the Parallel Virtual Machine (PVM) software [95, 96] for inter process communications. The policy adopted for the management of the MULTISOFT machine permits a very fast increase of the number of the Processing Elements (PEs) that is the number of PCs. It is based on a completely centralized administration of the system, but particular care was ....
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM 3 Users's Guide and Reference Manual. Engineering Physics and Mathematics Division, Mathematicals Sciences Section, 1994.
Scheduling Problems in a Practical Allocation Model - Hollermann, Hsu, Lopez.. (1997) (1 citation) (Correct)
....enough to be used for any algorithm which can be represented as a set of tasks which communicate with each other and whose execution and communication costs are known or can be estimated. An example where such an algorithm would be helpful is a network of computers using PVM parallel software [11]. In today s environment, PVM program tasks are either scheduled by the programmer or, more often, they are arbitrarily allocated to processors(also called processing elements or PE s) The work of this paper is designed to allow the compiler and or operating system to perform such tasks. ....
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM 3 User's Guide and Reference Manual. Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831, USA, May 1993.
Visual Programming for Message-Passing Systems - Stankovic, Zhang (1999) (Correct)
....environments further complicate the programming task because such systems are harder to model for performance. A graph based programming language like the PCG with its set of symbols helps to formalize the process. 4. 1 Program Structure Figure 14 shows a C like message passing program [7]. It consists of three functions and a main. The program is using three processes with rank numbers equal to 0, 1 and 2. Each process runs a function that reflects its name (e.g. process 0 runs the function Proc0) main ( procRank = getid ( if (procRank = 0) Proc0 ( if (procRank = 1) ....
....or else the whole procedure repeats. 7. CONCLUSION Visper is a new tool for visual parallel programming that extends the functionality of the concurrency map [14] and space time diagram [9] to handle the composition of parallel programs for MIMD architectures. It is based on MPI [8] and PVM [7] for writing messagepassing applications in a heterogeneous computing environment. Central to Visper is a graphical editor by which the programmer directly inputs a PCG. The graph is scalable and hierarchical with a set of graphical symbols and constructs for describing communication and ....
Geist, G. A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., and Sunderam, V. S. PVM 3 User's Guide and Reference Manual. Technical Report ORNL/TM-12187, Oak Ridge National Laboratory, 1993.
The PCG: An Empirical Study - Stankovic, Kranzlmüller, Zhang (2001) (Correct)
....occur between communications, together with the communications size. Heterogeneous distributed environments in which MIMD programs execute further complicate the programming task because such systems are harder to model for performance and behavior. Figure 3 shows a C like message passing program [12]. It consists of three functions and a main. The program uses three processes with rank numbers equal to 0, 1 and 2. Each process executes a function that reflects its name (e.g. process 0 executes the function Proc0) All three functions are structured similarly, making use of point to point ....
....easy, and more clarification is needed here. 4.4. Solving the Matrix Multiply Problem The group of 12 subjects were those who first heard both presentations. All of them had at least some knowledge on parallel programming and could compare PCG to other programming approaches such as C, MPI, PVM [12], or HPF. They were given the goal of implementing a matrix multiplication algorithm [17] where on each process p ( i, j ) recv( a, p (i, j, 1) recv( b, p (i 1, j ) c c#a b; send( a, p (i, j#1) send( b, p (i#1, j ) in PCG, C and MPI, in a reasonable time relative to the first ....
A. G. Geist, A. Beguelin, J. J. Dongarra, W. Jiang, R. Manchek & V. S. Sunderam (1993) PVM 3 User 's Guide and Reference Manual. Technical Report ORNL/TM-12187, Oak Ridge National Laboratory.
High-Performance All-Software Distributed Shared Memory - Johnson (1995) (9 citations) (Correct)
....often realize better performance using message passing instead of shared memory. However, these gains can be relatively modest [11, 16] and frequently come at the cost of greatly increased programmer effort. In spite of this fact, message passing environments such as PVM (Parallel Virtual Machine)[24]andMPI(Message Passing Interface) 55] are often the de facto standards for programming multicomputers and networks of workstations. This is primarily due to the fact that these systems are portable. They require no special hardware, compiler, or operating system support, thus enabling them to run ....
....1.0 distribution containing user documentation, the current CRL implementation, and CRL versions of several applications are available on the World Wide Web [33] In addition to the platforms employed in this thesis (CM 5 and Alewife) the CRL 1. 0 distribution can be compiled for use with PVM [24] on a network of Sun workstations communicating with one another using TCP. The preceding sections described the general structure of a prototype CRL implementation that provides the features and programming model described in Chapter 3. The prototype implementation is relatively simple, ....
A. Geist, A. Beguelin, J. J. Dongarra, W. Jiang, R. Manchek, and V. S. Sunderam. PVM 3 User's Guide and Reference Manual. Technical Report ORNL/TM-12187, Oak Ridge National Laboratory, May 1993.
An evaluation of Java implementations of message-passing - Stankovic, Zhang (2000) (Correct)
....has proven more popular than the shared memory. The main advantages are generally better performance, flexibility, and integrability into the existing programming tools and practices. Message passing libraries like the Message Passing Interface (MPI) 1] and the Parallel Virtual Machine (PVM) [2] provide a common programming interface and a portable program source code across many computer architectures that make up a network or cluster. The library interface is standardized, but multiple architecture, topology specific and performance tuned implementations of the same library are ....
Geist AG, Beguelin A, Dongarra JJ, Jiang W, Manchek R, Sunderam VS. PVM 3 User's Guide and Reference Manual. Technical Report ORNL/TM-12187, Oak Ridge National Laboratory, 1993.
Specification of the PROMOTER Compilation System Version 1.0 - Enskonatus, Kessler, Nolte (Correct)
....until the corresponding send operation has ensured that the referenced object is safely on its way to the receiver. Note that this relies on a safe network protocol which avoids the need to store a copy of the sent object for resending in case of an error) A similar mechanism is provided in PVM [6] by the pvm mkbuf routine in conjunction with the PvmDataInPlace flag . It is the compiler s responsibility to replace only those send calls by a nonbuffering call, where the clone operation and the next write operation are significantly far from each other. There is a threshold between the time ....
....of these events can be used to sample data for a user defined monitoring. The definition and triggering of events will be generated by the compiler. Some might ask why we don t use some standardized communication library like MPI [5] The answer is simple: MPI, and its predecessors like PVM [6] or P4 [7] are tailored towards application programmers and their needs. They cover a wide variety of different synchronization schemes and communication patterns. This allows for a convenient programmer s interface at the cost of performance. 3.8. WHY NOT MPI 31 Because of PROMOTER s fine ....
Geist, A.; Beguelin, A.; Dongarra, J.; Jiang, W,; Manchek, R.; Sunderam, V.: PVM 3 User's Guide And Reference Manual. ORNL/TM--12187, Oak Ridge National Laboratory, Oak Ridge Tennessee 37831, May 1994.
Distributed Computation of Electromagnetic Scattering.. - Using.. (Correct)
No context found.
A. Beguelin, et. al., PVM 3 User's Guide and Reference Manual, Oak Ridge National Laboratory, ORNL/TM-12187, May 1993.
Distributed Image Edge Detection Methods and Performance - Xiaodong Zhang Hong (Correct)
No context found.
A. Geist, et. al., PVM3 User's Guide and Reference Manual, Oak Ridge National Laboratory, ORNL/TM-12187, May, 1993.
Distrib. Syst. Engng 3 (1996) 20--31. Printed in the UK - Performance Analysis Of (Correct)
No context found.
Geist A, Beguelin A, Dongarra J, Jiang W, Manchek R and Sunderan V 1993 PVM 3 User's Guide and Reference Manual (Oak Ridge, TN: Oak Ridge National Laboratory)
Anais do IX SIBGRAPI (1996) 281-288 An Architecture for.. - Mnica Costa Bruno (1998) (Correct)
No context found.
A. Geist et al., PVM 3 Users's Guide and Reference Manual, ORNL/TM-12187 (1994).
Dynamic Process Composition And Communication Patterns In.. - Everaars, Koren (2000) (Correct)
No context found.
Geist A, Beguelin A, Dongarra J, Jiang W, Manchek R, Sunderam V. PVM 3 user's guide and reference manual. Technical Report ORNL/TM-12187, Oak Ridge National Laboratory, September 1994.
Reconstruction of Coronary Arteries from One.. - Blondel.. (2004) (Correct)
No context found.
A. Geist, A. Beguelin, J.J. Dongarra, W. Jiang, R. Manchek, and V.S. Sunderam. PVM 3 user's guide and reference manual. Technical Report ORNL/TM-12187, Oak Ridge National Laboratory, 1993.
Developing a Thin and High Performance Implementation of.. - Vorakosit, Uthayopas (2002) (Correct)
No context found.
Geist, G. A., Beguelin, A., Dongarra, J. J., Jiang, W., Manchek, R. & Sunderam, V. S. 1993. PVM 3 user's guide and reference manual. Technical Report ORNL/TM-12187, Oak Ridge National Laboratory.
Precise and Efficient Static Array Bound Checking for Large.. - Venet, Brat (2004) (Correct)
No context found.
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. Pvm 3 User's Guide And Reference Manual. MIT Press, 1994.
Sampling Diffuse Inter-Reflection Within A Hybrid.. - Erik Reinhard Alan (Correct)
No context found.
A. GEIST, A. BEGUELIN, J. DONGARRA, W. JIANG, R. MANCHEK, AND V. SUNDERAM, PVM 3 User's Guide and Reference Manual, Oak Ridge National Laboratory, Oak Ridge, Tennessee, May 1993.
Scheduling Parallel Processes Using Genetic Algorithms - Meijer (2004) (Correct)
No context found.
Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy Sunderam. PVM 3 user's guide and reference manual, September 1994. http://www.netlib.org/pvm3/ug.ps.
Metacomputing Support by P-Grade - Kacsuk, Dózsa, Kovács, .. (Correct)
No context found.
Geist, A., et al.: PVM 3 User's guide and Reference Manual, ORNL/TM-12187, 1994
A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary.. - Yan, al. (1996) (Correct)
No context found.
Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., and Sunderam, V. PVM 3 user's guide and reference manual. Technical Report, Oak Ridge National Laboratory, 1993.
ParaStation User Level Communication - Blum, Warschko, Tichy (Correct)
No context found.
A. Beguelin, J. Dongarra, Al Geist, W. Jiang, R. Manchek, and V. Sunderam. PVM 3 User's Guide and Reference Manual. ORNL/TM-12187, Oak Ridge National Laboratory, May 1993.
Parallel Programming with the Pool Model - Maclean, Glaser, DeRoure (1998) (Correct)
No context found.
Al Geist et al. PVM 3 User's Guide and Reference Manual, sep 1994.
Programming Languages For High Performance Computers - Sips Delft University (Correct)
No context found.
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, V. Sunderam, PVM 3 user's guide and reference manual, report ORNL/TM-12187, May 1993.
Symbiotic Coevolution of Artificial Neural Networks and Training.. - Mayer (1998) (Correct)
No context found.
Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy Sunderam. PVM 3 User's Guide and Reference Manual. Oak Ridge National Laboratory, 1994.
First 50 documents Next 50
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