Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
processor count
Description:
The number of processors available to or used by a parallel computer system or algorithm.
Primary topic:
Parallel Computing and Optimization Techniques (38%)
Related topics:
Parallel Computing and Optimization Techniques (38%),
Complexity and Algorithms in Graphs (20%)
OpenAlex ID:
keywords/processor-count
Parallel merge sort
1986
·
Richard Cole
·
Annual Symposium on Foundations of Computer Science
·
391
Fast Parallel Computation of Polynomials Using Few Processors
1983
·
L. G. Valiant
, S. Skyum
, et al.
·
SIAM Journal on Computing
·
324
A fast parallel algorithm for the maximal independent set problem
1985
·
Richard M. Karp
, Avi Wigderson
·
Journal of the ACM
·
323
PDF
An O(n2log n) parallel max-flow algorithm
1982
·
Yossi Shiloach
, Uzi Vishkin
·
Journal of Algorithms
·
264
Faster optimal parallel prefix sums and list ranking
1989
·
Richard Cole
, Uzi Vishkin
·
Information and Computation
·
221
Efficient Parallel Algorithms for String Editing and Related Problems
1990
·
Alberto Apostolico
, Mikhail J. Atallah
, et al.
·
SIAM Journal on Computing
·
180
PDF
Bounds on multiprocessing anomalies and related packing algorithms
1971
·
R. L. Graham
·
AFIPS Fall Joint Computer Conference (FJCC)
·
143
PDF
An improved parallel algorithm for maximal matching
1986
·
Amos Israeli
, Y. Shiloach
·
Information Processing Letters
·
135
Tight bounds on the complexity of parallel sorting
1984
·
Tom Leighton
·
ACM Symposium on Theory of Computing (STOC)
·
135
PDF
Deterministic parallel list ranking
2006
·
Richard J. Anderson
, Gary L. Miller
·
Springer eBooks
·
117
Lower bound on the number of processors and time for scheduling precedence graphs with communication costs
1990
·
M.A. Al-Mouhamed
·
IEEE Transactions on Software Engineering
·
115
Divide-and-Conquer for Parallel Processing
1983
·
Horowitz
, Zorat
·
IEEE Transactions on Computers
·
102
Constructing a Maximal Independent Set in Parallel
1989
·
Mark Goldberg
, Thomas Spencer
·
SIAM Journal on Discrete Mathematics
·
88
Deterministic parallel list ranking
1991
·
Richard J. Anderson
, Gary L. Miller
·
Algorithmica
·
87
A performance analysis of the gamma database machine
1988
·
D. J. DeWitt
, S. Ghanderaizadeh
, et al.
·
ACM SIGMOD Record
·
80
Modeling the benefits of mixed data and task parallelism
1995
·
Soumen Chakrabarti
, James Demmel
, et al.
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
78
Connected Components inO(log3/2n) Parallel Time for the CREW PRAM
1997
·
Donald B Johnson
, Panagiotis Metaxas
·
Journal of Computer and System Sciences
·
71
The Complexity of Parallel Evaluation of Linear Recurrences
1977
·
L. Hyafil
, H. T. Kung
·
Journal of the ACM
·
69
PDF
Parallel efficiency can be greater than unity
1986
·
D. Parkinson
·
Parallel Computing
·
61
Scientific Parallel Computing
2021
·
L. Ridgway Scott
, Terry Clark
, et al.
·
Princeton University Press eBooks
·
54
General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms*
2013
·
Jörg Lässig
, Dirk Sudholt
·
Evolutionary Computation
·
50
PDF
A parallel search algorithm for directed acyclic graphs
1984
·
Ratan K. Ghosh
, G. P. Bhattacharjee
·
BIT Numerical Mathematics
·
50
Partitioning strategies for structured multiblock grids
2000
·
J Rantakokko
·
Parallel Computing
·
47
Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases
1992
·
E. Kaltofen
, V. Pan
·
Annual Symposium on Foundations of Computer Science
·
46
A complexity theory for unbounded fan-in parallelism
1982
·
Ashok K. Chandra
, Larry J. Stockmeyer
, et al.
·
Annual Symposium on Foundations of Computer Science
·
45
Show more works
View as search
Works count:
229
Citation count:
4,345
Year
Topic
Type