Sciweavers

85 search results - page 2 / 17
» Limited Preemption in Real-Time Scheduling
Sort
View
RTCSA
2007
IEEE
14 years 1 months ago
Real-Time Scheduling with Task Splitting on Multiprocessors
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...
Shinpei Kato, Nobuyuki Yamasaki
RTSS
1998
IEEE
13 years 11 months ago
Efficient Object Sharing in Quantum-Based Real-Time Systems
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum...
James H. Anderson, Rohit Jain, Kevin Jeffay
ETFA
2006
IEEE
13 years 10 months ago
Non-Schedulability Conditions for Off-line Scheduling of Real-Time Systems Subject to Precedence and Strict Periodicity Constrai
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
Patrick Meumeu Yomsi, Yves Sorel
ICPADS
2006
IEEE
14 years 1 months ago
Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Algorithms
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
Aaron Block, James H. Anderson
ECRTS
2010
IEEE
13 years 8 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...