CLOUING

Error-Tolerant Resource Allocation and Payment Minimization for

Cloud System

ABSTRACT:

With virtual machine (VM) technology being increasingly mature, compute resources in cloud

systems can be partitioned in fine granularity and allocated on demand. We make three

contributions in this paper: 1) we formulate a deadline-driven resource allocation problem based

on the cloud environment facilitated with VM resource isolation technology, and also propose a

novel solution with polynomial time, which could minimize users’ payment in terms of their

expected deadlines. 2) By analyzing the upper bound of task execution length based on the

possibly inaccurate workload prediction, we further propose an error-tolerant method to

guarantee task’s completion within its deadline. 3) We validate its effectiveness over a real

VM-facilitated cluster environment under different levels of competition. In our experiment, by

tuning algorithmic input deadline based on our derived bound, task execution length can always

be limited within its deadline in the sufficient-supply situation; the mean execution length still

keeps 70 percent as high as user specified deadline under the severe competition. Under the

original-deadline-based solution, about 52.5 percent of tasks are completed within 0.95-1.0 as

high as their deadline, which still conforms to the deadline-guaranteed requirement. Only 20

percent of tasks violate deadlines, yet most (17.5 percent) are still finished within 1.05 times of

deadlines.

GLOBALSOFT TECHNOLOGIESIEEE PROJECTS & SOFTWARE DEVELOPMENTS

IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE

BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS

CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401

Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com

EXISTING SYSTEM:

In literatures, traditional optimization problems are often subject to the precise prediction of

task’s characteristic (or execution property), which is nontrivial to realize in practice.

Traditional job scheduling is often formulated as a kind of combinatorial optimization problem

(or queue-based multiprocessor scheduling problem, due to the nonguaranteed performance

isolation for multiple tasks running on the same machines. That is, most of the existing

deadline-driven task scheduling solutions (from single cluster environment confined in LAN to

the Grid computing environment suitable for WAN are also strictly subject to the queuing

model under which a single machine’s multiple resources cannot be further split to smaller

fractions at will. This will eventually cause the raw-grained resource allocation, relatively low

resource utilization and suboptimal task execution efficiency

DISADVANTAGES OF EXISTING SYSTEM:

Users may wish to minimize their payments when guaranteeing their service level such that

their tasks can be finished before deadlines. Such a deadline-guaranteed resource allocation

with minimized payment is rarely studied in literatures. Moreover, inevitable errors in

predicting task workloads will definitely make the problem harder.

PROPOSED SYSTEM:

We make three contributions in this paper:

1) We formulate a deadline-driven resource allocation problem based on the cloud environment

facilitated with VM resource isolation technology, and also propose a novel solution with

polynomial time, which could minimize users’ payment in terms of their expected deadlines.

2) By analyzing the upper bound of task execution length based on the possibly inaccurate

workload prediction, we further propose an error-tolerant method to guarantee task’s

completion within its deadline.

3) We validate its effectiveness over a real VM-facilitated cluster environment under different

levels of competition.

ADVANTAGES OF PROPOSED SYSTEM:

All the theoretical conclusions are confirmed with our experiments. Specifically, in the situation

with relatively sufficient resources, the worst case tasks under the stricter deadline-based

allocation only take as about 0.75 times as their deadlines to complete, as compared to the 1.2

times of the deadlines under the original user-predefined deadline based allocation. We also

observe that in the competitive environment, the latter algorithm performs much more stable

than the former instead, which means that the latter tolerates the resource competition better.

We also confirm the effectiveness of our solution via the distribution of the number of tasks

with respect to execution times and user payments: in the competitive situation, majority of

tasks can be guaranteed to be completed within deadlines.

SYSTEM ARCHITECTURE:

ALGORITHMS USED:

SYSTEM CONFIGURATION:-

HARDWARE CONFIGURATION:-

Processor - Pentium –IV

Speed - 1.1 Ghz

RAM - 256 MB(min)

Hard Disk - 20 GB

Key Board - Standard Windows Keyboard

Mouse - Two or Three Button Mouse

Monitor - SVGA

SOFTWARE CONFIGURATION:-

Operating System : Windows XP

Programming Language : JAVA

Java Version : JDK 1.6 & above.

REFERENCE:

Sheng Di, Member, IEEE, and Cho-Li Wang, Member, IEEE-“Error-Tolerant Resource

Allocation and Payment Minimization for Cloud System” IEEE TRANSACTIONS ON

PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 24, NO. 6, JUNE 2013.

DOMAIN: WIRELESS NETWORK PROJECTS