2012 Third International Conference on Emerging Applications of Information Technology 2012
DOI: 10.1109/eait.2012.6407881
|View full text |Cite
|
Sign up to set email alerts
|

Optimal scheduling of computational task in cloud using Virtual Machine Tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 24 publications
(7 citation statements)
references
References 5 publications
0
7
0
Order By: Relevance
“…At runtime broker decides mapping of task to a VM. Sometimes single tasks with multiple users [3] are mapped to VM and sometimes from a group of task a particular task is picked up for the allocation of VM depending upon the execution time and arrival time [6,7,9,12,16]. The tasks in the group is selected sequentially and submitted to the Virtual Machine.…”
Section: Related Workmentioning
confidence: 99%
“…At runtime broker decides mapping of task to a VM. Sometimes single tasks with multiple users [3] are mapped to VM and sometimes from a group of task a particular task is picked up for the allocation of VM depending upon the execution time and arrival time [6,7,9,12,16]. The tasks in the group is selected sequentially and submitted to the Virtual Machine.…”
Section: Related Workmentioning
confidence: 99%
“…The end goal of the VM scheduling is always be the maximum utilization of VMs resources with minimum incurred cost. Hence, efficient VM scheduling is always remains the key concern of cloud providers, and considered to be a primary feature of cloud computing [8,9].…”
Section: Virtual Machine Scheduling Problemmentioning
confidence: 99%
“…Where (7) the cost divisor Õ® (Si) to reach load balancing S'I is expressed as (8) IV. METAHEURISTIC APPROACH FOR VM SCHEDULING PROBLEM Considering the system variation and historical data as a significant aspect of load balancing within the dynamic cloud environment, the authors in [12] develop an innovative technique by improving genetic algorithm for solving scheduling problem.…”
Section: ) Mathematical Modelmentioning
confidence: 99%
“…Similar work is done in [17,18,19] where scheduling is done in order to reduce execution time and arrival time. Authors in [20] proposed a Dynamic task scheduling scheme DGS which allocates computing tasks to the virtual machines using greedy strategy and the scheme results in reduction in the completion time and improvement in the resource utilization.…”
Section: Related Workmentioning
confidence: 99%