407 search results - page 41 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
DAC
2005
ACM
16 years 24 days ago
2005
ACM
This paper presents an optimal procrastinating voltage scheduling (OP-DVS) for hard real-time systems using stochastic workload information. Algorithms are presented for both sing...
ISPD
1998
ACM
15 years 4 months ago
1998
ACM
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...
139
click to vote
CGO
2003
IEEE
15 years 5 months ago
2003
IEEE
As current trends in software development move toward more complex object-oriented programming, inlining has become a vital optimization that provides substantial performance impr...
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
103
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...