Results 1  10
of
12
A.: The bell is ringing in speedscaled multiprocessor scheduling
 In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA
, 2009
"... This paper investigates the problem of scheduling jobs on multiple speedscaled processors without migration, i.e., we have constant α> 1 such that running a processor at speed s results in energy consumption s α per time unit. We consider the general case where each job has a monotonously increas ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
(Show Context)
This paper investigates the problem of scheduling jobs on multiple speedscaled processors without migration, i.e., we have constant α> 1 such that running a processor at speed s results in energy consumption s α per time unit. We consider the general case where each job has a monotonously increasing cost function that penalizes delay. This includes the so far considered cases of deadlines and flow time. For any type of delay cost functions, we obtain the following results: Any βapproximation algorithm for a single processor yields a randomized βBαapproximation algorithm for multiple processors without migration, where Bα is the αth Bell number, that is, the number of partitions of a set of size α. Analogously, we show that any βcompetitive online algorithm for a single processor yields a βBαcompetitive online algorithm for multiple processors without migration. Finally, we show that any βapproximation algorithm for multiple processors with migration yields a deterministic βBαapproximation algorithm for multiple processors without migration. These facts improve several approximation ratios and lead to new results. For instance, we obtain the first constant factor online and offline approximation algorithm for multiple processors without migration for arbitrary release times, deadlines, and job sizes.
A Tutorial on Amortized Local Competitiveness in Online Scheduling
, 2011
"... potential functions are used to show that a particular online algorithm is locally competitive in an amortized sense. Algorithm analyses using potential functions are sometimes criticized as seeming to be black magic ..."
Abstract

Cited by 16 (14 self)
 Add to MetaCart
(Show Context)
potential functions are used to show that a particular online algorithm is locally competitive in an amortized sense. Algorithm analyses using potential functions are sometimes criticized as seeming to be black magic
Algorithms for dynamic speed scaling
 In STACS 2011, volume 9 of LIPIcs. Schloss Dagstuhl  LeibnizZentrum fuer Informatik
, 2011
"... Many modern microprocessors allow the speed/frequency to be set dynamically. The general goal is to execute a sequence of jobs on a variablespeed processor so as to minimize energy consumption. This paper surveys algorithmic results on dynamic speed scaling. We address settings where (1) jobs have ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Many modern microprocessors allow the speed/frequency to be set dynamically. The general goal is to execute a sequence of jobs on a variablespeed processor so as to minimize energy consumption. This paper surveys algorithmic results on dynamic speed scaling. We address settings where (1) jobs have strict deadlines and (2) job flow times are to be minimized.
Algorithms for Energy Saving
, 2010
"... Energy has become a scarce and expensive resource. There is a growing awareness in society that energy saving is a critical issue. This paper surveys algorithmic solutions to reduce energy consumption in computing environments. We focus on the system and device level. More specifically, we study po ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Energy has become a scarce and expensive resource. There is a growing awareness in society that energy saving is a critical issue. This paper surveys algorithmic solutions to reduce energy consumption in computing environments. We focus on the system and device level. More specifically, we study powerdown mechanisms as well as dynamic speed scaling techniques in modern microprocessors.
Energy Efficient Scheduling of Parallelizable Jobs
"... In this paper, we consider scheduling parallelizable jobs in the nonclairvoyant speed scaling setting to minimize the objective of weighted flow time plus energy. Previously, strong lower bounds were shown on this model in the unweighted setting even when the algorithm is given a constant amount of ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper, we consider scheduling parallelizable jobs in the nonclairvoyant speed scaling setting to minimize the objective of weighted flow time plus energy. Previously, strong lower bounds were shown on this model in the unweighted setting even when the algorithm is given a constant amount of resource augmentation over the optimal solution. However, these lower bounds were given only for certain families of algorithms that do not recognize the parallelizability of alive jobs. In this work, we circumvent previous lower bounds shown and give a scalable algorithm under the natural assumption that the algorithm can know the current parallelizability of a job. When a general power function is considered, this is also the first algorithm that has a constant competitive ratio for the problem using any amount of resource augmentation. 1
EnergyEfficient Algorithms  Algorithmic solutions can help reduce energy consumption in computing environs
, 2010
"... ..."
Throughput maximization for speedscaling with agreeable deadlines
 In Proc. 10th International Conference Theory and Applications of Models of Computation (TAMC), volume 7876 of LNCS
, 2013
"... ..."
(Show Context)
Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines
"... Energy consumption has become an important concern in the design of modern processors, not only for batteryoperated mobile devices with single processors but also for server farms or laptops with multicore processors. A popular technology to reduce energy usage is dynamic speed scaling (see e.g., ..."
Abstract
 Add to MetaCart
Energy consumption has become an important concern in the design of modern processors, not only for batteryoperated mobile devices with single processors but also for server farms or laptops with multicore processors. A popular technology to reduce energy usage is dynamic speed scaling (see e.g., [1, 2, 3, 6]) where the processor can vary its speed dynamically. The power consumption