Sciweavers

456 search results - page 15 / 92
» Alternative priority scheduling in dynamic priority systems
Sort
View
RTCSA
2008
IEEE
14 years 1 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
RTCSA
2009
IEEE
14 years 2 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
14 years 1 months ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
RTSS
1990
IEEE
13 years 11 months ago
Concurrency Control in Real-Time Databases by Dynamic Adjustment of Serialization Order
Time-critical scheduling in real-time database systems has two components: real-time transaction scheduling,which is related to task scheduling in realtime operating systems, and ...
Yi Lin, Sang Hyuk Son
ECRTS
2006
IEEE
14 years 1 months ago
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
Nathan Fisher, Sanjoy K. Baruah, Theodore P. Baker