✦ LIBER ✦

An efficient parallel sorting algorithm for shared memory multiprocessors

✍ Scribed by M. Wheat; D.J. Evans

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 498 KB
Volume: 18
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(92)90114-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel ELLPACK for shared memory multi

Parallel ELLPACK for shared memory multiprocessors

✍ Calvin J. Ribbens; George G. Pitts; Layne T. Watson 📂 Article 📅 1993 🏛 Elsevier Science ⚖ 865 KB

This paper describes a parallel version of ELLPACK for shared memory multiprocessors. ELLPACK is a system for numerically solving elliptic PDEs. It consists of a very high level language for defining PDE problems and selecting methods of solution, and a library of approximately 50 problem solving mo

Parallel algorithms for QR decomposition

Parallel algorithms for QR decomposition on a shared memory multiprocessor

✍ K. Wright 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 733 KB

Wright K., Parallel algorithms for QR decomposition on a shared memory multiprocessor, Parallel Computing 17 (1991) 779-790. Various parallel implementations of algorithms for the QR decomposition of a matrix are compared using shared memory multiprocessors. Algorithms based on both Givens and Hous

An efficient parallel sorting algorithm

✍ Xiaoqing Liu; Junguk L. Kim 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Parallel sorting algorithms for tightly

Parallel sorting algorithms for tightly coupled multiprocessors

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

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

A task duplication based scheduling algo

A task duplication based scheduling algorithm for shared memory multiprocessors

✍ Oh-Han Kang; Si-Gwan Kim 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 134 KB

We present a task duplication based scheduling algorithm for shared memory multiprocessors (SMPs), called S2MP (scheduling for SMP), to address the problem of task scheduling. This algorithm employs heuristics to select duplication of tasks so that schedule length is reduced/minimized. The performan