Sciweavers

85 search results - page 9 / 17
» Limited Preemption in Real-Time Scheduling
Sort
View
RTAS
1998
IEEE
13 years 11 months ago
Managing Memory Requirements in the Synthesis of Real-Time Systems from Processing Graphs
In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems...
Steve Goddard, Kevin Jeffay
RTSS
2005
IEEE
14 years 19 days ago
ParaScale: Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
Sibin Mohan, Frank Mueller, William Hawkins, Micha...
IEEEARES
2008
IEEE
14 years 1 months ago
RTQG: Real-Time Quorum-based Gossip Protocol for Unreliable Networks
We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B....
Bo Zhang, Kai Han, Binoy Ravindran, E. Douglas Jen...
RTAS
2008
IEEE
14 years 1 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
RTAS
2005
IEEE
14 years 19 days ago
Hybrid Supervisory Utilization Control of Real-Time Systems
Feedback control real-time scheduling (FCS) aims at satisfying performance specifications of real-time systems based on adaptive resource management. Existing FCS algorithms often...
Xenofon D. Koutsoukos, Radhika Tekumalla, Balachan...