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

Memory Conscious Scheduling for Cluster-based NUMA Multiprocessors

โœ Scribed by Takahiro Koita; Tetsuro Katayama; Keizo Saisho; Akira Fukuda

Book ID
110259511
Publisher
Springer US
Year
2000
Tongue
English
Weight
170 KB
Volume
16
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Performance evaluation of Two-level Sche
Performance evaluation of Two-level Scheduling algorithms for NUMA multiprocessors
โœ Yukio Ohishi; Keizo Saisho; Akira Fukuda ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 210 KB

In this article, we simulate and evaluate various Twolevel Scheduling algorithms for cluster-based NUMA (Non-Uniform Memory Access) multiprocessors. Twolevel Scheduling is a kind of space partitioning scheduling. We evaluate the following variations: (1) Cluster-free Algorithm and (2) Cluster-limite

Design and analysis of static memory man
Design and analysis of static memory management policies for CC-NUMA multiprocessors
โœ Ravishankar Iyer; Hujun Wang; Laxmi Narayan Bhuyan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 995 KB

In this paper, we characterize the performance of three existing memory management techniques, namely, buddy, round-robin, and first-touch policies. With existing memory management schemes, we find several cases where requests from different processors arrive at the same memory simultaneously. To al