Results 1  10
of
218
Limitations of the QRQW and EREW PRAM Models
, 1996
"... We consider parallel random access machines (PRAMs) with restricted access to the shared memory resulting from handling congestion of memory requests. We study the (SIMD) QRQW PRAM model where multiple requests are queued and serviced one at a time. We also consider exclusive read exclusive write ( ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(EREW) PRAM and its modification obtained by adding a single bus. For the QRQW PRAMs we investigate the case when the machine can measure the duration of a single step. Even for such a (powerful) QRQW PRAM PARITY of n bits (PARITYn ) requires\Omega (log n) time while OR of n bits can be computed
Limitations of the QRQW and EREW PRAM Models
"... . We consider parallel random access machines (PRAMs) with restricted access to the shared memory resulting from handling congestion of memory requests. We study the (SIMD) QRQW PRAM model where multiple requests are queued and serviced one at a time. We also consider exclusive read exclusive write ..."
Abstract
 Add to MetaCart
(EREW) PRAM and its modification obtained by adding a single bus. For the QRQW PRAMs we investigate the case when the machine can measure the duration of a single step. Even for such a (powerful) QRQW PRAM PARITY of n bits (PARITYn ) requires\Omega (log n) time while OR of n bits can be computed
Priority Queue Operations On EREWPRAM
, 1997
"... . Using EREWPRAM algorithms on a tournament based complete binary tree we implement the insert and extractmin operations with p = log N processors at costs O(1) and O(log log N) respectively. Previous solutions [4, 7] under the PRAM model and identical assumptions attain O(log log N) cost for both ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. Using EREWPRAM algorithms on a tournament based complete binary tree we implement the insert and extractmin operations with p = log N processors at costs O(1) and O(log log N) respectively. Previous solutions [4, 7] under the PRAM model and identical assumptions attain O(log log N) cost
Fast integer merging on the EREW PRAM
 IN PROC. 19TH INTL. COLL. ON AUTOMATA, LANGUAGES, AND PROGRAMMING
, 1992
"... We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merged in O(log log n) time. More generally, we describe an algorithm to merge two sorted sequences of n integers drawn from the set { ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merged in O(log log n) time. More generally, we describe an algorithm to merge two sorted sequences of n integers drawn from the set
Fast connected components algorithms for the erew pram
 SIAM J. Comput
, 1999
"... We present fast and ecient parallel algorithms for nding the connected components of an undirected graph. These algorithms run on the exclusiveread, exclusivewrite (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using (m+n 1+) = logn EREW process ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
We present fast and ecient parallel algorithms for nding the connected components of an undirected graph. These algorithms run on the exclusiveread, exclusivewrite (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using (m+n 1+) = logn EREW
A Sublinear Time Parallel GCD Algorithm for the EREW PRAM
, 2009
"... We present a parallel algorithm that computes the greatest common divisor of two integers of n bits in length that takes O(n log log n / logn) expected time using n 6+ǫ processors on the EREW PRAM parallel model of computation. We believe this to be the first sublinear time algorithm on the EREW PRA ..."
Abstract
 Add to MetaCart
We present a parallel algorithm that computes the greatest common divisor of two integers of n bits in length that takes O(n log log n / logn) expected time using n 6+ǫ processors on the EREW PRAM parallel model of computation. We believe this to be the first sublinear time algorithm on the EREW
Optimal randomized EREW PRAM algorithms for finding spanning forests
 J. Algorithms
, 2000
"... We present the first randomized O(log n) time and O(m+n) work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = (V; E) with n vertices and m edges. Our algorithm is optimal with respect to time, work and space. As a consequence we get optimal randomized EREW PRAM algori ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We present the first randomized O(log n) time and O(m+n) work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = (V; E) with n vertices and m edges. Our algorithm is optimal with respect to time, work and space. As a consequence we get optimal randomized EREW PRAM
Faster Finding of Simple Cycles in Planar Graphs on a randomized EREWPRAM
 Proc. 2 nd Workshop on Randomized Parallel Computing
, 1997
"... We show that if a planar graph has a simple cycle of length k, where k is a fixed integer, such a cycle may be computed in O(log n) time by a randomized EREWPRAM with O(n) processors with high probability. This improves a previous result of [8]. The improvement relies on an efficient parallel algor ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We show that if a planar graph has a simple cycle of length k, where k is a fixed integer, such a cycle may be computed in O(log n) time by a randomized EREWPRAM with O(n) processors with high probability. This improves a previous result of [8]. The improvement relies on an efficient parallel
An Optimal Randomized Logarithmic Time Connectivity Algorithm for the EREW PRAM
, 1996
"... Improving a long chain of works we obtain a randomised EREW PRAM algorithm for finding the connected components of a graph G = (V; E) with n vertices and m edges in O(logn) time using an optimal number of O((m + n)= log n) processors. The result returned by the algorithm is always correct. The pr ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Improving a long chain of works we obtain a randomised EREW PRAM algorithm for finding the connected components of a graph G = (V; E) with n vertices and m edges in O(logn) time using an optimal number of O((m + n)= log n) processors. The result returned by the algorithm is always correct
An Optimal EREW PRAM Algorithm For Minimum Spanning Tree Verification
, 1997
"... We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O(log n) time and O(m + n) work. The algorithm is a parallelization of King's linear time sequential algorithm for the ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O(log n) time and O(m + n) work. The algorithm is a parallelization of King's linear time sequential algorithm
Results 1  10
of
218