ON PARALLEL PREFIX COMPUTATION

1994 ◽  
Vol 04 (04) ◽  
pp. 429-436 ◽  
Author(s):  
SANJEEV SAXENA ◽  
P.C.P. BHATT ◽  
V.C. PRASAD
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Optimal Time ◽  
Word Size ◽  
Parallel Prefix ◽  
Parallel Merge ◽  
Merge Sort ◽  
Sort Algorithm ◽  
Crcw Pram ◽  
Prefix Sums

We prove that prefix sums of n integers of at most b bits can be found on a COMMON CRCW PRAM in [Formula: see text] time with a linear time-processor product. The algorithm is optimally fast, for any polynomial number of processors. In particular, if [Formula: see text] the time taken is [Formula: see text]. This is a generalisation of previous result. The previous [Formula: see text] time algorithm was valid only for O(log n)-bit numbers. Application of this algorithm to r-way parallel merge sort algorithm is also considered. We also consider a more realistic PRAM variant, in which the word size, m, may be smaller than b (m≥log n). On this model, prefix sums can be found in [Formula: see text] optimal time.

Parallel merge sort using comparison matrices. I

1994 ◽  
Vol 30 (5) ◽  
pp. 631-647 ◽  
Author(s):  
Ya. E. Romm
Keyword(s):  
Parallel Merge ◽  
Merge Sort

scholarly journals Data-Adapted Parallel Merge Sort

2020 ◽  
pp. 388-399
Author(s):  
Johannes Holke ◽  
Alexander Rüttgers ◽  
Margrit Klitz ◽  
Achim Basermann
Keyword(s):  
Parallel Merge ◽  
Merge Sort
Sign in / Sign up

Export Citation Format

Share Document