scholarly journals An efficient parallel algorithm for the single function coarsest partition problem

1994 ◽  
Vol 129 (2) ◽  
pp. 293-307 ◽  
Author(s):  
Joseph F. Jájá ◽  
Kwan Woo Ryu
Keyword(s):  
Parallel Algorithm ◽  
Partition Problem ◽  
Single Function

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

A SIMPLE PARALLEL ALGORITHM FOR THE SINGLE FUNCTION COARSEST PARTITION PROBLEM

1994 ◽  
Vol 04 (04) ◽  
pp. 437-445 ◽  
Author(s):  
CLIVE N. GALLEY ◽  
COSTAS S. ILIOPOULOS
Keyword(s):  
Parallel Algorithm ◽  
Parallel Computation ◽  
Simple Algorithm ◽  
Partition Problem ◽  
Pram Model ◽  
Single Function ◽  
Crcw Pram

This paper shows a simple algorithm for solving the single function coarsest partition problem on the CRCW PRAM model of parallel computation using O(n) processors in O( log n) time with O(n1+ε) space.

AN OPTIMAL RANDOMIZED PARALLEL ALGORITHM FOR THE SINGLE FUNCTION COARSEST PARTITION PROBLEM

1996 ◽  
Vol 06 (02) ◽  
pp. 187-193
Author(s):  
JOSEPH JÁJÁ ◽  
KWAN WOO RYU
Keyword(s):  
Parallel Algorithm ◽  
High Probability ◽  
Rooted Tree ◽  
Partition Problem ◽  
Single Function ◽  
Crew Pram ◽  
Euler Tour ◽  
Crcw Pram

We describe a randomized parallel algorithm to solve the single function coarsest partition problem. The algorithm runs in O( log n) time using O(n) operations with high probability on the Priority CRCW PRAM. The previous best known algorithms run in O( log 2 n) time using O(n log 2 n) operations on the CREW PRAM and O( log n) time using O(n log log n) operations on the Arbitrary CRCW PRAM. The technique presented can be used to generate the Euler tour of a rooted tree optimally from the parent representation.

scholarly journals A linear time solution to the single function coarsest partition problem

1985 ◽  
Vol 40 ◽  
pp. 67-84 ◽  
Author(s):  
Robert Paige ◽  
Robert E. Tarjan ◽  
Robert Bonic
Keyword(s):  
Linear Time ◽  
Partition Problem ◽  
Time Solution ◽  
Single Function
Sign in / Sign up

Export Citation Format

Share Document