“A PERFORMANCE COMPARISON OF EDGE COVER GRAPH COLORING APPROACH”

Abstract

Cloud computing environment offers a collection of resources
that several users can enter into and make use concurrently whenever
required. Like any other utility, payment is done on a pay-per-use model
thus reducing the huge initial cost of acquiring IT infrastructure in the
business organization. Resource allocation management is most important
key role in determining the performance of cloud environment. To achieve
this objective cloud should have a powerfully cloud resource allocation
strategy.
In this paper, two algorithm Round Robin algorithm and Edge Graph
coloring algorithm are discussed with their features. This paper investigates
request time and occupancy time in resource allocation in the above
algorithms. A literature review approach was adopted for the study. Data
were collected from two algorithms given by researcher. This research
compare the occupancy time and waiting time in resource allocation with
different characteristics like arrival time and burst time in Round robin
algorithm and edge graph coloring algorithm.
On comparing the average occupancy duration of two different
algorithms, our results shows that Edge cover based graph coloring
algorithm is more efficient than round robin algorithm to execute problem
data in finite time.