Name
Abstract | ||
|---|---|---|
Selecting and utilizing proper virtual machines in a virtualized cloud platform to achieve high availability, throughput, reliability, as well as low cost and makespan is very important. The importance lies in the adaptive resource provisioning to satisfy variant of workloads. An Adaptive Accessing Aware Algorithm (A5) is proposed in this paper to deal with this conflicting objective optimization problem. The main strategy of A5 is selecting adaptive upper/lower bound of service capacity to decide the time for scheduling redundant virtual machines and a Pareto-front-based multi-objective optimization method to decide the number of scheduling virtual machines. We carried out experiments in simulation, which show that A5 can achieve much higher performance improvements in four different workload testing environments, compared with other three commonly used methods. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S1793962311000426 | INTERNATIONAL JOURNAL OF MODELING SIMULATION AND SCIENTIFIC COMPUTING |
Keywords | Field | DocType |
Pareto-front, redundancy, upper/lower bound, virtualized cloud platform, virtual machine | Virtual machine,Job shop scheduling,Computer science,Scheduling (computing),Provisioning,Multi-objective optimization,High availability,Optimization problem,Cloud computing,Distributed computing | Journal |
Volume | Issue | ISSN |
2 | 2 | 1793-9623 |
Citations | PageRank | References |
1 | 0.37 | 13 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fan Zhang | 1 | 99 | 8.65 |
| Junwei Cao | 2 | 935 | 70.95 |
| Hong Cai | 3 | 21 | 4.89 |
| Lianchen Liu | 4 | 61 | 9.11 |
| Cheng Wu | 5 | 1154 | 93.20 |