Sciweavers

215 search results - page 33 / 43
» Earliest Deadline Scheduling for Real-Time Database Systems
Sort
View
RTCSA
2008
IEEE
14 years 1 months ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel
VLDB
1991
ACM
185views Database» more  VLDB 1991»
13 years 11 months ago
Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes
Due to its potential for a high degree of parallelism, optimistic concurrency control is expected to perform better than two-phase locking when integrated with priority-driven CPU...
Jiandong Huang, John A. Stankovic, Krithi Ramamrit...
IPPS
2006
IEEE
14 years 1 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
RTCSA
2006
IEEE
14 years 1 months ago
Instruction Scheduling with Release Times and Deadlines on ILP Processors
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
Hui Wu, Joxan Jaffar, Jingling Xue
RTCSA
2006
IEEE
14 years 1 months ago
Computing the Minimum EDF Feasible Deadline in Periodic Systems
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
Hoai Hoang, Giorgio C. Buttazzo, Magnus Jonsson, S...