Sciweavers

215 search results - page 21 / 43
» Earliest Deadline Scheduling for Real-Time Database Systems
Sort
View
TPDS
2008
106views more  TPDS 2008»
13 years 7 months ago
Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters
Security is increasingly becoming an important issue in the design of real-time parallel applications, which are widely used in the industry and academic organizations. However, ex...
Tao Xie 0004, Xiao Qin
RTSS
2007
IEEE
14 years 1 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns
SUTC
2008
IEEE
14 years 1 months ago
Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms
In this paper, we address the power-aware scheduling of sporadic constrained-deadline hard real-time tasks using dynamic voltage scaling upon multiprocessor platforms. We propose ...
Vincent Nélis, Joël Goossens, Raymond ...
SODA
2010
ACM
219views Algorithms» more  SODA 2010»
14 years 4 months ago
Algorithms and Complexity for Periodic Real-Time Scheduling
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...
ISORC
2000
IEEE
13 years 11 months ago
Scheduling Solutions for Supporting Dependable Real-Time Applications
This paper deals with tolerance to timing faults in time-constrained systems. TAFT (Time Aware Fault-Tolerant) is a recently devised approach which applies tolerance to timing vio...
F. Sandrini, Felicita Di Giandomenico, Andrea Bond...