✦ LIBER ✦

Parallel algorithms for merging and sorting

✍ Scribed by Narsingh Deo; Dilip Sarkar

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 638 KB
Volume: 56
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(91)90028-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel sorting — merging algorithm f

A parallel sorting — merging algorithm for tightly coupled multiprocessors

✍ D.J Evans 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 480 KB

The parallel neighbour sort and 2-way me

The parallel neighbour sort and 2-way merge algorithm

✍ D.J Evans; Nadia Y Yousif 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 373 KB

Optimal parallel merging and sorting alg

Optimal parallel merging and sorting algorithms using √N processors without memory contention

✍ Jau-Hsiung Huang; Leonard Kleinrock 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 585 KB

Parallel sorting algorithms for tightly

Parallel sorting algorithms for tightly coupled multiprocessors

✍ Michael J. Quinn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 663 KB

Parallelization of sorting algorithms

✍ G. E. Tseitlin 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 718 KB

Parallel Sorting Algorithm Using Multiwa

Parallel Sorting Algorithm Using Multiway Merge and Its Implementation on a Multi-Mesh Network

✍ Bhabani P. Sinha; Amar Mukherjee 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 288 KB

In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This algorithm, when implemented on a t dimensional mesh having n t nodes (t>2), sorts n t elements in O((t 2 &3t+2) n) time, thus offering a better order of time complexity than the [((t 2 &t) n log n)Â2+