Results 1  10
of
200
A lower bound for PARITY on randomized CRCW PRAMs
"... The parity function PARITY(x1 ; : : : ; xn) = P in x i mod 2 is known to be difficult to compute on parallel machines. The famous result of Beame and Hastad says that computing PARITY on PRIORITY CRCW PRAMs requires\Omega\Gamma log n log log n ) steps, provided that the number of processors or ..."
Abstract
 Add to MetaCart
The parity function PARITY(x1 ; : : : ; xn) = P in x i mod 2 is known to be difficult to compute on parallel machines. The famous result of Beame and Hastad says that computing PARITY on PRIORITY CRCW PRAMs requires\Omega\Gamma log n log log n ) steps, provided that the number of processors
Optimal bounds for decision problems on the CRCW PRAM
 In Proceedings of the 19th ACM Symposium on Theory of Computing (New
"... Abstract. Optimal Q(logn/log logn) lower bounds on the time for CRCW PRAMS with polynomially bounded numbers of processors or memory cells to compute parity and a number of related problems are proven. A strict time hierarchy of explicit Boolean functions of n bits on such machines that holds up to ..."
Abstract

Cited by 49 (2 self)
 Add to MetaCart
Abstract. Optimal Q(logn/log logn) lower bounds on the time for CRCW PRAMS with polynomially bounded numbers of processors or memory cells to compute parity and a number of related problems are proven. A strict time hierarchy of explicit Boolean functions of n bits on such machines that holds up
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
, 1992
"... The kcompaction problem arises when k out of n cells in an array are nonempty and the contents of these cells must be moved to the first k locations in the array. Parallel algorithms for kcompaction have obvious applications in processor allocation and load balancing; kcompaction is also an im ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
compaction problem requires\Omega\Gammaqui log n) time, even if k = 2. Finally, we show that O(log k) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.
Abstract Optimal Bounds for Decision Problems on the CRCW PRAM
"... We prove optimal R(log n/log log n) lower bounds on the time for CRCW PRAM’s with polynomially bounded numbers of processors or memory cells to compute parity and a number of related problems. We also exhibit a strict time hierarchy of explicit Boolean functions of n bits on such machines which h ..."
Abstract
 Add to MetaCart
We prove optimal R(log n/log log n) lower bounds on the time for CRCW PRAM’s with polynomially bounded numbers of processors or memory cells to compute parity and a number of related problems. We also exhibit a strict time hierarchy of explicit Boolean functions of n bits on such machines which
Lower bounds for recognizing small cliques on CRCW PRAM’s
 Discrete Appl. Math
, 1990
"... We show that any CRCW PRAM which recognizes kcliques in nnode graphs in time T requires at least nn(k’r2) processors independent of its memory size. As a corollary we obtain essentially the same tradeoff for unbounded fanin circuits. We also demonstrate a similar but weaker tradeoff for the me ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We show that any CRCW PRAM which recognizes kcliques in nnode graphs in time T requires at least nn(k’r2) processors independent of its memory size. As a corollary we obtain essentially the same tradeoff for unbounded fanin circuits. We also demonstrate a similar but weaker trade
Parallel Algorithmic Techniques: PRAM Algorithms And PRAM Simulations
, 1995
"... PRAM , which is the Priority CRCW PRAM in which each processor can perform arbitrary complex local operations in a single step. Clearly the Abtract PRAM is stronger than the Priority CRCW PRAM, and actually, it is stronger than any other standard (hence we do not take into account the Minimum CRCW ..."
Abstract
 Add to MetaCart
PRAM , which is the Priority CRCW PRAM in which each processor can perform arbitrary complex local operations in a single step. Clearly the Abtract PRAM is stronger than the Priority CRCW PRAM, and actually, it is stronger than any other standard (hence we do not take into account the Minimum CRCW
Comments on Integer Sorting on SumCRCW
"... Abstract Given an array X of n elements from a restricted domain of integers [1, n]. The integer sorting problem is the rearrangement of n integers in ascending order. We study the first optimal deterministic sublogarithmic algorithm for integer sorting on CRCW PRAM. We give two comments on the alg ..."
Abstract
 Add to MetaCart
Abstract Given an array X of n elements from a restricted domain of integers [1, n]. The integer sorting problem is the rearrangement of n integers in ascending order. We study the first optimal deterministic sublogarithmic algorithm for integer sorting on CRCW PRAM. We give two comments
On the Power of Some PRAM Models
 Journal of Parallel Algorithms and Applications. Vol
, 1997
"... The focus here is the power of some underexplored CRCW PRAMs, which are strictly more powerful than exclusive write PRAM but strictly less powerful than BSR. We show that some problems can be solved more efficiently in time and/or processor bounds on these models. For example, we show that n linearl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The focus here is the power of some underexplored CRCW PRAMs, which are strictly more powerful than exclusive write PRAM but strictly less powerful than BSR. We show that some problems can be solved more efficiently in time and/or processor bounds on these models. For example, we show that n
Optimal sublogarithmic time integer sorting on a CRCW
, 1991
"... Rajasekaran and Reif considered the problem of sorting n integers, each in the range {l,..., n}, in parallel On the CRCW PRAM, and gave a nonoptimal sublogarithmic time algorithm for this problem [7]. They left open the question of whether an optimal algorithm for this problem could be constructed ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Rajasekaran and Reif considered the problem of sorting n integers, each in the range {l,..., n}, in parallel On the CRCW PRAM, and gave a nonoptimal sublogarithmic time algorithm for this problem [7]. They left open the question of whether an optimal algorithm for this problem could
January 1991Emulation of a PRAM on Leveled Networks
"... We present efficient emulations of the CRCW PRAM on a large class of processor interconnection networks called leveled networks. This class includes the star graph and the nway shuffle, which have the interesting property that the network diameter is sublogarithmic in the network size. We show tha ..."
Abstract
 Add to MetaCart
We present efficient emulations of the CRCW PRAM on a large class of processor interconnection networks called leveled networks. This class includes the star graph and the nway shuffle, which have the interesting property that the network diameter is sublogarithmic in the network size. We show
Results 1  10
of
200