320 search results - page 34 / 64 » Open problems in real-time scheduling |
148
click to vote
IWOMP
2009
Springer
15 years 10 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
141
click to vote
DAC
2010
ACM
15 years 8 months ago
2010
ACM
With the ever-increasing transistor variability in CMOS technology, it is essential to integrate variation-aware performance analysis into the task allocation and scheduling proce...
125
click to vote
IEAAIE
2001
Springer
15 years 8 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
146
click to vote
DAC
2011
ACM
14 years 4 months ago
2011
ACM
We present ChronOS Linux, a best-effort real-time Linux kernel for chip multiprocessors (CMPs). ChronOS addresses the intersection of three problem spaces: a) OS-support for obta...
146
click to vote
DISOPT
2006
15 years 4 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...