๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Token coherence: a new framework for shared-memory multiprocessors

โœ Scribed by Martin, M.M.K.; Hill, M.D.; Wood, D.A.

Book ID
117897105
Publisher
IEEE
Year
2003
Tongue
English
Weight
287 KB
Volume
23
Category
Article
ISSN
0272-1732

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A new memory allocation method for share
A new memory allocation method for shared memory multiprocessors with large virtual address space
โœ Koide, Hiroshi; Suzuki, Mitsugu; Nakayama, Yasuichi ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB

This paper proposes a new memory allocation method for shared memory multiprocessors with large virtual address spaces. An evaluation of its performance is also presented. For effective use of shared memory multiprocessors, it is important that no processor's execution is blocked. If several proces

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

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