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

Thread Scheduling for Multiprogrammed Multiprocessors

โœ Scribed by N. S. Arora<ORF RID="A1">; R. D. Blumofe<ORF RID="A1">; C. G. Plaxton<ORF RID="A1">

Book ID
105915356
Publisher
Springer
Year
2001
Tongue
English
Weight
357 KB
Volume
34
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduler-Activated Dynamic Page Migrati
Scheduler-Activated Dynamic Page Migration for Multiprogrammed DSM Multiprocessors
โœ Dimitrios S. Nikolopoulos; Constantine D. Polychronopoulos; Theodore S. Papatheo ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 584 KB

The performance of multiprogrammed shared-memory multiprocessors suffers often from scheduler interventions that neglect data locality. On cachecoherent distributed shared-memory (DSM) multiprocessors, such scheduler interventions tend to increase the rate of remote memory accesses. This paper prese

Scalable scheduling for symmetric multip
Scalable scheduling for symmetric multiprocessors (SMP)
โœ Oh-Han Kang; Dharma P. Agrawal ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 737 KB

We present a task duplication-based scalable scheduling algorithm for Symmetric Multiprocessors (SMP), called S3MP (Scalable Scheduling for SMP), to address the problem of task scheduling. The algorithm pre-allocates network communication resources so as to avoid potential communication conflicts, a

Scheduling algorithm for nonpreemptive m
Scheduling algorithm for nonpreemptive multiprocessor tasks
โœ J.-F. Lin; S.-J. Chen ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 619 KB

This paper considers the problem of scheduling nonpreemptive multiprocessor tasks in a homogeneous system of processors. The problem proposed in this paper is different from the conventional scheduling problem, where each task requires only "one" processor whenever it is in processing. In our multip