✦ LIBER ✦

Parallel algorithms for QR decomposition on a shared memory multiprocessor

✍ Scribed by K. Wright

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 733 KB
Volume: 17
Category: Article
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(05)80066-3

No coin nor oath required. For personal study only.

✦ Synopsis

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 Householder transformations are considered. A number of parallelisation techniques are used with particular emphasis on algorithms which allocate work to tasks dynamically. The results indicate that one version is significantly better than the others.

📜 SIMILAR VOLUMES

Algorithms for LU decomposition on a sha

Algorithms for LU decomposition on a shared memory multiprocessor

✍ John J Buoni; Paul A Farrell; Arden Ruttan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 564 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

Parallel sparse Cholesky factorization o

Parallel sparse Cholesky factorization on a shared memory multiprocessor

✍ G Zhang; H.C Elman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 766 KB

Parallel parsing of MPEG video on a shar

Parallel parsing of MPEG video on a shared-memory symmetric multiprocessor

✍ Suchendra M. Bhandarkar; Shankar R. Chandrasekaran 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Run-time support For parallel functional

Run-time support For parallel functional programming on shared-memory multiprocessors

✍ Lee Ching-Cheng; H.A. Fatmi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 813 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