2015
DOI: 10.1007/978-3-319-27221-4_9
|View full text |Cite
|
Sign up to set email alerts
|

TETS: A Genetic-Based Scheduler in Cloud Computing to Decrease Energy and Makespan

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 29 publications
(12 citation statements)
references
References 10 publications
0
12
0
Order By: Relevance
“…Owing to large solution space, scheduling is categorized as an NP-hard problem, and consequently, it needs time for finding an optimal answer. In general, the task scheduling problem could be regarded and modeled as a version of the Traveling Salesman Problem (TSP) [8,9] or Vehicle Routing Problem (VRP) [10,11]. In the TSP, a salesman must travel through all the cities and return to the city of origin, provided that it passes through the city once and travels the shortest distance [8].…”
Section: Introductionmentioning
confidence: 99%
“…Owing to large solution space, scheduling is categorized as an NP-hard problem, and consequently, it needs time for finding an optimal answer. In general, the task scheduling problem could be regarded and modeled as a version of the Traveling Salesman Problem (TSP) [8,9] or Vehicle Routing Problem (VRP) [10,11]. In the TSP, a salesman must travel through all the cities and return to the city of origin, provided that it passes through the city once and travels the shortest distance [8].…”
Section: Introductionmentioning
confidence: 99%
“…Load balancing is should be able to distribute the load in a balanced form to all the VMs, hence reducing the makespan. Works (Soni and Kalra 2014;Xu et al 2016;Li and Zhang 2016;Abazari et al 2018;Juarez et al 2018;Shojafar et al 2016) focus on makespan reduction using different methods. Papers (Birje et al 2012;Buyya et al 2008;Achar and Thilagam 2014;Goudar et al 2017;Birje et al 2014) discuss the different strategies based on game theory for developing a pricing model.…”
Section: Related Workmentioning
confidence: 99%
“…Thus an optimal scheduling algorithm must involve job prioritization and choose the optimal processor in such a manner that manufacturing time and energy usage is decreased. This paper [6] explains two steps in process algorithm for scheduling named as TETS in which the starting step includes prioritizing job and second includes processor allocation. There are three prioritization procedures to prioritize jobs to produce best starting chromosomes and allocating jobs to processors.…”
Section: Types Of Load Balancing Algorithmsmentioning
confidence: 99%