Advertisement

PVM, computational geometry, and parallel computing course

  • Michal Šoch
  • Jan Trdlička
  • Pavel Tvrdík
Session F1: Evaluation of PVM
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1156)

Abstract

In the last two years, PVM has been used in our SUN workstation lab as a programming tool to teach our upper-level undergraduate students parallel programming of distributed-memory machines. More than 160 students have implemented in PVM non-trivial parallel algorithms for solving problems in computational geometry as their term projects. This paper summarizes our experience with using PVM in the parallel computing course and evaluates the results of student PVM projects.

Keywords

PVM computational geometry divide&conquer algorithms SUN workstations SP-2 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. G. Akl and K. Lyons. Parallel computational geometry. Prentice-Hall, 1993.Google Scholar
  2. 2.
    Special issue on SP-2 architecture. IBM Systems Journal, 34(2):144–322, 1995.Google Scholar
  3. 3.
    P. Tvrdík. Theoretical background of parallel computing for undergraduates. In Proc. of Conf. on Par. Comp. for Undergraduates, Hamilton, N.Y., USA, 1994. Colgate Un.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  1. 1.Department of Computer Science and Eng.Czech Technical UniversityPragueCzech Republic

Personalised recommendations