936 search results - page 75 / 188 » Task Graph Scheduling Using Timed Automata |
120
click to vote
RTSS
2007
IEEE
15 years 7 months ago
2007
IEEE
Schedulability analysis is a cornerstone of modern real-time scheduling theory development. Utilizationbound based schedulability test is considered one of most efficient and effe...
121
click to vote
ISORC
2002
IEEE
15 years 6 months ago
2002
IEEE
Preemption threshold scheduling (PTS) provides prominent benefits for fixed priority scheduling such as increased schedulability, reduced context switches, and decreased memory re...
135
click to vote
RTAS
2006
IEEE
15 years 7 months ago
2006
IEEE
Multicore architectures, which have multiple processing units on a single chip, are widely viewed as a way to achieve higher processor performance, given that thermal and power pr...
117
click to vote
RTAS
2010
IEEE
14 years 12 months ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
108
click to vote
SIGMETRICS
1998
ACM
15 years 5 months ago
1998
ACM
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...