Skip to main content
SpringerLink
Log in

Parallel Computing: Complexity Classes

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Unrestricted Parallelism

Restricted Amount of Hardware, Circuits

Restricted Amount of Hardware, PRAMs

BSP and LogP

See also

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Borodin A (1977) On relating time and space to size and depth. SIAM J Comput 6(4):733–744

    Article  MathSciNet  MATH  Google Scholar 

  2. Chandra AK, Kozen DC, Stockmeyer LJ (1981) Alternation. J ACM 28(1):114–133

    Article  MathSciNet  MATH  Google Scholar 

  3. Cook SA (1981) Towards a complexity theory of synchronous parallel computation. L'Enseign Math 27:99–124

    MATH  Google Scholar 

  4. Cook SA, Reckhow RA (1973) Time-bounded random access machines. J Comput Syst Sci 7:354–375

    Article  MathSciNet  MATH  Google Scholar 

  5. Culler DE, Karp RM, Patterson D, Sahay A, Santos EE, Schauser KE, Subramonian R, von Eicken T (1996) LogP, a practical model of parallel computation. Comm ACM 39(11):78–85

    Article  Google Scholar 

  6. Fortune S, Wyllie J (1978) Parallelism in random access machines. In: Conf. Record Tenth Annual ACM Symp. Theory of Computing, pp 114–118

    Google Scholar 

  7. Galil Z, Paul WJ (1983) An efficient general-purpose parallel computer. J ACM 30(2):360–387

    Article  MathSciNet  MATH  Google Scholar 

  8. Goldschlager LM (1982) A universal interconnection pattern for parallel computers. J ACM 29(4):1073–1086

    Article  MathSciNet  MATH  Google Scholar 

  9. Karp RM, Ramachandran V (1990) Parallel algorithms for shared-memory machines. Handbook Theoret. Computer Sci. A: Algorithms and Complexity. In: van Leeuwen J (eds) MIT, Elsevier, pp 869–941

    Google Scholar 

  10. Keller J, Paul WJ, Scheerer D (1994) Realization of PRAMs: Processor design. 8th Internat. Workshop on Distributed Algorithms, WDAG. In: Lecture Notes Computer Sci, vol 857. Springer, Berlin, pp 17–27

    Chapter  Google Scholar 

  11. Leighton FT (1992) Introduction to parallel algorithms and architectures: Arrays – Trees – Hypercubes. Morgan Kaufmann, San Mateo

    MATH  Google Scholar 

  12. Ramachandran V, Grayson B, Dahlin M (1999) Emulations between QSM, BSP, and LogP: A framework for general-purpose parallel algorithm design. In: 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp S957–958

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Valiant LG (1982) A scheme for fast parallel communication. SIAM J Comput 11(2):350–361

    Article  MathSciNet  MATH  Google Scholar 

  15. Valiant LG (1990) A bridging model for parallel computation. Comm ACM 33(8):103–111

    Article  Google Scholar 

  16. Valiant LG (1990) General purpose parallel architectures. In: van Leeuwen J (ed) Algorithms and Complexity. Handbook Theoret. Computer Sci., vol A. MIT, Elsevier, pp 943–971

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pennsylvania State University, University Park, USA

    Martin Fürer

Authors
  1. Martin Fürer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Fürer, M. (2008). Parallel Computing: Complexity Classes . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_498

Download citation

Publish with us

Policies and ethics

Search

Navigation