2013
DOI: 10.1007/s00224-013-9477-9
|View full text |Cite
|
Sign up to set email alerts
|

The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
38
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(39 citation statements)
references
References 17 publications
1
38
0
Order By: Relevance
“…An extension to manage temperature is proposed in [16] and more realistic models of bounded speed processors have been considered in [17] and [18]. Approaches combining both speed scaling and sleep state energy-efficient deadline scheduling [20], or addressing multiprocessor scheduling without migration [19] have also been proposed.…”
Section: B2 Deadline Schedulingmentioning
confidence: 99%
“…An extension to manage temperature is proposed in [16] and more realistic models of bounded speed processors have been considered in [17] and [18]. Approaches combining both speed scaling and sleep state energy-efficient deadline scheduling [20], or addressing multiprocessor scheduling without migration [19] have also been proposed.…”
Section: B2 Deadline Schedulingmentioning
confidence: 99%
“…Note that, the ratio of this algorithm is constant because α is a constant. For the more general problem in which the jobs have arbitrary works, Greiner et al (2009) established a generic reduction transforming a ρapproximation algorithm for the single-processor problem to a ρ B α -approximation algorithm for the multiprocessor non-migratory problem, where B α is the α -th Bell number. This result basically implies a constant factor approximation algorithm for the multiprocessor non-migratory problem with arbitrary works.…”
Section: Single Processormentioning
confidence: 99%
“…Due to approximate proportionality between the power consumption and the supply frequency/voltage of different hardware components, the goal is to find an optimal dynamic allocation of frequency/ voltage resources which will minimize the overall power consumption and ensure predefined performance. Vast research results related to the improvement of DC energy efficiency by implementing DFVS management according to individual servers computing and traffic load variations have been presented [82,83,84,85,86,87,88,89,90,91,92,93,94]. Additionally, research efforts on the level of energy-efficiency improvements of the large-scale server′s warehouse through the implementation of DFVS are analysed in [37,95,96].…”
Section: Research Challenges For Improvements Of Data Centres Enermentioning
confidence: 99%