Efficiency of universal parallel computers

Extended abstract
  • Friedhelm Meyer auf der Heide
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 145)


We consider parallel computers (PC's) with fixed communication network with bounded degree. We construct a universal PC with n1+0(1/log log (n)) processors which can simulate each PC with n prodessors with a time loss of 0(log log(n)). This improves a result of [1] where a time loss of 0(log (n)) was achieved but only using 0(n) processors. Furthermore we prove a time-processor trade-off for a very general type of universal PC's, which includes thatone above. This generalizes a result for a simpler type of simulations presented in [2], where also all results of this paper are included.


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. Proc. of the 13th Annual ACM Symp. on Theory of Computing, Milkwaukee, May 1981, pp. 247–262.Google Scholar
  2. [2]
    F.Meyer auf der Heide: Efficiency of Universal Parallel Computers. Interner Bericht des Fachbereichs Informatik der J.W. Goethe-Universität Frankfurt, 2.82.Google Scholar
  3. [3]
    W.J. Paul: Komplexitätstheorie. Teubner Verlag, Stuttgart, 1978.Google Scholar
  4. [4]
    A. Waksman: A Permutation Network. Journal of the ACM, 15(1) (1968) pp. 159–163.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Friedhelm Meyer auf der Heide
    • 1
  1. 1.Fachbereich InformatikJohann Wolfgang Goethe-Universität FrankfurtFrankfurt a.M.Fed. Rep. of Germany

Personalised recommendations