2019
DOI: 10.1016/j.procs.2019.05.044
|View full text |Cite
|
Sign up to set email alerts
|

Self-characteristics based Energy-Efficient Resource Scheduling for Cloud

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 23 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…The following restrictions are placed on the model: Constrained processing allocation by eqn (14) 𝛼𝑋 π‘˜π‘› β‰₯ 𝛿 π‘˜π‘› βˆ€π‘˜ ∈ 𝐾, 𝑛 ∈ 𝑃𝑁 𝑋 π‘˜π‘›π‘› ≀ 𝛼𝛿 π‘˜π‘› βˆ€π‘˜ ∈ 𝐾, 𝑛 ∈ 𝑃𝑁 βˆ‘ π‘›βˆˆπ‘ƒπ‘ 𝛿 π‘˜π‘› = 1 βˆ€π‘˜ ∈ 𝐾 (14) assures that one processing node will be given to each of the task k tasks. Constrained processing node capacity by eqn (15) βˆ‘ π‘˜βˆˆπΎ 𝑋 π‘˜π‘‘ ≀ 𝐢 𝑛𝑑 βˆ€π‘› ∈ 𝑃𝑁 (15) Every task k given to a processing node n does not go above that node's processing limit.…”
Section: Virtual Machine Based Markov Model Infused Wavelength Divisi...mentioning
confidence: 99%
See 1 more Smart Citation
“…The following restrictions are placed on the model: Constrained processing allocation by eqn (14) 𝛼𝑋 π‘˜π‘› β‰₯ 𝛿 π‘˜π‘› βˆ€π‘˜ ∈ 𝐾, 𝑛 ∈ 𝑃𝑁 𝑋 π‘˜π‘›π‘› ≀ 𝛼𝛿 π‘˜π‘› βˆ€π‘˜ ∈ 𝐾, 𝑛 ∈ 𝑃𝑁 βˆ‘ π‘›βˆˆπ‘ƒπ‘ 𝛿 π‘˜π‘› = 1 βˆ€π‘˜ ∈ 𝐾 (14) assures that one processing node will be given to each of the task k tasks. Constrained processing node capacity by eqn (15) βˆ‘ π‘˜βˆˆπΎ 𝑋 π‘˜π‘‘ ≀ 𝐢 𝑛𝑑 βˆ€π‘› ∈ 𝑃𝑁 (15) Every task k given to a processing node n does not go above that node's processing limit.…”
Section: Virtual Machine Based Markov Model Infused Wavelength Divisi...mentioning
confidence: 99%
“…In work [13], a dynamic scheduling technique for context-aware, SOA-based applications' response time SLA was developed. In order to prevent overtaxing the service tier resources as measured by a SLA metric, the developers of [14] have suggested rate-limiting requests. In their study [15], the authors devised a dynamic scheduling technique that can ensure SLAs for CPU service share in server clusters.…”
Section: Introductionmentioning
confidence: 99%
“…Integrating Equation (18) with the historical data, the state transition probability matrix P can be finally acquired.…”
Section: B State Transition Probability Matrix Derivationmentioning
confidence: 99%
“…Moreover, for the resource scheduling and without violating the SLA protocol, a multi-objective task scheduling algorithm was applied to improve the data centre throughput and reduce the data center cost [13]. In addition, Juarez et al in [14] applied the dynamic energy perception to parallel task scheduling and Bhupesh et al in [18] propose a self-optimized energy efficient resource management strategy, while Alsarhan et al in [15] studied the adaptive allocation and configuration of resources in a multi-service cloud environment. Besides, to balance the workload among all virtual machines with resilient resource provisioning and de-provisioning, one dynamic k-interval based scheduling algorithm was proposed in [16].…”
Section: Introductionmentioning
confidence: 99%
“…To make sure adjustment to non-basic disappointment, tries desirous to purchase a load of masterminded computer instrumentality and a helper uninterruptible power provide device. The target is to stay the crash of key frameworks and systems, concentrating on problems known with up time and period (Dewangan et al, 2019). Adaptation to internal failure is offerprogramming put in instrumentality, or by some mixture of the two.…”
Section: Introductionmentioning
confidence: 99%