99 search results - page 12 / 20 » Online Scheduling with Bounded Migration |
112
click to vote
RTSS
2005
IEEE
15 years 7 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
115
Voted
EUC
2004
Springer
15 years 7 months ago
2004
Springer
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution beha...
135
Voted
RANDOM
1998
Springer
15 years 6 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
103
Voted
IEEEPACT
1998
IEEE
15 years 6 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
110
click to vote
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...