scholarly journals Fast integer merging on the EREW PRAM

Algorithmica ◽  
1997 ◽  
Vol 17 (1) ◽  
pp. 55-66 ◽  
Author(s):  
T. Hagerup ◽  
M. Kutyłowski
Keyword(s):  
Erew Pram ◽  
Integer Merging

Integer merging on EREW PRAM

Computing ◽  
2010 ◽  
Vol 91 (4) ◽  
pp. 365-378 ◽  
Author(s):  
Hazem M. Bahig
Keyword(s):  
Erew Pram ◽  
Integer Merging

SUB-LOGARITHMIC ALGORITHMS FOR THE LARGEST EMPTY RECTANGLE PROBLEM

1993 ◽  
Vol 03 (01) ◽  
pp. 79-85
Author(s):  
STEPHAN OLARIU ◽  
WENHUI SHEN ◽  
LARRY WILSON
Keyword(s):  
Parallel Algorithms ◽  
Erew Pram ◽  
Pram Model ◽  
The Common ◽  
Crcw Pram ◽  
Natural Way

We show that the Largest Empty Rectangle problem can be solved by reducing it, in a natural way, to the All Nearest Smaller Values problem. We provide two classes of algorithms: the first one assumes that the input points are available sorted by x (resp. y) coordinate. Our algorithm corresponding to this case runs in O(log log n) time using [Formula: see text] processors in the Common-CRCW-PRAM model. For unsorted input, we present algorithms that run in [Formula: see text] time using [Formula: see text] processors in the Common-CRCW-PRAM, or in O( log n) time using [Formula: see text] processors in the EREW-PRAM model. No sub-logarithmic time parallel algorithms have been previously reported for this problem.

MATCHING POLYNOMIALS OF SERIES-PARALLEL GRAPHS

1993 ◽  
Vol 03 (01) ◽  
pp. 13-18 ◽  
Author(s):  
LIH-HSING HSU
Keyword(s):  
Parallel Algorithm ◽  
Efficient Algorithm ◽  
Matching Polynomial ◽  
Erew Pram ◽  
Parallel Graph

We present an efficient algorithm for computing the matching polynomial of a series-parallel graph in O(n2) time. This algorithm improves on the previous result of O(n3). We also present a cost-optimal parallel algorithm for computing the matching polynomial of a series-parallel graph using an EREW PRAM computer with the number of processors p less than n2/ log n.

scholarly journals FAST PARALLEL PERMUTATION ALGORITHMS

1995 ◽  
Vol 05 (02) ◽  
pp. 139-148 ◽  
Author(s):  
TORBEN HAGERUP ◽  
JÖRG KELLER
Keyword(s):  
Simple Algorithm ◽  
Address Space ◽  
Erew Pram ◽  
Run Time ◽  
Local Storage ◽  
Improved Algorithm

We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p) log n) and an improved algorithm with run time O(n/p + log n log log (n/p)). Both algorithms require n additional global bits and O(1) local storage per processor. If prefix summation is supported at the instruction level, the run time of the improved algorithm is O(n/p). The algorithms can be used to rehash the address space of a PRAM emulation.

scholarly journals An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM

ETRI Journal ◽  
1999 ◽  
Vol 21 (2) ◽  
pp. 22-30
Author(s):  
Kyeoung-Ju Ha Ha ◽  
Kyo-Min Ku Ku ◽  
Hae-Kyeong Park Park ◽  
Young-Kook Kim Kim ◽  
Kwan-Woo Ryu Ryu
Keyword(s):  
Parallel Algorithm ◽  
Partition Problem ◽  
Erew Pram ◽  
Single Function

Maintaining B-Trees on an EREW PRAM

1994 ◽  
Vol 22 (2) ◽  
pp. 329-335 ◽  
Author(s):  
L. Higham ◽  
E. Schenk
Keyword(s):  
Erew Pram ◽  
B Trees

Finding Connected Components in O(log n log log n) Time on the EREW PRAM

1995 ◽  
Vol 18 (3) ◽  
pp. 378-402 ◽  
Author(s):  
K.W. Chong ◽  
T.W. Lam
Keyword(s):  
Connected Components ◽  
Erew Pram

Binary Addition Chain on EREW PRAM

2011 ◽  
pp. 321-330
Author(s):  
Khaled A. Fathy ◽  
Hazem M. Bahig ◽  
Hatem M. Bahig ◽  
A. A. Ragb
Keyword(s):  
Erew Pram ◽  
Addition Chain ◽  
Binary Addition

scholarly journals On Parallel Integer Merging

1993 ◽  
Vol 106 (2) ◽  
pp. 266-285 ◽  
Author(s):  
O. Berkman ◽  
U. Vishkin
Keyword(s):  
Integer Merging
Sign in / Sign up

Export Citation Format

Share Document