Sciweavers

15 search results - page 2 / 3
» Real-Time Schedulability Tests for Preemptive Multitasking
Sort
View
ECRTS
2005
IEEE
13 years 11 months ago
Non-Preemptive Interrupt Scheduling for Safe Reuse of Legacy Drivers in Real-Time Systems
Low-level support of peripheral devices is one of the most demanding activities in a real-time operating system. In fact, the rapid development of new interface boards causes a tr...
Tullio Facchinetti, Giorgio C. Buttazzo, Mauro Mar...
RTSS
2006
IEEE
13 years 11 months ago
LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers
We present a real-time, Linux-based testbed called LITMUSRT , which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present th...
John M. Calandrino, Hennadiy Leontyev, Aaron Block...
RTAS
2010
IEEE
13 years 4 months ago
DARTS: Techniques and Tools for Predictably Fast Memory Using Integrated Data Allocation and Real-Time Task Scheduling
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
Sangyeol Kang, Alexander G. Dean
RTSS
2000
IEEE
13 years 10 months ago
Scalable Real-Time System Design using Preemption Thresholds
The maturity of schedulabilty analysis techniquesfor fired-prioritypreemptive scheduling has enabled the consideration of timing issues at design time using a specification of the...
Manas Saksena, Yun Wang
SODA
2010
ACM
219views Algorithms» more  SODA 2010»
14 years 3 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...