Parallel algorithms for merging and sorting

Narsingh Deo, Dilip Sarkar

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We present an O(log(min(m,n,j))-time sequential algorithm to select the jth-smallest element of an array resulting from the merging of two sorted arrays A and B of sizes m and n. This algorithm is then used to design two parallel algorithms to partition A and B into p subarrays of size O( (m + n) p) in O( N p + log N) and O( N p + log p log N) times on crew pram and erew pram models with p processors, where N = m + n. A third parallel algorithm has been presented that partitions A and B in O( N p + log p log N) time into p pairs of subarrays of size O( N p) on erew pram with p processors without using any selection algorithm. Finally, these partitioning algorithms are used to obtain optimal parallel merging and sorting algorithms on crew prams and erew prams.

Original languageEnglish (US)
Pages (from-to)151-161
Number of pages11
JournalInformation Sciences
Volume56
Issue number1-3
DOIs
StatePublished - Jan 1 1991

Fingerprint

Sorting
Merging
Parallel algorithms
Parallel Algorithms
Partition
Sorting algorithm
Sequential Algorithm
Partitioning
Model

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

Parallel algorithms for merging and sorting. / Deo, Narsingh; Sarkar, Dilip.

In: Information Sciences, Vol. 56, No. 1-3, 01.01.1991, p. 151-161.

Research output: Contribution to journalArticle

Deo, Narsingh ; Sarkar, Dilip. / Parallel algorithms for merging and sorting. In: Information Sciences. 1991 ; Vol. 56, No. 1-3. pp. 151-161.
@article{33abed8c00334f9e8e652502c67aad6b,
title = "Parallel algorithms for merging and sorting",
abstract = "We present an O(log(min(m,n,j))-time sequential algorithm to select the jth-smallest element of an array resulting from the merging of two sorted arrays A and B of sizes m and n. This algorithm is then used to design two parallel algorithms to partition A and B into p subarrays of size O( (m + n) p) in O( N p + log N) and O( N p + log p log N) times on crew pram and erew pram models with p processors, where N = m + n. A third parallel algorithm has been presented that partitions A and B in O( N p + log p log N) time into p pairs of subarrays of size O( N p) on erew pram with p processors without using any selection algorithm. Finally, these partitioning algorithms are used to obtain optimal parallel merging and sorting algorithms on crew prams and erew prams.",
author = "Narsingh Deo and Dilip Sarkar",
year = "1991",
month = "1",
day = "1",
doi = "10.1016/0020-0255(91)90028-S",
language = "English (US)",
volume = "56",
pages = "151--161",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "1-3",

}

TY - JOUR

T1 - Parallel algorithms for merging and sorting

AU - Deo, Narsingh

AU - Sarkar, Dilip

PY - 1991/1/1

Y1 - 1991/1/1

N2 - We present an O(log(min(m,n,j))-time sequential algorithm to select the jth-smallest element of an array resulting from the merging of two sorted arrays A and B of sizes m and n. This algorithm is then used to design two parallel algorithms to partition A and B into p subarrays of size O( (m + n) p) in O( N p + log N) and O( N p + log p log N) times on crew pram and erew pram models with p processors, where N = m + n. A third parallel algorithm has been presented that partitions A and B in O( N p + log p log N) time into p pairs of subarrays of size O( N p) on erew pram with p processors without using any selection algorithm. Finally, these partitioning algorithms are used to obtain optimal parallel merging and sorting algorithms on crew prams and erew prams.

AB - We present an O(log(min(m,n,j))-time sequential algorithm to select the jth-smallest element of an array resulting from the merging of two sorted arrays A and B of sizes m and n. This algorithm is then used to design two parallel algorithms to partition A and B into p subarrays of size O( (m + n) p) in O( N p + log N) and O( N p + log p log N) times on crew pram and erew pram models with p processors, where N = m + n. A third parallel algorithm has been presented that partitions A and B in O( N p + log p log N) time into p pairs of subarrays of size O( N p) on erew pram with p processors without using any selection algorithm. Finally, these partitioning algorithms are used to obtain optimal parallel merging and sorting algorithms on crew prams and erew prams.

UR - http://www.scopus.com/inward/record.url?scp=0026204033&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026204033&partnerID=8YFLogxK

U2 - 10.1016/0020-0255(91)90028-S

DO - 10.1016/0020-0255(91)90028-S

M3 - Article

AN - SCOPUS:0026204033

VL - 56

SP - 151

EP - 161

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 1-3

ER -