Results 1  10
of
102
Algorithms for power savings
 In SODA ’03: Proceedings of the fourteenth annual ACMSIAM symposium on Discrete algorithms
, 2003
"... This paper examines two di erent mechanisms for saving power in batteryoperated embedded systems. The rst is that the system can be placed in a sleep state if it is idle. However, a xed amount of energy is required to bring the system back into an active state in which it can resume work. The secon ..."
Abstract

Cited by 88 (7 self)
 Add to MetaCart
This paper examines two di erent mechanisms for saving power in batteryoperated embedded systems. The rst is that the system can be placed in a sleep state if it is idle. However, a xed amount of energy is required to bring the system back into an active state in which it can resume work. The second way inwhichpower savings can be achieved is by varying the speed at which jobs are run. We utilize a power consumption curve P (s) whichindicates the power consumption level given a particular speed. We assume that P (s) isconvex, nondecreasing and nonnegative for s 0. The problem is to schedule arriving jobs in a way that minimizes total energy use and so that each job is completed after its release time and before its deadline. We assume that all jobs can be preempted and resumed at no cost. Although each problem has been considered separately, this is the rst theoretical analysis of systems that can use both mechanisms. We givean o ine algorithm that is within a factor of two of the optimal algorithm. We alsogivean online algorithm with a constant competitive ratio. 1
EnergyEfficient Algorithms for . . .
, 2007
"... We study scheduling problems in batteryoperated computing devices, aiming at schedules with low total energy consumption. While most of the previous work has focused on finding feasible schedules in deadlinebased settings, in this article we are interested in schedules that guarantee good respons ..."
Abstract

Cited by 59 (2 self)
 Add to MetaCart
We study scheduling problems in batteryoperated computing devices, aiming at schedules with low total energy consumption. While most of the previous work has focused on finding feasible schedules in deadlinebased settings, in this article we are interested in schedules that guarantee good response times. More specifically, our goal is to schedule a sequence of jobs on a variablespeed processor so as to minimize the total cost consisting of the energy consumption and the total flow time of all jobs. We first show that when the amount of work, for any job, may take an arbitrary value, then no online algorithm can achieve a constant competitive ratio. Therefore, most of the article is concerned with unitsize jobs. We devise a deterministic constant competitive online algorithm and show that
Algorithmic problems in power management
 SIGACT News
, 2005
"... We survey recent research that has appeared in the theoretical computer science literature on algorithmic ..."
Abstract

Cited by 54 (3 self)
 Add to MetaCart
We survey recent research that has appeared in the theoretical computer science literature on algorithmic
Getting the Best Response for Your Erg
"... We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an algorithmic approach in which an energy optimal schedule is computed for a huge A, and then the energy optimal schedule ..."
Abstract

Cited by 49 (9 self)
 Add to MetaCart
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an algorithmic approach in which an energy optimal schedule is computed for a huge A, and then the energy optimal schedule is maintained as A decreases. We show that this approach yields an efficient algorithm for equiwork jobs. We note that the energy optimal schedule has the surprising feature that the job speeds are not monotone functions of the available energy. We then explain why this algorithmic approach is problematic for arbitrary work jobs. Finally, we explain how to use the algorithm for equiwork jobs to obtain an algorithm for arbitrary work jobs that is O(1)approximate with respect to average response time, given an additional factor of (1 + ffl)energy.
Poweraware speed scaling in processor sharing systems
 In Proc. of INFOCOM
, 2009
"... Abstract—Energy use of computer communication systems has quickly become a vital design consideration. One effective method for reducing energy consumption is dynamic speed scaling, which adapts the processing speed to the current load. This paper studies how to optimally scale speed to balance mean ..."
Abstract

Cited by 39 (12 self)
 Add to MetaCart
Abstract—Energy use of computer communication systems has quickly become a vital design consideration. One effective method for reducing energy consumption is dynamic speed scaling, which adapts the processing speed to the current load. This paper studies how to optimally scale speed to balance mean response time and mean energy consumption under processor sharing scheduling. Both bounds and asymptotics for the optimal speed scaling scheme are provided. These results show that a simple scheme that halts when the system is idle and uses a static rate while the system is busy provides nearly the same performance as the optimal dynamic speed scaling. However, the results also highlight that dynamic speed scaling provides at least one key benefit — significantly improved robustness to bursty traffic and misestimation of workload parameters. I.
Poweraware scheduling for makespan and flow
 In Proc. SPAA, 2006
