Advertisement

Data-independences of parallel random access machines

Extended abstract
  • Klaus-Jörn Lange
  • Rolf Niedermeier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 761)

Abstract

We introduce notions of control and communication structures for PRAM's and relate them to the concept of data-independence. Our main result is to characterize differences between unbounded fanin parallelism (i.e., the complexity classes AC k , k≥1), bounded fanin parallelism (i.e., the classes NC k , k≥1), and sequentialism (i.e., DSPACE(log n) and LOGDCFL.) We express these differences in terms of data-(in)dependences of reads from and writes into the global memory of a PRAM. In particular, we obtain the first characterizations of NC k (k≥1) and DSPACE(log n) in terms of PRAM's. Finally, we introduce a PRAM model with in some sense built-in data-independence and propose it as a tool for the development of data-independent parallel algorithms.

Keywords

Shared Memory Global Memory Input Word Local Assignment Edge List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F. Abolhassan, J. Keller, and W. J. Paul. On physical realizations of the theoretical PRAM model. Technical report, Univ. Saarbrücken, 1991.Google Scholar
  2. 2.
    S. A. Cook. A taxonomy of problems with fast parallel algorithms. Inform. and Control, 64:2–22, 1985.Google Scholar
  3. 3.
    S. A. Cook and P. W. Dymond. Parallel pointer machines. October 1991.Google Scholar
  4. 4.
    P. W. Dymond and S. A. Cook. Hardware complexity and parallel computation. In Proc. of 21st FOCS, pages 360–72, 1980.Google Scholar
  5. 5.
    P. W. Dymond and W. L. Ruzzo. Parallel RAMs with owned global memory and deterministic language recognition. In Proc. of 13th ICALP, number 226 in LNCS, pages 95–04. Springer, 1986.Google Scholar
  6. 6.
    D. Gomm, M. Heckner, K.-J. Lange, and G. Riedle. On the design of parallel programs for machines with distributed memory. In A. Bode, editor, Proc. of 2d EDMCC number 487 in LNCS, pages 381–391, Munich, Federal Republic of Germany, April 1991. Springer.Google Scholar
  7. 7.
    R. M. Karp and V. Ramachandran. A survey of parallel algorithms for sharedmemory machines. In van Leeuwen [18], chapter 17, pages 869–932.Google Scholar
  8. 8.
    T. W. Lam and W. L. Ruzzo. The power of parallel pointer manipulation. In Proc. of 1st SPAA, pages 92–02, 1989.Google Scholar
  9. 9.
    K.-J. Lange. Unambiguity of circuits. Theoretical Computer Science, 107:77–94, 1993.Google Scholar
  10. 10.
    T. G. Lewis and H. El-Rewini. Introduction to Parallel Computing. Prentice-Hall, 1992.Google Scholar
  11. 11.
    I. Niepel and P. Rossmanith. Uniform circuits and exclusive read PRAMs. In S. Biswas and K. V. Nori, editors, Proc. of 11th FST&TCS, number 560 in LNCS, pages 307–318, New Delhi, India, December 1991. Springer.Google Scholar
  12. 12.
    A. G. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42:307–326, 1991.Google Scholar
  13. 13.
    P. Rossmanith. The owner concept for PRAMs. In C. Choffrut and M. Jantzen, editors, Proc. of 8th STACS, number 480 in LNCS, pages 172–183, Hamburg, Federal Republic of Germany, February 1991. Springer.Google Scholar
  14. 14.
    W. L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365–383, 1981.Google Scholar
  15. 15.
    L. Stockmeyer and U. Vishkin. Simulation of parallel random access machines by circuits. SIAM Journal on Computing, 13(2):409–422, May 1984.Google Scholar
  16. 16.
    I. H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the ACM, 25:405–414, 1978.Google Scholar
  17. 17.
    L. G. Valiant. General purpose parallel architectures. In van Leeuwen [18], chapter 18, pages 943–971.Google Scholar
  18. 18.
    J. van Leeuwen, editor. Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science. Elsevier, 1990.Google Scholar
  19. 19.
    H. Venkateswaran. Properties that characterize LOGCFL. Journal of Computer and System Sciences, 43:380–404, 1991.Google Scholar
  20. 20.
    P. Vitányi. Locality, communication, and interconnect length in multicomputers. SIAM Journal on Computing, 17(4):659–672, August 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Klaus-Jörn Lange
    • 1
  • Rolf Niedermeier
    • 1
  1. 1.Fakultät für InformatikTechnische Universität MünchenMünchenFed. Rep. of Germany

Personalised recommendations