Advertisement

Massive parallelism with workstation clusters — challenge or nonsense?

  • Clemens H. Cap
Networking
Part of the Lecture Notes in Computer Science book series (LNCS, volume 797)

Abstract

Workstation cluster computing recently has become an important and successful technique. The communication bottleneck limits this approach to small and medium sized configurations of up to 30 workstations for most applications. This paper demonstrates that for certain algorithms massively parallel cluster computing using thousands of workstations in the Internet is feasible. It describes structures for the coordination of a large number of geographically dispersed processes. The paper introduces Lola, a library supporting massively parallel computing in wide area networks, and provides an application example.

Keywords

Wide Area Network Parent Process Master Process Shell Script Massive Parallelism 
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.
    R. D. Bjornson, Linda on Distributed Memory Multiprocessors. PhD Thesis and technical report YALEU/DCS/RR-931, University of Yale, november 1992.Google Scholar
  2. 2.
    R. Butler, E. Lusk, User's Guide to the p4 Parallel Programming System. Technical report, Argonne National Laboratory, august 1992.Google Scholar
  3. 3.
    C. H. Cap, Massively Parallel Computing in Wide Area Networks. Technical report, department of computer science, University of Zurich, 1993.Google Scholar
  4. 4.
    C. H. Cap, Architekturelle Entscheidungen zur Unterstützung parallelen Rechnens in Workstation Clustern und deren Realisierung in existenten Produkten. Proceedings 2. ITG/GI Workshop Workstations, Hagen 1993, VDE Verlag.Google Scholar
  5. 5.
    C. H. Cap and V. Strumpen, Efficient Parallel Computing in Distributed Workstation Environments. Parallel Computing, 19(11), 1993.Google Scholar
  6. 6.
    C. H. Cap and V. Strumpen, The Parform — A High Performance Parallel Platform for Efficient Computation in a Distributed Workstation Environment. Technical report IFI-TR 92.07 Technical report, department of computer science, University of Zurich, 1992.Google Scholar
  7. 7.
    C. H. Cap and V. Strumpen, Massively Parallel Computing in the Internet — Entry to the SuParCup'93. Department of computer science, University of Zurich, 1993. This entry won the first prize of the SuParCup93.Google Scholar
  8. 8.
    G. Geist and V. Sunderam. The PVM system: Supercomputer Level Concurrent Computation on a Heterogeneous Network of Workstations. Proceedings of the Sixth Distributed Memory Computing Conference, IEEE Press, 1991,258–261.Google Scholar
  9. 9.
    M. Griebel, W. Huber, T. Störtkuhl and C. Zenger, On the Parallel Solution of 3D PDEs on a Network of Workstations and on Vector Computers.Google Scholar
  10. 10.
    HPCwire, Comparing the Efficiency of molecular biology sequence-analysis computations. Electronic Newsletter HPCwire, topic 815, March 1, 1993. Further source: SDSC's Computational Science Advances.Google Scholar
  11. 11.
    R. J. Lipton, T. G. Marr and J. D. Welsh, Computational Approaches to Discovering Semantics in Molecular Biology. Proc. IEEE 77(7) 1989, pp. 1056–1060.Google Scholar
  12. 12.
    H. P. Lüthi, J. Almlöf, Network Supercomputing: A distributed-concurrent direct SCF scheme. Theoretica Chimica Acta 84, 1993, pp. 443–455.Google Scholar
  13. 13.
    C. D. Marsan, NSF pursues computing without walls. Federal Computer Week 6(35), 53, november 30, 1992.Google Scholar
  14. 14.
    H. Nakanishi, V. Rego and V. Sunderam, Superconcurrent Simulation of Polymer Chains on Heterogeneous Networks. Proceedings Supercomputer 92, Minneapolis, IEEE Press, 1992, 561–569.Google Scholar
  15. 15.
    W. Scott, P. Arbenz, S. Vogel and H. P. Lüthi, Network Supercomputing. EPFL Supercomputing Review, november 1991.Google Scholar
  16. 16.
    T. F. Smith, M. S. Waterman, Identification of Common Molecular Subsequences. Journal of Molecular Biology 147, 1981, pp. 195–197PubMedGoogle Scholar
  17. 17.
    C. Sprenger, Netzwerk-Computing. Diploma thesis, Institut für wissenschaftliches Rechnen, ETH Zurich, march 1992.Google Scholar
  18. 18.
    V. Strumpen, Parallel Molecular Sequence Analysis on Workstations in the Internet. Technical report, department of computer science, University of Zurich, 1993.Google Scholar
  19. 19.
    L. H. Turcotte, A Survey of Software Environments for Exploiting Networked Computing Resources. Technical report of the engineering research center for computational field simulation, june 1993.Google Scholar
  20. 20.
    R. A. Wagner and M. J. Fischer, The String to String Correction Problem. JACM 21(2) 1974, pp. 168–173.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Clemens H. Cap
    • 1
  1. 1.Department of Computer ScienceUniversity of ZurichZurichSwitzerland

Personalised recommendations