657 search results - page 18 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
108
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
111
Voted
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
Power management has become popular in mobile computing as well as in server farms. Although a lot of work has been done to manage the energy consumption on uniprocessor real-time...
139
click to vote
TVLSI
2010
14 years 6 months ago
2010
With the shrinking of technology feature sizes, the share of leakage in total power consumption of digital systems continues to grow. Traditional dynamic voltage scaling (DVS) fail...
ICCCN
2007
IEEE
15 years 6 months ago
2007
IEEE
In the past decade cluster computing platforms have been widely applied to support a variety of scientific and commercial applications, many of which are parallel in nature. Howev...
EOR
2007
14 years 11 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...