, 2006
"... We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give lineartime algorithms to compute all nondominated solutions for the general uniprocessor problem and for the mu ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give lineartime algorithms to compute all nondominated solutions for the general uniprocessor problem and for the multiprocessor problem when every job requires the same amount of work. We also show that the multiprocessor problem becomes NPhard when jobs can require different amounts of work. For total flow, we show that the optimal flow corresponding to a particular energy budget cannot be exactly computed on a machine supporting arithmetic and the extraction of roots. This hardness result holds even when scheduling equalwork jobs on a uniprocessor. We do, however, extend previous work by Pruhs et al. to give an arbitrarilygood approximation for scheduling equalwork jobs on a multiprocessor. 1
Speed Scaling of Tasks with Precedence Constraints
, 2005
"... We consider the problem of speeding scaling to conserve energy in a distributedsetting where there are precedence constraints between tasks, and where the performance measure is the makespan. That is, we consider an energy bounded versionof the classic problem P  prec  Cmax. We show that, without ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
We consider the problem of speeding scaling to conserve energy in a distributedsetting where there are precedence constraints between tasks, and where the performance measure is the makespan. That is, we consider an energy bounded versionof the classic problem P  prec  Cmax. We show that, without loss of generality,one need only consider constant power schedules. We then show how to reduce this problem to the problem Q  prec  Cmax to obtain a polylog(m)approximation algorithm.
Speed Scaling Functions for Flow Time Scheduling based on Active Job Count
"... Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of active jobs, replacing the existing speed scaling functions in the literature that depend on the remaining work of activ ..."
Abstract

Cited by 29 (11 self)
 Add to MetaCart
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of active jobs, replacing the existing speed scaling functions in the literature that depend on the remaining work of active jobs. The new speed functions are more stable and also more efficient. They can support better job selection strategies to improve the competitive ratios of existing algorithms [5,8], and, more importantly, to remove the requirement of extra speed. These functions further distinguish themselves from others as they can readily be used in the nonclairvoyant model (where the size of a job is only known when the job finishes). As a first step, we study the scheduling of batched jobs (i.e., jobs with the same release time) in the nonclairvoyant model and present the first competitive algorithm for minimizing flow time plus energy (as well as for weighted flow time plus energy); the performance is close to optimal. 1
Speed scaling on parallel processors
 In Proc. 19th Annual Symp. on Parallelism in Algorithms and Architectures (SPAA’07
, 2007
"... In this paper we investigate algorithmic instruments leading to low power consumption in computing devices. While previous work on energyefficient algorithms has mostly focused on single processor environments, in this paper we investigate multiprocessor settings. We study the basic problem of sch ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
In this paper we investigate algorithmic instruments leading to low power consumption in computing devices. While previous work on energyefficient algorithms has mostly focused on single processor environments, in this paper we investigate multiprocessor settings. We study the basic problem of scheduling a set of jobs, each specified by a release time, a deadline and a processing volume, on variable speed processors so as to minimize the total energy consumption. We first settle the complexity of speed scaling with unit size jobs. More specifically, we devise a polynomial time algorithm for agreeable deadlines and prove NPhardness results for arbitrary release dates and deadlines. For the latter setting we also develop a polynomial time algorithm achieving a constant factor approximation guarantee that is independent of the number of processors. Additionally, we study speed scaling of jobs with arbitrary processing requirements and, again, develop constant factor approximation algorithms. We finally transform our offline algorithms into constant competitive online strategies.
Energy efficient online deadline scheduling
 In Proc. SODA
, 2007
"... Abstract. This paper extends the study of online algorithms for energyefficient deadline scheduling to the overloaded setting. Specifically, we consider a processor that can vary its speed between 0 and a maximum speed T to minimize its energy usage (of which the rate is roughly a cubic function of ..."
Abstract

Cited by 21 (12 self)
 Add to MetaCart
Abstract. This paper extends the study of online algorithms for energyefficient deadline scheduling to the overloaded setting. Specifically, we consider a processor that can vary its speed between 0 and a maximum speed T to minimize its energy usage (of which the rate is roughly a cubic function of the speed). As the speed is upper bounded, the system may be overloaded with jobs and no scheduling algorithms can meet the deadlines of all jobs. An optimal schedule is expected to maximize the throughput, and furthermore, its energy usage should be the smallest among all schedules that achieve the maximum throughput. In designing a scheduling algorithm, one has to face the dilemma of selecting more jobs and being conservative in energy usage. Even if we ignore energy usage, the best possible online algorithm is 4competitive on throughput [12]. On the other hand, existing work on energyefficient scheduling focuses on minimizing the energy to complete all jobs on a processor with unbounded speed, giving several O(1)competitive algorithms with respect to the energy usage [2,20]. This paper presents the first online algorithm for the more realistic setting where processor speed is bounded and the system may be overloaded; the algorithm is O(1)competitive on both throughput and energy usage. If the maximum speed of the online scheduler is relaxed slightly to (1+ǫ)T for some ǫ> 0, we can improve the competitive ratio on throughput to arbitrarily close to one, while maintaining O(1)competitive on energy usage. 1