✦ LIBER ✦

A time-space optimal parallel sorting on a hypercube

✍ Scribed by Qi Jianxian

Book ID: 105648354
Publisher: Wuhan University
Year: 1996
Tongue: English
Weight: 297 KB
Volume: 1
Category: Article
ISSN: 1007-1202
DOI: 10.1007/bf02900871

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pipelined Parallel Prefix Computations,

Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube

✍ Ernst W. Mayr; C.Greg Plaxton 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 601 KB

A Note on Optimal Time Broadcast in Faul

A Note on Optimal Time Broadcast in Faulty Hypercubes

✍ D. Peleg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 309 KB

This note describes an algorithm for broadcasting a message on the \(n\)-dimensional hypercube in optimal time ( \(n\) time units) and optimal communication ( \(2^{n}-1\) messages) in the presence of up to \(n-2\) arbitrary node or edge faults, assuming the set of faults is known to all nodes of the

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

A parallel three phase sorting procedure

A parallel three phase sorting procedure for a k-dimensional hypercube and a transputer implementation

✍ W Loots; T.H.C Smith 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 551 KB

A Parallel Space-Time Algorithm

✍ Christlieb, Andrew J.; Haynes, Ronald D.; Ong, Benjamin W. 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 257 KB

A note on adaptive parallel sorting

✍ Christos Levcopoulos; Ola Petersson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 651 KB