2019
DOI: 10.3390/app9071467
|View full text |Cite
|
Sign up to set email alerts
|

Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function

Abstract: Efficient job scheduling reduces energy consumption and enhances the performance of machines in data centers and battery-based computing devices. Practically important online non-clairvoyant job scheduling is studied less extensively than other algorithms. In this paper, an online non-clairvoyant scheduling algorithm Highest Scaled Importance First (HSIF) is proposed, where HSIF selects an active job with the highest scaled importance. The objective considered is to minimize the scaled importance based flow ti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 29 publications
(8 citation statements)
references
References 31 publications
1
7
0
Order By: Relevance
“…The experimental results show the good performance of the proposed model. Furthermore, in [100], the online non-clairvoyant scheduling algorithm Highest Scaled Importance First (HSIF) method was proposed, in which HSIF chooses an active job with the highest scaled importance to minimize the sum of scaled importance-based flow time and energy consumed. The use of HSIF in data centers and battery-based devices reduces power consumption and improves computing capability.…”
Section: Solutions At Host Levelmentioning
confidence: 99%
See 1 more Smart Citation
“…The experimental results show the good performance of the proposed model. Furthermore, in [100], the online non-clairvoyant scheduling algorithm Highest Scaled Importance First (HSIF) method was proposed, in which HSIF chooses an active job with the highest scaled importance to minimize the sum of scaled importance-based flow time and energy consumed. The use of HSIF in data centers and battery-based devices reduces power consumption and improves computing capability.…”
Section: Solutions At Host Levelmentioning
confidence: 99%
“…The techniques to solve the virtual machines and hypervisor issues are intrusion detection and VM monitoring These techniques were limited their techniques to specific scenarios, known patterns of attacks or even specific software Techniques need more focus on other types of attacks such as distributed side-channel attacks while designing their detecting or preventing techniques [8,35,[90][91][92][93][94][95][96][97][98][99][100][101][102]…”
Section: Host Levelmentioning
confidence: 99%
“…Singh et al [13] considered task scheduling for data centers by considering process time flow in order to minimize the overall energy consumed by the data center. The work presented an interesting power model, but the focus of the work was to minimize overall energy, not constrain peak current.…”
Section: Introductionmentioning
confidence: 99%
“…The competitiveness of MBS is the least to date.critical circumstances, the current issue in the scheduling is to attain the good quality of service by generating an optimal schedule of jobs and to save the energy consumption, which is a conflicting and complicated problem [5].The power P consumed by a processor running at speed s is sV 2 , where V is a voltage [6]. The traditional power function is P = s α (α ≥ 2 for CMOS based chips [7,8]). There are two types of speed models: the first unbounded speed model, in which the processor's speed range is, i.e., [0, ∞); the second bounded speed model, in which the speed of a processor can range from zero to some maximum speed, i.e., [0, η].…”
mentioning
confidence: 99%
“…The power P consumed by a processor running at speed s is sV 2 , where V is a voltage [6]. The traditional power function is P = s α (α ≥ 2 for CMOS based chips [7,8]). There are two types of speed models: the first unbounded speed model, in which the processor's speed range is, i.e., [0, ∞); the second bounded speed model, in which the speed of a processor can range from zero to some maximum speed, i.e., [0, η].…”
mentioning
confidence: 99%