2013
DOI: 10.7753/ijcatr0205.1013
|View full text |Cite
|
Sign up to set email alerts
|

QoS Driven Task Scheduling in Cloud Computing

Abstract: Cloud computing systems promise to offer pay per use, on demand computing services to users worldwide. Recently, there has been a dramatic increase in the demand for delivering services to a large number of users, so they need to offer differentiate d services to users and meet their expected quality requirements. Most of scheduling schemes proceeding nowadays have no QoS (Quality of Service) differentiation, which is necessary for Cloud Computing service operation. As a cloud must provide services to many use… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
11
0
1

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 16 publications
0
11
0
1
Order By: Relevance
“…Sundareswaran et al (2012) focuses on multi-cloud architecture, responsible for the selection and ranking cloud service providers based on end-users request. The author in Dubey and Agrawal (2013), Jayadivya et al (2012) and Bansal et al (2011) focuses on task scheduling algorithm on QoS constraints for improving various QoS parameters such as cost, reliability, etc. Moreover, many of the research paper highlights priority-based service-scheduling algorithm (Ghanbari and Othman, 2012; Patel and Bhoi, 2013; Yang et al , 2012) for efficient and effective execution of service workflow during run-time.…”
Section: Review Of Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Sundareswaran et al (2012) focuses on multi-cloud architecture, responsible for the selection and ranking cloud service providers based on end-users request. The author in Dubey and Agrawal (2013), Jayadivya et al (2012) and Bansal et al (2011) focuses on task scheduling algorithm on QoS constraints for improving various QoS parameters such as cost, reliability, etc. Moreover, many of the research paper highlights priority-based service-scheduling algorithm (Ghanbari and Othman, 2012; Patel and Bhoi, 2013; Yang et al , 2012) for efficient and effective execution of service workflow during run-time.…”
Section: Review Of Related Workmentioning
confidence: 99%
“…Traditional Web service composition (Bo et al , 2008; Chang et al , 2007; Zeng et al , 2009) and scheduling (Dubey and Agrawal, 2013; Jayadivya et al , 2012; Bansal et al , 2011) methodology is hard to support dynamic and flexible enterprise service composition workflow because it does not have rapid monitoring strategies for error handling and dynamic reconfiguration. Thus, in the paper (Kuzu and Cicekli, 2012; Gutierrez-Garcia and Sim, 2010a; Nai-zhong, 2013) the author focus on agent-based service composition approach that facilitating the challenges of SCP dynamically.…”
Section: Introductionmentioning
confidence: 99%
“…It is used to decide which of the outstanding requests is to be allocated resources. A task scheduling is defined as a set of rules that decide the tasks to be executed at a particular time [2].…”
Section: Introductionmentioning
confidence: 99%
“…Thus, the task of job scheduling is challenging, since it is necessary to arrange and manage this access to the pool of resources with satisfactory Quality of Service (QoS), reasonable waiting time, good throughput, effective CPU utilization, optimal CPU speed, and optimized scheduling algorithm. In a cloud environment, the case is quite different; the demand for resources varies frequently, according to the dynamic request of resources [8].…”
mentioning
confidence: 99%
“…Scheduling algorithms deployed in distributed systems aim to schedule received jobs and map them to the available resources in a reduced time and compute the optimal scheduling of upcoming jobs to be executed under logic constraints. One of the key advantages of scheduling approaches is accomplishing the optimal system throughput with high-performance computing [8].…”
mentioning
confidence: 99%