✦ LIBER ✦

A parallel sorting — merging algorithm for tightly coupled multiprocessors

✍ Scribed by D.J Evans

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 480 KB
Volume: 14
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(90)90100-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel sorting algorithms for tightly

Parallel sorting algorithms for tightly coupled multiprocessors

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

An efficient parallel sorting algorithm

An efficient parallel sorting algorithm for shared memory multiprocessors

✍ M. Wheat; D.J. Evans 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 498 KB

A balanced submatrix merging algorithm f

A balanced submatrix merging algorithm for multiprocessor architectures

✍ Eleanor Chu; Alan George 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 667 KB

A new solution of coherence protocol for

A new solution of coherence protocol for tightly coupled multiprocessor systems

✍ Cosimo Antonio Prete 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 647 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+

A Parallel Architecture for the Self-Sor

A Parallel Architecture for the Self-Sorting FFT Algorithm

✍ F. Arguello; J.D. Bruguera; E.L. Zapata 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 782 KB