Work-Time Optimal K-Merge Algorithms on the PRAM

The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is to propose simple and intuitive work-time optimal algorithms for the k-merge problem on two PRAM models. Specifically, our k-merge algorithms perform Onlog k work and run in Olog n time on the EREW-PRAM and in Olog log n+log k time on the CREW-PRAM, respectively.

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Tatsuya Hayashi, Koji Nakano, Stephan Olariu
• Keywords: Distributed And Parallel Computing, IPPS 1997, K-merge Problem, Sorted Sequence, Work-time Optimal Algorithms