Results 1  10
of
1,325
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 48 (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
A provable time and space efficient implementation of nesl
 In International Conference on Functional Programming
, 1996
"... In this paper we prove time and space bounds for the implementation of the programming language NESL on various parallel machine models. NESL is a sugared typed Jcalculus with a set of array primitives and an explicit parallel map over arrays. Our results extend previous work on provable implementa ..."
Abstract

Cited by 84 (10 self)
 Add to MetaCart
sequential implementation. We show that a NESL program with w work (nodes in the DAG), d depth (levels in the DAG), and s sequential space can be implemented on a p processor butterfly network, hypercube, or CRCW PRAM usin O(w/p + d log p) time and 0(s + dp logp) reachable space. For programs with sufficient
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.
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
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
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
The Parameterized PRAM
"... Various alternatives to the PRAM model have been proposed in recent literature. This paper defines the notion of cost consistency, and shows that many previous PRAMtype models lack this important attribute. An alternative model of parallel computation, called the Parameterized PRAM, is then introdu ..."
Abstract
 Add to MetaCart
Various alternatives to the PRAM model have been proposed in recent literature. This paper defines the notion of cost consistency, and shows that many previous PRAMtype models lack this important attribute. An alternative model of parallel computation, called the Parameterized PRAM
On the Physical Design of PRAMs
, 1993
"... The Saarbrucken Parallel Random Access Machine (SBPRAM) is a scalable shared memory machine. At the gate level it is a reengineered version of the Fluent machine [A. G. Ranade, S. N. Bhatt and S. L. Johnson. The Fluent Abstract Machine. In Proc. 5th MIT Conference on Advanced Research in VLSI, pp. ..."
Abstract

Cited by 49 (13 self)
 Add to MetaCart
The Saarbrucken Parallel Random Access Machine (SBPRAM) is a scalable shared memory machine. At the gate level it is a reengineered version of the Fluent machine [A. G. Ranade, S. N. Bhatt and S. L. Johnson. The Fluent Abstract Machine. In Proc. 5th MIT Conference on Advanced Research in VLSI, pp
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
Results 1  10
of
1,325