The 2nd International Conference on Information Science and Engineering 2010
DOI: 10.1109/icise.2010.5688910
|View full text |Cite
|
Sign up to set email alerts
|

Cloud Loading Balance algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…The overall goal of this system is that, an agreed scheduling on the resources' allocation is to be obtained to perform the jobs. Consequently, with the resources allocation, the load balancing will be increased [27]. Here the scheduler is responsible to allocate one or more jobs to artificial machines in a distributed system [28].…”
Section: Description Of the Problemmentioning
confidence: 99%
“…The overall goal of this system is that, an agreed scheduling on the resources' allocation is to be obtained to perform the jobs. Consequently, with the resources allocation, the load balancing will be increased [27]. Here the scheduler is responsible to allocate one or more jobs to artificial machines in a distributed system [28].…”
Section: Description Of the Problemmentioning
confidence: 99%
“…Another aim of scheduling algorithms is making load balance, include Weighted Mean Time algorithm [8] and some of heuristic based scheduling algorithms [8][9][10][11].…”
Section: Related Workmentioning
confidence: 99%
“…Obviously, finding the proper mappings between the jobs submitted by end users and the dynamic resources of the available VMs is an NP-hard optimization problem. For this problem, a variety of dynamic, static and mixed scheduling algorithms have been proposed [4][5][6][7][8][9][10]. Some of the well-known early static scheduling schemes were based on ISH, MCP and ETF algorithms [8][9][10].…”
Section: Introductionmentioning
confidence: 99%
“…For this problem, a variety of dynamic, static and mixed scheduling algorithms have been proposed [4][5][6][7][8][9][10]. Some of the well-known early static scheduling schemes were based on ISH, MCP and ETF algorithms [8][9][10]. Most of these algorithms were built for the BNP class and were suitable for high efficiency network platforms in distributed environments.…”
Section: Introductionmentioning
confidence: 99%