Complexity theory for unbounded fan-in parallelism
Conference
·
OSTI ID:5248275
A complexity theory for unbounded fan-in parallelism is developed where the complexity measure is the simultaneous measure (number of processors, parallel time). Two models of unbounded fan-in parallelism are: parallel random access machines that allow simultaneous reading from or writing to the same common memory location, circuits containing ands, ors and nots with no bound placed on the fan-in of gates. These models can simulate one another with the number of processors preserved to within a polynomial and parallel time preserved to within a constant factor. Reducibilities that preserve the measure in this sense are defined and several reducibilities and equivalences among problems are given. New upper bounds on the circuit complexity of symmetric Boolean functions are proved. 37 references.
- OSTI ID:
- 5248275
- Report Number(s):
- CONF-821180-
- Country of Publication:
- United States
- Language:
- English
Similar Records
Simulation of parallel random access machines by circuits
Lower-bound techniques in some parallel models of computation
Lower bounds for parallel computation
Journal Article
·
Tue May 01 00:00:00 EDT 1984
· SIAM J. Comput.; (United States)
·
OSTI ID:6300636
Lower-bound techniques in some parallel models of computation
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6223398
Lower bounds for parallel computation
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:5263000