Sciweavers

457 search results - page 14 / 92
» Decay-Usage Scheduling in Multiprocessors
Sort
View
IPPS
2003
IEEE
14 years 1 months ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...
PRDC
2006
IEEE
14 years 2 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
DSN
2000
IEEE
14 years 1 months ago
Fault-Secure Scheduling of Arbitrary Task Graphs to Multiprocessor Systems
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
Koji Hashimoto, Tatsuhiro Tsuchiya, Tohru Kikuno
ICALP
2010
Springer
14 years 13 days ago
Scalably Scheduling Power-Heterogeneous Processors
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted ...
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
SUTC
2006
IEEE
14 years 2 months ago
Slack Reclamation for Real-Time Task Scheduling over Dynamic Voltage Scaling Multiprocessors
In the past decades, a number of research results have been reported for energy-efficient task scheduling over uniprocessor and multiprocessor environments. While researchers hav...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo