Add to ORKGWe consider a parallel random access machine (PRAM) in which information is communicated via a shared memory. We strengthen a lower bound of Cook, Dwork and Reischuk for the time required to compute the Boolean "OR " function under some additional restrictions on the type of algorithms allowed. Then, we consider a related model in which a limited number of simultaneous writes is allowed and provide an algorithm for computing the Boolean OR " which is optimal within the class of non-adaptive " algorithms
AbstractThe PRAM model of parallel computation is examined with respect to wordsize, the number of b...
AbstractThe ROBUST PRAM is a concurrent-read concurrent-write (CRCW) parallel random access machine ...
We consider parallel random access machines (PRAMs) with restricted access to the shared memory res...
We consider a parallel random access machine (PRAM) in which information is communicated via a share...
The time complexity of Boolean functions on abstract concurrent-read exclusive-write parallel random...
Bibliography: leaf 6.Research supported by the Army Research Office under contract DAAAG-29-84-K-005...
Determining time necessary for computing important functions on parallel machines is one of the most...
Bibliography: leaf 6.Research supported by the Army Research Office under contract DAAAG-29-84-K-005...
The ROBUST PRAM is a concurrent-read concurrent-write (CRCW) parallel random access machine in which...
The lirst result presented in this paper is a lower bound of Q(log n) for the computation time of co...
The queue-read, queue-write (QRQW) parallel random access machine (PRAM) model is a shared memory mo...
We present lower bounds for time needed to solve basic problems on three general-purpose models of p...
Abstr¡ct. wc prove optimal lower bounds on the computation time for several well-known test problems...
We consider parallel random access machines (PRAM's) with p processors and distributed systems of ra...
Abstract We present lower bounds for time needed to solve basic problems on three general-purpose mo...
AbstractThe PRAM model of parallel computation is examined with respect to wordsize, the number of b...
AbstractThe ROBUST PRAM is a concurrent-read concurrent-write (CRCW) parallel random access machine ...
We consider parallel random access machines (PRAMs) with restricted access to the shared memory res...
We consider a parallel random access machine (PRAM) in which information is communicated via a share...
The time complexity of Boolean functions on abstract concurrent-read exclusive-write parallel random...
Bibliography: leaf 6.Research supported by the Army Research Office under contract DAAAG-29-84-K-005...
Determining time necessary for computing important functions on parallel machines is one of the most...
Bibliography: leaf 6.Research supported by the Army Research Office under contract DAAAG-29-84-K-005...
The ROBUST PRAM is a concurrent-read concurrent-write (CRCW) parallel random access machine in which...
The lirst result presented in this paper is a lower bound of Q(log n) for the computation time of co...
The queue-read, queue-write (QRQW) parallel random access machine (PRAM) model is a shared memory mo...
We present lower bounds for time needed to solve basic problems on three general-purpose models of p...
Abstr¡ct. wc prove optimal lower bounds on the computation time for several well-known test problems...
We consider parallel random access machines (PRAM's) with p processors and distributed systems of ra...
Abstract We present lower bounds for time needed to solve basic problems on three general-purpose mo...
AbstractThe PRAM model of parallel computation is examined with respect to wordsize, the number of b...
AbstractThe ROBUST PRAM is a concurrent-read concurrent-write (CRCW) parallel random access machine ...
We consider parallel random access machines (PRAMs) with restricted access to the shared memory res...