Sciweavers

130 search results - page 22 / 26
» Algorithms and Complexity for Periodic Real-Time Scheduling
Sort
View
ICTAI
1993
IEEE
15 years 1 months ago
Short Term Unit-Commitment Using Genetic Algorithms
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
Dipankar Dasgupta, Douglas R. McGregor
ECRTS
2010
IEEE
14 years 9 months ago
The Demand Bound Function Interface of Distributed Sporadic Pipelines of Tasks Scheduled by EDF
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
Nicola Serreli, Giuseppe Lipari, Enrico Bini
AAAI
2007
14 years 11 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
ICCAD
1995
IEEE
135views Hardware» more  ICCAD 1995»
15 years 1 months ago
An iterative improvement algorithm for low power data path synthesis
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
Anand Raghunathan, Niraj K. Jha
SIGMETRICS
2009
ACM
103views Hardware» more  SIGMETRICS 2009»
15 years 4 months ago
Restrained utilization of idleness for transparent scheduling of background tasks
A common practice in system design is to treat features intended to enhance performance and reliability as low priority tasks by scheduling them during idle periods, with the goal...
Ningfang Mi, Alma Riska, Xin Li, Evgenia Smirni, E...