An efficient task scheduling scheme in cloud computing using graph theory

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cloud computing is an archetype that consists of standard concepts and technologies like distributed computing, grid computing, utility computing, Virtualization, and Internet technologies in large scale. Incorporating various technologies and domains into one single concept, cloud computing delivers it resources as a service to the end users. Being an emerging technology in the current computing scenario, the cloud Computing faces various issues that include resource provisioning, security, energy management and reliability. Considering the context of scheduling from the resource provisioning issue, this work focuses on an efficient task scheduling scheme. Adapting the concept of graph theory this paper comes out with a theoretical proposal on scheduling tasks in the Cloud environment. In this paper, bandwidth is being considered as the metric and an efficient bandwidth utilization concept is proposed to schedule the task using graph theory. This theoretical proposal is being proposed considering all the attributes like virtualmachine (VM), host and the task that constitutes the element of Cloud environment.

Cite

CITATION STYLE

APA

Sujan, S., & Kanniga Devi, R. (2016). An efficient task scheduling scheme in cloud computing using graph theory. In Advances in Intelligent Systems and Computing (Vol. 398, pp. 655–662). Springer Verlag. https://doi.org/10.1007/978-81-322-2674-1_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free