What have we learnt from using real parallel machines to solve real problems?

  • Authors:
  • G. C. Fox

  • Affiliations:
  • CaItech Concurrent Computation Program, Mail Code 158-79, California Institute of Technology, Pasadena, CA

  • Venue:
  • C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

We briefly review some key scientific and parallel processing issues in a selection of some 84 existing applications of parallel machines. We include the MIMD hypercube transputer array, BBN Butterfly, and the SIMD ICL DAP, Goodyear MPP and Connection Machine from Thinking Machines. We use a space-time analogy to classify problems and show how a division into synchronous, loosely synchronous and asynchronous problems is helpful. This classifies problems into those suitable for SIMD or MIMD machines and isolates the asynchronous class as that for which major uncertainties as to possible parallelism exist. Interestingly about half of the scientific applications run excellently on SIMD machines with the other half able to take especial advantage of the MIMD architecture.