Skip to main content
SpringerLink
Log in

Parallel machines and their communication theoretical limits

  • Invited Lectures
  • Conference paper
  • First Online:
Book cover STACS 86 (STACS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 210))

Included in the following conference series:

Abstract

We have tried to structure a variety of papers on communication in parallel systems. How much information exchange is necessary for fast computations and how can this be realized on different models of parallel machines? This overview cannot be complete, nor did we try to present any technical details. The interested reader is encouraged to look into the cited literature.

Although we dealt with fast parallel computations the preparation of these notes had to be done in a very short time using an ordinary sequential algorithm. We ask to excuse any deficiencies caused by this fact.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ben Or, Lower bounds for algebraic computation trees, Proc. of the 15th ACM An. Symp. on Theory of Computing, 1983, 80–86.

    Google Scholar 

  2. P. Beame, Lower bounds for very powerfull parallel machines, Technical report, 1985.

    Google Scholar 

  3. A. Borodin, J. Hopcroft, Routing, merging and sorting on parallel models of computation, J. Comp. and Syst. Sc. 30, 1985, 130–145.

    Google Scholar 

  4. S. Cook, C. Dwork, Bounds on the time for parallel RAMs to compute simple functions, Proc. of the 14th ACM An. Symp. on Theory of Computing, 1982, 231–233.

    Google Scholar 

  5. S. Cook, C. Dwork, R. RelschukUpper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 14, 1985.

    Google Scholar 

  6. A. Chandra, L. Stockmeyer, U. Vishin, Constant depth reducibility, SIAM J. Comput. 13, 1984, 423–439.

    Article  Google Scholar 

  7. F. Fich, F. Meyer auf der Helde, P. Ragde, A. Wigderson, One, two, three ... infinity lower bounds for parallel computation, Proc. of the 17th ACM An. Symp. on Theory of Computing, 1985, 48–58.

    Google Scholar 

  8. F. Fich, P. Ragde, A. Wigderson, Relations between concurrent-write models of parallel computation, Technical report, 1985.

    Google Scholar 

  9. S. Fortune, J. Wyllie, Parallelism in random access machines, Proc. of the 10th ACM An. Symp. on Theory of Computing, 1978, 114–118.

    Google Scholar 

  10. L. Goldschlager, A universal interconnection pattern for parallel computers, J. ACM 29, 1982, 1073–1086.

    Google Scholar 

  11. A. Gottlieb, C. Kruskal, Complexity results for permuting data and other computations on parallel processors, J. ACM 31, 1984, 193–209.

    Article  Google Scholar 

  12. Z. Galil, W. Paul, An efficient general-purpose parallel computer, J. ACM 30, 1983, 360–387.

    Google Scholar 

  13. J. Hastad, Improved lower bounds for small depth circuits, Technical report, 1985.

    Google Scholar 

  14. B. Halstenberg, Kommunikationskomplexität, Diplom Arbeit, Universität Bielefeld, 1986

    Google Scholar 

  15. R. Häggkvist, P. Hell, Parallel sorting with constant time for comparisons, SIAM J. Comput. 10, 1981, 465–472.

    Google Scholar 

  16. J. Jaja, P. Kumar, Information transfer in distributed computing with application to VLSI, J. ACM 31, 1984, 150–162.

    Google Scholar 

  17. L. Kucera, Parallel computation and conflicts in memory access, Inf. Proc. Let. 14, 1982, 93–96.

    Google Scholar 

  18. G. Lev, N. Pippenger, L. Vallant, A fast parallel algorithm for routing in permutation networks, IEEE Trans. on Computers 30, 1981, 93–100.

    Google Scholar 

  19. G. Landau, M. Yung, Z. Galil, Distributed algorithms in synchronous broadcasting networks, Proc. of the 12. ICALP, 1985, 363–372.

    Google Scholar 

  20. F. Meyer auf der Helde, R. Reischuk, On the limits to speed up parallel machines by large hardware and unbounded communication, Proc. of the 25th IEEE An. Symp. on Foundations of Computer Science, 1984, 56–64.

    Google Scholar 

  21. K. Mehlhorn, E. Schmidt, Las Vegas is better than determinism for VLSI circuits, Proc. of the 14th ACM An. Symp. on Theory of Computing, 1982, 330–337.

    Google Scholar 

  22. K. Mehlhorn, U. Vishkin, Randomized and deterministic simulation of PRAMS by parallel machines with restricted granularity of parallel memories, Acta Informatica 21, 1984, 339–374.

    Article  Google Scholar 

  23. F. Meyer auf der Heide, A. Wigderson, The complexity of parallel sorting, Proc. of the 26th IEEE An. Symp. on Foundations of Computer Science, 1985, 532–540.

    Google Scholar 

  24. J. Parberry, A complexity theory of parallel computation, Dissertation, University of Warwick, 1984.

    Google Scholar 

  25. F. Preparata, J. Vuillemin, The cube-connected cycles: a versatile network for parallel computation, Com. of the ACM 24, 1981, 300–309.

    Google Scholar 

  26. R. ReischukA lower time-bound for parallel random access machines without simultaneous writes, IBM Research Report RJ3431, 1982.

    Google Scholar 

  27. R. Reischuk, Simultaneous writes of parallel random access machines do not help to compute simple arithmetic functions, Technical report, Universität Bielefeld, 1985, to appear in J. ACM.

    Google Scholar 

  28. R. Relschuk, An information theoretic lower bound for WRAMS, Technical report, Universität Bielefeld, 1985.

    Google Scholar 

  29. J. Schwarts, Ultracomputers, ACM Tr. on Progr. Lang. and Systems, 2, 1980, 484–521.

    Google Scholar 

  30. H.U. Simon, A tight Θ(log log n) — bound on the time for parallel RAM's to compute nondegenerated boolean functions, Information and Control 55, 1982, 102–107.

    Google Scholar 

  31. A. Schorr, Physical parallel devices are not much faster than sequential ones, Inf. Proc. let. 17, 1983, 103–106.

    Google Scholar 

  32. M. Snir, On parallel searching, SIAM J. on Computing 14, 1985, 688–708.

    Google Scholar 

  33. Y. Shiloach, U. Vishkin, Finding the maximum, merging and sorting in a parallel computation model, J. of Algorithms 2, 1981, 88–102.

    Google Scholar 

  34. L. Stockmeyer, U. Vishkin, Simulation of parallel random access machines by circuits, SIAM J. Comput. 13, 1984, 409–422.

    Google Scholar 

  35. P. Tiwari, Lower bounds on communication complexity in distributed computer networks, Proc. of the 16th ACM An. Symp. on Theory of Computing, 1984, 109–117.

    Google Scholar 

  36. E. Upfal, Efficient schemes for parallel communication, J. ACM 31, 1984, 507–517.

    Google Scholar 

  37. E. Upfal, A probabilistic relation between desirable and feasible models of parallel computation, Proc. of the 16th ACM An. Symp. on Theory of Computing, 1984, 258–265.

    Google Scholar 

  38. E. Upfal, A. Wigderson, How to share memory in a distributed system, Proc. of the 25th IEEE An. Symp. on Theory of Computing, 1984, 171–180.

    Google Scholar 

  39. L. Valiant, Parallelism in comparsion problems, SIAM J. on Computing 4, 1975, 348–355.

    Article  Google Scholar 

  40. U. Vishkin, A parallel-design distributed-implementation (PDDI) general-purpose computer, Theoretical Computer Science 32, 1984, 157–172.

    Article  Google Scholar 

  41. U. Vishkin, A. Wigderson, Trade-offs between depth and width in parallel computation, Proc. of the 24th IEEE An. Symp. on Foundations of Computer Science, 1983, 146–153 and SIAM J. on Computing 14, 1985, 303–314.

    Google Scholar 

  42. A. Yao, Some complexity questions related to distributive computing, Proc. of the 11th ACM An. Symp. on Theory of Computing, 1979, 209–213.

    Google Scholar 

  43. A. Yao, On parallel computation for the knapsack Problem, J. ACM 29, 1982, 898–903.

    Google Scholar 

  44. A. Yao, Separating the polynomial-time hierarchy by oracles, Proc. of the 26th An. IEEE Symp. on Foundations of Computer Science, 1985, 1–10.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik, Technische Hochschule Darmstadt, 6100, Darmstadt, West-Germany

    K. Rüdiger Reischuk

Authors
  1. K. Rüdiger Reischuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien G. Vidal-Naquet

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rüdiger Reischuk, K. (1985). Parallel machines and their communication theoretical limits. In: Monien, B., Vidal-Naquet, G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-16078-7_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16078-6

  • Online ISBN: 978-3-540-39758-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation