456 search results - page 15 / 92 » Alternative priority scheduling in dynamic priority systems |
144
click to vote
RTCSA
2008
IEEE
15 years 10 months ago
2008
IEEE
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 ...
146
click to vote
RTCSA
2009
IEEE
15 years 11 months ago
2009
IEEE
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...
106
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
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...
149
click to vote
RTSS
1990
IEEE
15 years 8 months ago
1990
IEEE
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 ...
142
click to vote
ECRTS
2006
IEEE
15 years 10 months ago
2006
IEEE
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...