Time-processor trade-offs for universal parallel computers

  • Friedhelm Meyer auf der Heide
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Various kinds of simulations among parallel computers are considered. We prove that it is not possible to simulate all parallel computers by one without an additional expense of time or of processors. Then we present a parallel computer which can simulate all parallel computers with n processors and which needs c·n2log(n) processors and extends the time only by a factor d·log log(n).


Time Loss Random Access Machine Permutation Network Simulation Processor Pairwise Disjoint Pathes 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Z. Galil, W.J. Paul: A Theory of Complexity of Parallel Computation. To appear in STOC 81 Google Scholar
  2. 2.
    W.J. Paul: Komplexitätstheorie. Teubner-Verlag, Stuttgart, 1978Google Scholar
  3. 3.
    A. Waksman: A Permutation Network. Journal of the ACM, 15(1) (1968), pp. 159–163Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Friedhelm Meyer auf der Heide
    • 1
  1. 1.Faculty of MathematicsUniversity of BielefeldBielefeld 1West-Germany

Personalised recommendations