J. R. Lorch and A. J. Smith. PACE: a new approach to dynamic voltage scaling. Technical Report UCB/CSD-01-1136, Computer Science Division, EECS, University of California at Berkeley, March 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Improving Dynamic Voltage Scaling Algorithms with PACE - Lorch, Smith (2001) (46 citations) Self-citation (Lorch Smith) (Correct)
No context found.
J. R. Lorch and A. J. Smith. PACE: a new approach to dynamic voltage scaling. Technical Report UCB/CSD-01-1136, Computer Science Division, EECS, University of California at Berkeley, March 2001.
Improving Dynamic Voltage Scaling Algorithms with PACE - Lorch, Smith (2001) (46 citations) Self-citation (Lorch Smith) (Correct)
....occurs when all the val ues are the same. In other words, we want [Fe(w) a s(w) to be as constant as possible. We achieve this by making s(w) be the valid speed closest to C [F(w) a, where C is a constant chosen to satisfy the deadline constraint. For a full proof that this works, see [ 14]. Since F c (w) decreases as w increases, this schedule speeds up the CPU as the task progresses, as noted earlier. Given any scheduling algorithm, it is worthwhile to replace its pre deadline part with this optimal formula. In this way, we reduce the expected energy consumption without affecting ....
....to C(Fs ) x s, where Fs is the average value of F over that interval. As before, C is constant over the entire schedule; we choose a value for it that meets the deadline constraint. The ratio nale is similar to that for the continuous optimal speed schedule; for a full proof that this works, see [14]. We also need to choose a good sequence of N transition points. We want the optimal schedule to vary little between any two consecutive transition points, so that keeping the speed constam between those points approximates the optimal schedule. We proceed as follows. For each integer j, define ....
[Article contains additional citation context not shown here]
J.R. Lorch and A. J. Smith. PACE: a new approach to dynamic voltage scaling. Technical Report UCB/CSD-01-1136, Computer Science Division, EECS, University of California at Berkeley, March 2001.
Improving Dynamic Voltage Scaling Algorithms with PACE - Lorch, Smith (2001) (46 citations) Self-citation (Lorch Smith) (Correct)
....when all the values are the same. In other words, we want [F c (w) 1=3 =s(w) to be as constant as possible. We achieve this by making s(w) be the valid speed closest to C[F c (w) 1=3 , where C is a constant chosen to satisfy the deadline constraint. For a full proof that this works, see [14]. Since F c (w) decreases as w increases, this schedule speeds up the CPU as the task progresses, as noted earlier. Given any scheduling algorithm, it is worthwhile to replace its pre deadline part with this optimal formula. In this way, we reduce the expected energy consumption without ....
....1=3 , where F c avg is the average value of F c over that interval. As before, C is constant over the entire schedule; we choose a value for it that meets the deadline constraint. The rationale is similar to that for the continuous optimal speed schedule; for a full proof that this works, see [14]. We also need to choose a good sequence of N transition points. We want the optimal schedule to vary little between any two consecutive transition points, so that keeping the speed constant between those points approximates the optimal schedule. We proceed as follows. For each integer j, ....
[Article contains additional citation context not shown here]
J. R. Lorch and A. J. Smith. PACE: a new approach to dynamic voltage scaling. Technical Report UCB/CSD-01-1136, Computer Science Division, EECS, University of California at Berkeley, March 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC