• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Parallel Algorithms (1996)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.math.tau.ac.il]
  • [www.math.tau.ac.il]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.uni-paderborn.de]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Guy E. Blelloch , Bruce M. Maggs
Citations:164 - 7 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Blelloch96parallelalgorithms,
    author = {Guy E. Blelloch and Bruce M. Maggs},
    title = {Parallel Algorithms},
    year = {1996}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

t. Hence, an algorithm that takes time t on a P-processor machine performs work W = P t. In either case, the work roughly captures the actual cost to perform the computation, assuming that the cost of a parallel machine is proportional to the number of processors in the machine. We call an algorithm work-efficient (or just efficient) if it performs the same amount of work, to within a constant factor, as the fastest known sequential algorithm. For example, a parallel algorithm that sorts n keys in O( p n log n) time using p n processors is efficient since the work, O(n log n), is as good as any (comparison-based) sequential algorithm. However, a sorting algorithm that runs in O(log n) time using n 2 processors is

Citations

3633 Computer Architecture: A Quantitative Approach - Hennessy, Patterson - 1990
2172 The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
1611 Computational geometry: An introduction - Preparata, Shamos - 1985
1497 The Definition of Standard ML - Milner, Tofte, et al. - 1997
1311 Distributed Algorithms - Lynch - 1996
1206 Introduction to Parallel Algorithms and Architectures: Arrays - Leighton - 1992
1016 A Bridging Model for Parallel Computation - Valiant - 1990
595 An introduction to parallel algorithms - Jájá - 1992
477 Tsitsiklis. Parallel and Distributed Computation: Numerical Methods - Bertsekas, N - 1989
471 LogP: towards a realistic model of parallel computation - Culler, Karp, et al. - 1993
445 Introduction to Parallel Computing: Design and Analysis of Algorithms - Grama, Karypis, et al. - 2003
409 The SGI Origin: A ccNUMA Highly Scalable Server - Laudon, Lenoski - 1997
334 A simple parallel algorithm for the maximal independent set problem - Luby - 1986
303 Gaussian elimination is not optimal - STRASSEN - 1969
281 Parallel merge sort - Cole
268 Parallel algorithms for sharedmemory machines - Karp, Ramachandran - 1990
260 Parallelism in random access machines - Fortune, Wyllie - 1978
244 Sorting and Searching, volume 3 of The Art of Computer Programming - Knuth - 1973
234 Vector models for data-parallel computing - Blelloch - 1990
227 The parallel evaluation of general arithmetic expressions - Brent - 1974
213 Data parallel algorithms - Hillis, Steele - 1986
211 Istructures: Data structures for parallel computing - Arvind, Nikhil, et al. - 1989
201 General purpose parallel architectures - Valiant - 1990
190 How to emulate shared memory - RANADE - 1985
186 Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing - Leiserson - 1985
173 Efficient Parallel Algorithms - Gibbons, Rytter - 1988
166 A Comparison of Sorting Algorithms for the Connection - Blelloch, Leiserson, et al. - 1991
165 The Design and Analysis of Parallel Algorithms - Akl - 1989
155 Implementation of a portable nested data-parallel language - Blelloch, Chatterjee, et al. - 1994
141 Leeuwen. Maintenance of configurations in the plane - Overmars, van - 1981
139 A parallel algorithm for the efficient solution of a general class of recurrence equations - Kogge, Stone - 1973
139 Synthesis of Parallel Algorithms - Reif - 1993
137 Programming with Sets |An Introduction to SETL - Schwartz, Dewar, et al. - 1986
122 Mathematical Theory of Connecting Networks and Telephone Traffic - Benes - 1965
114 A logarithmic time sort for linear size networks - Reif, Valiant - 1987
108 An o(log n) parallel connectivity algorithm - Shiloach, Vishkin - 1982
107 Computational Aspects of VLSI - Ullman - 1984
105 Designing broadcasting algorithms in the Postal Model for message passing systems - Bar-Noy, Kipnis - 1992
104 Multidimensional divide-and-conquer - Bentley - 1980
98 A randomized lineartime algorithm to find minimum spanning trees - Karger, Klein, et al. - 1995
98 Parallel algorithms for shared memory machines - Karp, Ramachandran
92 A report on the Sisal language project - Feo, Cann, et al. - 1990
91 An efficient parallel biconnectivity algorithm - Tarjan, Vishkin - 1985
87 The ultimate planar convex hull algorithm - Kirkpatrick, Seidel - 1986
87 NESL: A nested data-parallel language (version 3.1 - Blelloch - 1995
86 Parallel Computation: Models and Methods - Akl - 1997
79 Logp: A practical model of parallel computation - Culler, Karp, et al. - 1996
78 Parallel Sorting Algorithms - Akl - 1985
74 Fast Parallel Matrix Inversion Algorithms - Csanky - 1976
74 Interconnection Networks for Large-scale Parallel Processing: Theory and Case Studies, McGraw-Hill - Siegel - 1990
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University