✦ LIBER ✦

Optimal virtual cluster-based multiprocessor scheduling

✍ Scribed by Arvind Easwaran; Insik Shin; Insup Lee

Book ID: 106545802
Publisher: Springer US
Year: 2009
Tongue: English
Weight: 986 KB
Volume: 43
Category: Article
ISSN: 0922-6443
DOI: 10.1007/s11241-009-9073-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Memory Conscious Scheduling for Cluster-

Memory Conscious Scheduling for Cluster-based NUMA Multiprocessors

✍ Takahiro Koita; Tetsuro Katayama; Keizo Saisho; Akira Fukuda 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 170 KB

An Optimal Multiprocessor Real-Time Sche

An Optimal Multiprocessor Real-Time Scheduling Algorithm

✍ Ashok Khemka; R.K. Shyamasundar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisfies certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of proc

Multiprocessor scheduling by generalized

Multiprocessor scheduling by generalized extremal optimization

✍ Piotr Switalski; Franciszek Seredynski 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 765 KB

Slack-based multiprocessor scheduling of

Slack-based multiprocessor scheduling of aperiodic real-time tasks

✍ Lars Lundberg 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 845 KB

Parallel Processing of Robot Dynamics Si

Parallel Processing of Robot Dynamics Simulation Using Optimal Multiprocessor Scheduling Algorithms

✍ Hironori Kasahara; Masahiko Iwata; Seinosuke Narita; Hirofumi Fujii 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 695 KB

Deadline-based scheduling of periodic ta

Deadline-based scheduling of periodic task systems on multiprocessors

✍ Anand Srinivasan; Sanjoy Baruah 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 71 KB

We consider the problem of scheduling periodic task systems on multiprocessors and present a deadline-based scheduling algorithm for solving this problem. We show that our algorithm successfully schedules on m processors any periodic task system with utilization at most m 2 /(2m -1).