Supercomputing pp 295-305 | Cite as

Super Parallel Algorithms

  • D. Parkinson
Conference paper
Part of the NATO ASI Series book series (volume 62)

Abstract

Serial algorithmic design concentrates on how to solve a single instance of a given task on a single processor. The natural extension for parallel processing usually concentrates on how to solve the given single problem on a set of processors. When algorithms for massively parallel systems are designed it often occurs that the algorithm for parallel solution of a given problem turns out to be more general and automatically solves multiple instances of the task simultaneously. These algorithms we call Super Parallel algorithms. This paper discusses some examples of Super Parallel Algorithms.

Keywords

Sorting Paral 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1]
    Gentleman, W. M., ‘Some complexity results for matrix computations on parallel processors’ JACM 25 112–115(1978)CrossRefMATHMathSciNetGoogle Scholar
  2. 2]
    Hockney, R. W. and Jesshope, C. R., Parallel Computers 2 Adam Hilger (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • D. Parkinson
    • 1
  1. 1.Active Memory Technology Limited and Queen Mary College LondonUK

Personalised recommendations