Advertisement

Facilitating Parallel Programming in PVM Using Condensed Graphs

  • John P. Morrison
  • Ronan W. Connolly
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1697)

Abstract

This paper describes the implementation of the Condensed Graph (CG) Computing Model using the PVM system. This model enables the programmer to write solutions to problems to run on a PVM System without the programmer having to create a parallel solution or embed PVM library routines into their program. This paper describes the basic concepts behind the CG Model. It then describes how the CG Model is implemented using the PVM System.

Keywords

Parallel Programming Operator Port Destination Port Parallel Virtual Machine Data Dependency Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arvind and Kim P. Gostelow A Computer Capable of Exchanging Processors for Time Information Processing 77 Proceedings of IFIP Congress 77 Pages 849–853, Toronto, Canada, August 1977.Google Scholar
  2. 2.
    Arvind, David E. Culler and Kattamuri Ekanadham. The Price of Asynchronous Parallelism: An Analysis of Dataflow Architectures. Conpar’ 88, Pages168–182,Manchester, England 1998.Google Scholar
  3. 3.
    D. Ambramson and G. Egan. The RIMT Data Flow Computer: A Hybrid Architecture. The Computer Journal,33(3):230–240,June 1990CrossRefGoogle Scholar
  4. 4.
    Cristiana Amza, Alan L. Cox, Sandhya Dwarkadas, Pete Keleher, Honghui Lu, Ramakrishnan Rajamony, Weimin Yu and Willy Zwaenepoel. TreadMarks: Shared Memory Computing on Networks of Workstations IEEE Computer Vol 29, No. 2, pages 18–28, Feb 1996.Google Scholar
  5. 5.
    J. Backus. Can Programming be Liberated from the Von Nuemann Style? A Functional Style and its Algebra of Programs. Communications of the ACM, 21(6)613–641, August 1978.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    A. Beguelin, J. Dongarra, A. Geist, R. Manchek, K. Moore and V. Sunderam. PVM and HeNCE: Tools for Heterogeneous Network Computing. Software for parallel computation: Proceedings of the NATO Advanced Workshop on Software for Parallel Computation, held at Cetraro, Cosenza, Italy, June 22–26, 1992.Google Scholar
  7. 7.
    Robert D. Blumofe and Christopher F. Joerg and Bradley C. Kuszmaul and Charles E. Leiserson and Keith H. Randall and Yuli Zhou. Cilk: An Efficient Multithreaded Runtime System. Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP’95. Santa Barbara, California, July 1995Google Scholar
  8. 8.
    Al Geist, Adam Beguelin, Jack Dongarra, Weich Jiang, Robert Manchek, and Vaidy Sunderam. PVM: Parallel Virtual Machine: A User’s Guide and Tutorial for Networked Parallel Computing. Scientific and engineering computation. MIT Press, Cambridge, MA, USA, 1994.Google Scholar
  9. 9.
    J.R. Gurd, C.C. Kirkham, and Ian Watson. The Manchester Prototype Data Flow Computer. Communications of The ACM, 28(1):34–52, January 1985.CrossRefGoogle Scholar
  10. 10.
    Frank Harary, Robert Norman and Dorwin Cartwright Structural Models: An Introduction to the Theory of Directed Graphs John Wiley and Sons, 1969Google Scholar
  11. 11.
    Keneth R. Traub, Gregory M. Papadopoulos, Michael J. Beckerle, James E. Hicks, Jonathan Young. Overview of the Monsoon Project. Computation Structures Group Memo 339, January 1991Google Scholar
  12. 12.
    John Morrison, Martin Rem. Managing and Exploiting Speculative Computations in a Flow Driven, Graph Reduction Machine. PDPTA’ 99. Las Vegas, USAGoogle Scholar
  13. 13.
    John Morrison, David Power, James Kennedy. A Condensed Graphs Engine to Drive Metacomputing. PDPTA’ 99. Las Vegas, USAGoogle Scholar
  14. 14.
    John P. Morrison: Condensed Graphs: Unifying Availability-Driven, Coercion-Driven and Control-Driven Computing. ISBN: 90-386-0478-5. Technische Universiteit Eindhoven, October 1996. (PhD Thesis)Google Scholar
  15. 15.
    Peter Newton and Jack Dongarra. Overview of VPE: A Visual Environment for Message-Passing, Parallel Programming. Technical Report University of Tennessee CS-94-261 November 1994.Google Scholar
  16. 16.
    Rishiyur Nikhil, Gregory M. Papadopoulos, Arvind. T: A Multithreaded Massively Parallel Architecture. Computation Structures Group Memo 325-2, March 5, 1992.Google Scholar
  17. 17.
    Rinus Plasmeijer and Marko van Eekelen Functional Programming and Parallel Graph Reduction ISBN: 0-201-41663-8 Addison-Wesley Publishers Ltd.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • John P. Morrison
    • 1
  • Ronan W. Connolly
    • 1
  1. 1.University College CorkIreland

Personalised recommendations