✦ LIBER ✦

A unifiedO(logN) and optimal sorting vector algorithm

✍ Scribed by Qingshi Gao

Book ID: 112949046
Publisher: Springer
Year: 1995
Tongue: English
Weight: 306 KB
Volume: 10
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02948343

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal hardware-algorithm for sortin

An optimal hardware-algorithm for sorting using a fixed-size parallel sorting device

✍ Olarlu, S.; Pinotti, M.C.; Si Qing Zheng 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 275 KB

Optimal Distributed Algorithms for Sorti

Optimal Distributed Algorithms for Sorting and Ranking

✍ Zaks, Shmuel 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 981 KB

A time-optimal distributed sorting algor

A time-optimal distributed sorting algorithm on a line network

✍ Atsushi Sasaki 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 87 KB

We have achieved a strict lower time bound of n -1 for distributed sorting on a line network, where n is the number of processes. The lower time bound has traditionally been considered to be n because it is proved based on the number of disjoint comparison-exchange operations in parallel sorting on

Sorting algorithms for the implementatio

Sorting algorithms for the implementation of a generalized vector product

✍ Alberto Garcia-Diaz; Donald K. Friesen; Donald J. Bagert 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

A Nonoblivious Bus Access Scheme Yields

A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm

✍ Satoshi Fujita; Masafumi Yamashita 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 286 KB

This paper focuses on a linear array of n nodes with multiple shared buses as a practically feasible model for parallel processing. Let k be the number of shared buses. A nonoblivious scheme for mutually exclusive access to k shared buses is proposed. The effectiveness of the scheme is demonstrated

A select and insert sorting algorithm

✍ István Beck; Stein Krogdahl 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 514 KB