Sciweavers

38 search results - page 5 / 8
» Fault-Tolerant Rate-Monotonic Scheduling Algorithm in Unipro...
Sort
View
ECRTS
2000
IEEE
13 years 12 months ago
Tolerating faults while maximizing reward
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
JCP
2008
155views more  JCP 2008»
13 years 7 months ago
Algorithm to Optimize Code Size and Energy Consumption in Real Time Embedded System
Processor is an important computing element in portable battery operated real time embedded system and it consumes most of the battery energy. Energy consumption, processor memory ...
Santosh D. Chede, Kishore D. Kulat
CODES
2011
IEEE
12 years 7 months ago
Analysis and optimization of fault-tolerant task scheduling on multiprocessor embedded systems
Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are ...
Jia Huang, Jan Olaf Blech, Andreas Raabe, Christia...
RTAS
2008
IEEE
14 years 1 months ago
Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...
Sanjoy K. Baruah, Nathan Fisher
IPPS
2003
IEEE
14 years 22 days 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...