Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters
0 likes215 views
The document discusses various algorithms for task scheduling in cloud computing, focusing on Quality of Service (QoS) differentiation to meet users' diverse needs. It reviews existing scheduling techniques, compares their effectiveness based on multiple parameters, and highlights future research opportunities to enhance algorithm performance. Key algorithms covered include the QDA scheduling algorithm, improved cost-based scheduling, and the Paprika method, among others.
1 of 4
Downloaded 14 times
![IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 6, Ver. III (Nov – Dec. 2015), PP 35-38
www.iosrjournals.org
DOI: 10.9790/0661-17633538 www.iosrjournals.org 35 | Page
Differentiating Algorithms of Cloud Task Scheduling Based on
various Parameters
Dhanmeet Singh Kalra1,
Mohit Pal Singh Birdi2
CSE Department
Guru Nanak Dev University Regional Campus Jalandhar, INDIA
Abstract: Cloud computing is a new design structure for large, distributed data centers. Cloud computing
system promises to offer end user “pay as go” model. To meet the expected quality requirements of users, cloud
computing need to offer differentiated services to users. QoS differentiation is very important to satisfy
different users with different QoS requirements. In this paper, various QoS based scheduling algorithms,
scheduling parameters and the future scope of discussed algorithms have been studied. This paper summarizes
various cloud scheduling algorithms, findings of algorithms, scheduling factors, type of scheduling and
parameters considered.
Keywords- Cloud Scheduling, algorithms, Quality of service (QoS), Qda scheduling algorithm, Improved Cost
Based, PAPRIKA, ANT Colony, Cmultiqosschedule algorithm, SHEFT Workflow , Job scheduling algorithm
based on berger model.
I. Introduction
Cloud computing is the rising techNology that delivers infrastructure as a service [IaaS], software as a
service[SAAS], platform as a service[PAAS] [1]. Cloud computing began to develop at end of 2007. It allows
customers to use application without buying any software and hardware and access the files at any computer
using internet. Cloud computing has become an interesting way of changing the whole computing through
internet. Cloud computing is a model that combines various resources from data center into outside services.
Scheduler for cloud computing checks the availability of processing resources on which task should be allotted.
Service providers ensure that income is utilized to their fullest so that resource power is Not left unused.
Scheduling is a critical problem in Cloud computing, because a cloud provider has to serve many users
according to their different needs.
Scheduling in cloud computing is of various types: task scheduling, workflow scheduling, resource
scheduling, job scheduling etc. Many researchers proposed various scheduling algorithms to achieve load
balancing and fairness among users. Because of different QoS parameters like cost, waiting time, execution
time, trust etc., scheduling in cloud computing is different from other scheduling environment like grid and
distributed scheduling. The demand of resources changes dynamically and scheduling becomes very difficult.
QoS is the collective effort of service performance, which determines the degree of user satisfaction for services
[2]. The cloud computing environment provides a different platform by creating a virtual machine that assists
users in accomplishing their jobs within a reasonable time and cost effectively without sacrificing the quality of
the services [3]. The main task is to efficiently and reasonably allocate the user’s needs to available resources
according to the QoS from both cloud side and user side. The paper is organized as follows: section II gives a
review on some scheduling techniques based on different. QoS parameters, section III shows the comparison of
various algorithms by taking different parameters and future scope of discussed algorithms, section IV shows
the metrics of various parameters and section V concludes the paper.
II. Related work
A. QDA scheduling algorithm
Luzhang et.al [4] proposed a QDA scheduling algorithm using cloud workflow as a background.
Algorithm works on instance-intensive workflow scheduling optimization problem. By combining staggered
sub-deadline allocation criteria and differentiate tasks based on QoS preferences of users, QDA algorithm is
proposed. It takes many QoS parameters like time, cost, bandwidth, reliability, quantifies them with particular
value and use them in QoS based sub-deadline allocation algorithm to meet complete QoS user satisfaction.
QDA algorithm simulates on cloudsim new program function called BindcloudToVmByDeadline. By taking
QoS utility function into account, QDA algorithm performs better in case of execution time, user satisfaction
and load balancing.](https://image.slidesharecdn.com/f017633538-151204061500-lva1-app6891/85/Differentiating-Algorithms-of-Cloud-Task-Scheduling-Based-on-various-Parameters-1-320.jpg)
![Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters
DOI: 10.9790/0661-17633538 www.iosrjournals.org 36 | Page
B. Improved Cost Based Scheduling algorithm
In [5] paper author proposed the approach that is improved cost-based scheduling algorithm. It
measured computation performance and resource cost. It also increased execution data transfer ratio by
combining the tasks.
C. PAPRIKA
Hilda Lawrance and Dr. Salaja Silas[6] proposed a task based scheduling of resources called
potentially all pair-wise rankings of all possible alternatives (PAPRIKA). By taking various QoS parameters
into account, tasks and resources are arranged according to user satisfaction and PAPRIKA method. According
to resources and tasks QoS parameter values, resources and Task matrix is created respectively. PAPRIKA
method is based on overall ranking of all possible alternative values. Resource priority is calculated by
allocating a threshold value to all QoS parameters, comparing all resources pair-wise with threshold value and
finding priority of each resource. Task from task line is taken and allocate tasks to resources according to the
user satisfaction. PAPRIKA method proves better result in case of task completion time and resource utility rate.
Resource utility rate of PAPRIKA method is higher when compare with S-CSRSA[11] algorithm.
D. ANT Colony Algorithm
The author proposed a poised Ant colony algorithm [7] which uses a pseudo random proportional rule
to poise the integral organization load while completing all the jobs at hand as soon as possible according to the
environmental status. This algorithm balances the workload as well as minimizing the make span.
E. CMultiQoSSchedule algorithm
Due to restriction that most scheduling algorithm takes only time and cost as QoS parameters, Wenjuan
Li et.al[8] proposed a new Novel based scheduling algorithm based on trust values. This approach used the trust
parameter for workflow scheduling in cloud. Novel workflow scheduling is divided into two stages that is macro
and micro. Trust value is calculated from both provider side and user side. On cloud provider side, trust agents
manage the trust relationship by differentiating trust domains according to existing cloud platform. Cloud
customers take help of intermediate institution to manage trust relationships. Using trust mechanism author
proposed a single workflow scheduling algorithm under time and cost constraints. It also introduced fuzzy
clustering method to classify workflow process. Cloudsim tool with extended features is used to simulate
results. This approach achieve high execution success rate, less completion time and more user’s satisfaction
when compared with dynamic level scheduling(DLS), modified critical path(MCP) and berger model. It
provides more success rate by eliminating dishonest providers. To use this model in actual cloud platform, its
efficiency and effectiveness should test.
F. SHEFT Workflow Scheduling Algorithm
This paper [9] proposed the SHEFT (Scalable HEFT) scheduling algorithm that helps increasing and
decreasing the number of resources at runtime. It provides facility to resources to scale at runtime, outperforms
in optimizing workflow execution time. It scheduled a workflow in a cloud environment elastically. There was
optimized execution time for the workflow.
G. Job scheduling algorithm based on berger model
Hongbo Yu [10], proposed a scheduling algorithm based on Berg Model that adapts to
commercialization and virtualization features of cloud environment. People element analysis theory is applied to
establish dual fairness constraints and efficiency. User’s demand of resources is based on various QoS based
parameters. Firstly, selection of resources is done on some expected constraints and then fair judgement
constraints allocate resources to tasks. Proposed algorithm reflects better fairness of user tasks. In future, it
should experimentally implement using Berg model.](https://image.slidesharecdn.com/f017633538-151204061500-lva1-app6891/85/Differentiating-Algorithms-of-Cloud-Task-Scheduling-Based-on-various-Parameters-2-320.jpg)
![Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters
DOI: 10.9790/0661-17633538 www.iosrjournals.org 37 | Page
III. Comparative table of various scheduling algorithms
Table II comparison of QoS-based task scheduling algorithms and future scope
IV. Metrics for various scheduling algorithms
The Existing scheduling algorithms considers various parameters like time, cost, makespan, speed, scalability,
trust, resource utilization, scheduling success rate, quality of service and so on. Table II gives the details about
the different metrics considered for QoS-based task scheduling.
TABLE II Metrics considered by the Qos-based scheduling algorithms
V. Conclusion
Scheduling is a major factor in cloud environment. As shown in paper scheduling depends upon
various QoS parameters. This paper gives review on various QoS based task scheduling algorithms and the
future work to be done on that algorithms. The existing scheduling algorithm considered as topic of research and
can be used to introduce more efficient and improved performance of algorithms based on parameters like trust
value, execution rate, cost of the communication, speed and success rate.
References
[1] Sumit khurana, Anmol Gaurav Verma “Comparison of Cloud Computing Service Models: SaaS, PaaS, IaaS” IJECT Vol. 4, Issue
Spl - 3, April - June 2013
[2] Syed Muhammad Ahsan. ―A framework for QoS computation in web service and techNology selection‖computer standards &
Interfaces.2006,28(6),p.714-720.
[3] Yang, B., X. Xu, F. Tan and D.H. Park “An utility based job scheduling algorithm for cloud computing considering reliability
factor” Proceedings of the 2011 International Conference on Cloud and Service Computing, IEEE Xplore Press.
[4] Huifang Li, Siyuan Ge, Lu Zhang “A QoS-based Scheduling Algorithm for Instance-intensive Workflows in Cloud
Environment”26th Chinese Control and Decision Conference (CCDC) 978-1-4799-3708-0/14 2014 IEEE.
[5] S. Selvarani, G.S. Sadhasivam,“Improved Cost Based Algorithm for Task Scheduling In Cloud Computing”, Computational
Intelligence and Computing Research, pp. 1-5,2010.
Techni
ques
Cost Time Reliability bandwidth Makespan Latency Resource
utility
Completion
time
Execution
time
Success
rate
User
satisfaction
Trust
T1 True True True True False False False False False False False False
T2 False False False False True True False False False False False False
T3 False False False False False False True True False False False False
T4 True False False False False False False False True False False False
T5 True True False False False False False True False True True True
T6 True False False False False False False False False False False True
T7 False False False False False False False False True False True False](https://image.slidesharecdn.com/f017633538-151204061500-lva1-app6891/85/Differentiating-Algorithms-of-Cloud-Task-Scheduling-Based-on-various-Parameters-3-320.jpg)
![Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters
DOI: 10.9790/0661-17633538 www.iosrjournals.org 38 | Page
[6] Hilda Lawrance, Dr. Salaja Silas” Efficient Qos Based Resource Scheduling Using PAPRIKA Method for Cloud Computing”
International Journal of Engineering Science and TechNology (IJEST) ISSN : 0975-5462 Vol. 5 No.03 March 2013
[7] Kapil Kumar, Abhinav Hans, Ashish Sharma, Navdeep Singh, “Towards The Various Cloud Computing Scheduling Concerns: A
Review, ” International Conference on InNovative Applications of Computational Intelligence on Power, Energy and Controls with
their Impact on Humanity (CIPECH14) 28 & 29 November 2014.
[8] Wenjuan Li, Qifei Zhang, Jiyi Wu1, Jing Li, Haili Zhao “Trust-based and QoS Demand Clustering Analysis Customizable Cloud
Workflow Scheduling Strategies” 2012 IEEE International Conference on Cluster Computing Workshops
[9] C. Lin, S.Lu, “Scheduling Scientific Workflow Elasticity for Cloud Computing”, IEEE 4th International Conference on Cloud
Computing, pp. 246-247,2011.
[10] Hongbo Yu, Yihua Lan*,Xingang Zhang, Zhidu Liu, Chao Yin, Lindong Li” Job Scheduling Algorithm In Cloud Environment”
International Conference on Computational and Information Sciences 2013 IEEE.
[11] Wugi Gao, fengju kanj “Cloud Simulation Resource Scheduling Algorithm Based on Multi-dimension Quality of Service”
Science alert November 22, 2011.](https://image.slidesharecdn.com/f017633538-151204061500-lva1-app6891/85/Differentiating-Algorithms-of-Cloud-Task-Scheduling-Based-on-various-Parameters-4-320.jpg)
Ad
Recommended
Score based deadline constrained workflow scheduling algorithm for cloud systems
Score based deadline constrained workflow scheduling algorithm for cloud systemsijccsa The paper presents a score-based deadline constrained workflow scheduling algorithm for cloud systems, aimed at executing workflows efficiently and within user-defined deadlines and costs. By using a scoring system to assess the capabilities of virtual machines, the algorithm ensures reliable resource allocation while minimizing execution time and costs. Experimental results demonstrate that this algorithm reduces failure rates and execution times compared to existing methods.
LOAD BALANCING ALGORITHM ON CLOUD COMPUTING FOR OPTIMIZE RESPONE TIME
LOAD BALANCING ALGORITHM ON CLOUD COMPUTING FOR OPTIMIZE RESPONE TIMEijccsa This document presents a load balancing algorithm for cloud computing to optimize response time, named APRA (ARIMA Prediction of Response Time Algorithm). It emphasizes the importance of resource allocation and user satisfaction while proposing a method to predict response times to enhance load distribution. The findings indicate that predictive modeling can significantly improve the efficiency of load balancing in cloud environments.
Deadline and Suffrage Aware Task Scheduling Approach for Cloud Environment
Deadline and Suffrage Aware Task Scheduling Approach for Cloud EnvironmentIRJET Journal The document proposes a deadline and suffrage aware task scheduling approach for cloud environments. It discusses limitations of existing approaches that can cause system imbalances. The proposed approach considers both task deadlines and priorities assigned by user votes ("suffrage") to schedule tasks. It was tested using CloudSim simulator and found to outperform the basic min-min approach in reducing completion times and improving resource utilization and provider profits while still meeting task deadlines.
Quality of Service based Task Scheduling Algorithms in Cloud Computing
Quality of Service based Task Scheduling Algorithms in Cloud Computing IJECEIAES This document analyzes various quality of service (QoS) based task scheduling algorithms in cloud computing, focusing on their efficiencies, parameters, advantages, and limitations. It discusses the impact of scheduling on resource utilization, security, and user satisfaction while offering insights into improvements via factors such as task arrival time and execution cost. The findings highlight the need for enhancing existing algorithms to better handle dynamic cloud environments and to optimize load balancing.
Scheduling Algorithm Based Simulator for Resource Allocation Task in Cloud Co...
Scheduling Algorithm Based Simulator for Resource Allocation Task in Cloud Co...IRJET Journal This document proposes a scheduling algorithm for allocating resources in cloud computing based on the Project Evaluation and Review Technique (PERT). It aims to address issues like starvation of lower priority tasks. The algorithm models task allocation as a directed acyclic graph and uses PERT to schedule critical and non-critical tasks, prioritizing higher priority tasks. The algorithm is evaluated against other scheduling methods and shows improvements in reducing completion time and optimizing resource allocation for all tasks.
A Novel Dynamic Priority Based Job Scheduling Approach for Cloud Environment
A Novel Dynamic Priority Based Job Scheduling Approach for Cloud EnvironmentIRJET Journal The document proposes a new dynamic priority-based job scheduling algorithm for cloud environments to optimize the problem of starvation. It assigns priority to jobs based on criteria like CPU requirements, I/O requirements, and job criticality. The algorithm aims to reduce wait time, turnaround time, and increase throughput and CPU utilization. It was tested against the Shortest Job First algorithm in CloudSim simulation software. The results showed improvements in wait time, turnaround time, and total finish time compared to the SJF algorithm.
A Review on Scheduling in Cloud Computing
A Review on Scheduling in Cloud Computingijujournal The document is a review of scheduling techniques in cloud computing, focusing on the importance of accurate task completion and the optimization of energy costs. It highlights various scheduling algorithms, including hybrid and heuristic methods, that address issues such as resource utilization and energy efficiency in cloud environments. The paper concludes by discussing the effectiveness of these algorithms in ensuring timely and reliable service provisioning while minimizing costs.
Energy Efficient Heuristic Base Job Scheduling Algorithms in Cloud Computing
Energy Efficient Heuristic Base Job Scheduling Algorithms in Cloud ComputingIOSRjournaljce The paper discusses energy-efficient heuristic-based job scheduling algorithms in cloud computing, focusing on two approaches: Multi-Queue Job Scheduling (MQS) and Ant Colony Optimization (ACO). It compares the performance of both algorithms in terms of energy consumption and processing time across various workloads, demonstrating that MQS outperforms ACO. The findings can guide researchers in selecting optimized job scheduling algorithms for cloud environments.
Time and Reliability Optimization Bat Algorithm for Scheduling Workflow in Cloud
Time and Reliability Optimization Bat Algorithm for Scheduling Workflow in CloudIRJET Journal This document describes using a meta-heuristic optimization algorithm called the Bat Algorithm (BA) to schedule workflows in cloud computing environments. The BA is applied to optimize a multi-objective function that minimizes workflow execution time and maximizes reliability while keeping costs within a user-specified budget. The BA is compared to a basic randomized evolutionary algorithm (BREA) that uses greedy approaches. Experimental results show the BA performs better by finding schedules that have lower execution times and higher reliability within the given budget constraints. The BA is well-suited for this problem because it can efficiently search large solution spaces and automatically focus on optimal regions like other metaheuristics.
Improved Max-Min Scheduling Algorithm
Improved Max-Min Scheduling Algorithmiosrjce The document discusses an improved max-min scheduling algorithm aimed at enhancing cloud-based services by optimizing task scheduling based on multiple factors, including job size, completion time, and storage capacity. It critiques existing algorithms for their limited parameters and presents a more comprehensive approach that accommodates dynamic workload and resource variability. The research demonstrates that incorporating additional constraints in the scheduling process leads to better performance without significant increased overhead.
C1803052327
C1803052327IOSR Journals This document proposes a genetic algorithm called Workflow Scheduling for Public Cloud Using Genetic Algorithm (WSGA) to optimize the cost of executing workflows in the public cloud. It discusses how genetic algorithms can be applied to the workflow scheduling problem to generate optimal schedules. The WSGA represents potential scheduling solutions as chromosomes, uses a fitness function to evaluate scheduling costs, and applies genetic operators like selection, crossover and mutation to evolve new schedules over multiple iterations. The goal is to minimize total execution cost while meeting workflow dependencies and deadline constraints. An experimental setup is described and the WSGA approach is claimed to reduce costs more than other heuristic scheduling algorithms for communication-intensive workflows.
Time Efficient VM Allocation using KD-Tree Approach in Cloud Server Environment
Time Efficient VM Allocation using KD-Tree Approach in Cloud Server Environmentrahulmonikasharma This document summarizes a research paper that proposes a new algorithm called KD-Tree approach for efficient virtual machine (VM) allocation in cloud computing environments. The algorithm aims to minimize the response time for allocating VMs to user requests. It does this by adopting a KD-Tree data structure to index physical host machines, allowing the scheduler to quickly find the host that can accommodate a new VM request with the minimum latency in O(Log n) time. The proposed approach is evaluated through simulations using the CloudSim toolkit and is shown to outperform an existing linear scheduling strategy (LSTR) algorithm in terms of reducing VM allocation times.
call for papers, research paper publishing, where to publish research paper, ...
call for papers, research paper publishing, where to publish research paper, ...International Journal of Engineering Inventions www.ijeijournal.com This document summarizes and compares various scheduling algorithms used in cloud computing environments. It begins with an introduction to cloud computing and the need for scheduling algorithms in cloud environments. It then describes several existing scheduling algorithms, including compromised-time-cost scheduling, particle swarm optimization-based heuristic, improved cost-based algorithm, resource-aware scheduling, innovative transaction intensive cost-constraint scheduling, scalable heterogeneous earliest-finish-time algorithm, and multiple QoS constrained scheduling strategy of multi-workflows. These algorithms aim to optimize metrics such as execution time, cost, deadline, load balancing, and quality of service. The document concludes by comparing the different scheduling strategies.
(5 10) chitra natarajan
(5 10) chitra natarajanIISRTJournals This document summarizes a research paper that proposes a strategy to improve resource provisioning in heterogeneous cloud environments. The strategy uses an electronic auction model that considers workload selection factors like job deadlines and CPU time. It also presents workflow optimization logic to minimize costs while meeting performance requirements. The strategy employs fault tolerance services using job migration. It is evaluated based on metrics like execution time, makespan time, migration frequency and energy consumption, showing improved performance over existing approaches. Future work plans to introduce new resource provisioning mechanisms considering load, energy and network factors to optimize resource selection and reduce transmission costs and times.
Scheduling Divisible Jobs to Optimize the Computation and Energy Costs
Scheduling Divisible Jobs to Optimize the Computation and Energy Costsinventionjournals The document presents a new analytical framework for scheduling divisible jobs in a cloud computing environment to minimize computation and energy costs. It utilizes the divisible load theory (DLT) to develop a model that supports job scheduling in heterogeneous environments, optimally aligning service quality requirements with cloud infrastructure utilization. Simulations validate that the proposed model outperforms existing scheduling strategies, particularly in managing varied job characteristics and energy consumption.
Service Request Scheduling in Cloud Computing using Meta-Heuristic Technique:...
Service Request Scheduling in Cloud Computing using Meta-Heuristic Technique:...IRJET Journal This document discusses using the Teaching Learning Based Optimization (TLBO) meta-heuristic technique for service request scheduling between users and cloud service providers. TLBO is a nature-inspired algorithm that mimics the teacher-student learning process. It is compared to other meta-heuristic algorithms like Genetic Algorithm. The key steps of TLBO involve initializing a population, evaluating fitness, selecting the best solution as teacher, and updating the population through teacher and learner phases until termination criteria is met. The document proposes using number of users and virtual machines as parameters for TLBO scheduling in cloud computing. MATLAB simulation results show the initial and final iterations converging to an optimal scheduling solution.
A Survey on Service Request Scheduling in Cloud Based Architecture
A Survey on Service Request Scheduling in Cloud Based ArchitectureIJSRD The document discusses service request scheduling in cloud-based architecture, highlighting the importance of resource management and job scheduling to enhance performance and reduce response time. Various scheduling algorithms, such as First Come First Served (FCFS), Static Priority Scheduling Algorithm (SPSA), and Dynamic Priority Scheduling Algorithm (DPSA), are reviewed, with a focus on the advantages and disadvantages of each. The paper concludes that while DPSA offers better treatment for lower priority tasks, there is potential for further improvements in scheduling algorithms.
A BAYE'S THEOREM BASED NODE SELECTION FOR LOAD BALANCING IN CLOUD ENVIRONMENT
A BAYE'S THEOREM BASED NODE SELECTION FOR LOAD BALANCING IN CLOUD ENVIRONMENThiij This paper proposes a heuristic approach based on Bayes' theorem for optimal node selection in load balancing within cloud computing environments. The method, referred to as Bayesian Node Selection for Load Balancing (BNSLB), improves performance by reducing task cancellation rates and enhancing throughput compared to traditional methods such as round robin. Simulation results demonstrate that the BNSLB approach offers more efficient resource utilization and better overall service performance.
A Baye's Theorem Based Node Selection for Load Balancing in Cloud Environment
A Baye's Theorem Based Node Selection for Load Balancing in Cloud Environmentneirew J The paper presents a Baye's theorem-based approach for optimal node selection aimed at improving load balancing in cloud computing environments. The proposed method, tested using CloudSim, demonstrates enhanced task deployment performance and resource utilization compared to existing load balancing techniques, particularly the Round Robin method. Results indicate that the Baye's theorem method reduces task cancellations and improves overall throughput in cloud node operations.
An optimized scientific workflow scheduling in cloud computing
An optimized scientific workflow scheduling in cloud computingDIGVIJAY SHINDE The document discusses optimizing scientific workflow scheduling in cloud computing. It begins with definitions of workflow and cloud computing. Workflow is a group of repeatable dependent tasks, while cloud computing provides applications and hardware resources over the Internet. There are three cloud service models: SaaS, PaaS, and IaaS. The document explores how to efficiently schedule workflows in the cloud to reduce makespan, cost, and energy consumption. It reviews different scheduling algorithms like FCFS, genetic algorithms, and discusses optimizing objectives like time and cost. The document provides a literature review comparing various workflow scheduling methods and algorithms. It concludes with discussing open issues and directions for future work in optimizing workflow scheduling for cloud computing.
Task Scheduling methodology in cloud computing
Task Scheduling methodology in cloud computing Qutub-ud- Din This document outlines a proposed methodology for developing efficient task scheduling strategies in cloud computing. It begins with introductions to cloud computing and task scheduling. It then reviews several relevant existing task scheduling algorithms from literature that focus on objectives like reducing costs, minimizing completion time, and maximizing resource utilization. The problem statement indicates the goals are to reduce costs, minimize completion time, and maximize resource allocation. An overview of the proposed methodology's flow is then provided, followed by references.
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTINGijccsa This document presents a study on load balancing algorithms in cloud computing aimed at improving response times at both physical and virtual server levels. The proposed virtual machine-level load balancing algorithm is designed to optimize average response and processing times, and is compared with existing algorithms like maxmin and throttled, demonstrating enhanced performance. The paper details the theoretical foundation, algorithm design, and simulation results to validate the proposed method's effectiveness.
cloud schedualing
cloud schedualingtwomarkopolo This document proposes a new Ranking Chaos Optimization (RCO) algorithm to solve the dual scheduling problem of cloud services and computing resources (DS-CSCR) in private clouds. It introduces the DS-CSCR concept and models the characteristics of cloud services and computing resources. The RCO algorithm uses ranking selection, individual chaos, and dynamic heuristic operators. Experimental results show RCO has better searching ability, time complexity, and stability compared to other algorithms for solving DS-CSCR. Future work is needed to study additional quality of service properties and improve RCO for other optimization problems.
Ijebea14 287
Ijebea14 287Iasir Journals This document presents a policy-driven architecture for effective service allocation in cloud environments. It begins with an introduction to cloud computing and discusses challenges of scheduling client requests and allocating services as the number of clients increases. It then reviews previous research on resource allocation and process scheduling in distributed cloud systems. The paper proposes a service allocation model and policy-based architecture to address these challenges through effective identification of cloud and client characteristics. This would allow for reliable and efficient allocation of services to clients. The conclusion discusses evaluating the proposed architecture.
REAL-TIME ADAPTIVE ENERGY-SCHEDULING ALGORITHM FOR VIRTUALIZED CLOUD COMPUTING
REAL-TIME ADAPTIVE ENERGY-SCHEDULING ALGORITHM FOR VIRTUALIZED CLOUD COMPUTINGijdpsjournal The paper presents a real-time adaptive energy-scheduling (RTAES) algorithm aimed at optimizing energy consumption and computation time in virtualized cloud computing environments. By utilizing dynamic voltage and frequency scaling (DVFS), the RTAES algorithm minimizes energy and execution costs while meeting quality of service requirements for computationally intensive tasks. The proposed model demonstrates improved effectiveness, scalability, and power consumption metrics compared to existing solutions.
IRJET- Time and Resource Efficient Task Scheduling in Cloud Computing Environ...
IRJET- Time and Resource Efficient Task Scheduling in Cloud Computing Environ...IRJET Journal This document summarizes a research paper that proposes a Task Based Allocation (TBA) algorithm to efficiently schedule tasks in a cloud computing environment. The algorithm aims to minimize makespan (completion time of all tasks) and maximize resource utilization. It first generates an Expected Time to Complete (ETC) matrix that estimates the time each task will take on different virtual machines. It then sorts tasks by length and allocates each task to the VM that minimizes its completion time, updating the VM wait times. The algorithm is evaluated using CloudSim simulation and is shown to reduce makespan, execution time and costs compared to random and first-come, first-served scheduling approaches.
A novel scheduling algorithm for cloud computing environment
A novel scheduling algorithm for cloud computing environmentSouvik Pal The document describes a proposed genetic algorithm-based scheduling approach for cloud computing environments. It aims to minimize waiting time and queue length. The algorithm first permutes task burst times and finds minimum waiting times using FCFS and genetic algorithms. It then applies a queuing model to the sequences with minimum waiting time from each approach. Experimental results on 4 sample tasks show the genetic algorithm reduces waiting time compared to FCFS. The genetic operators of selection, crossover and mutation are applied to evolve optimal task scheduling sequences.
D04573033
D04573033IOSR-JEN This document provides an overview of scheduling mechanisms in cloud computing. It discusses task scheduling, gang scheduling based on performance and cost evaluation, and resource scheduling. For task scheduling, it describes classifying tasks based on quality of service parameters and MapReduce level scheduling. It then explains two gang scheduling algorithms - Adaptive First Come First Serve (AFCFS) and Largest Job First Serve (LJFS) - and how they are used to evaluate performance and cost. Finally, it briefly discusses resource scheduling and factors that affect scheduling mechanisms in cloud computing like efficiency, fairness, costs, and communication patterns.
REVIEW PAPER on Scheduling in Cloud Computing
REVIEW PAPER on Scheduling in Cloud ComputingJaya Gautam This document reviews scheduling algorithms for workflow applications in cloud computing. It discusses characteristics of cloud computing, deployment and service models, and the importance of scheduling in cloud computing. The document analyzes several scheduling algorithms proposed in literature that consider parameters like makespan, cost, load balancing, and priority. It finds that algorithms like Max-Min, Min-Min, and HEFT perform better than traditional algorithms in optimizing these parameters for workflow scheduling in cloud environments.
QoS Based Scheduling Techniques in Cloud Computing: Systematic Review
QoS Based Scheduling Techniques in Cloud Computing: Systematic ReviewIJCSIS Research Publications This document is a systematic review of QoS-based scheduling techniques in cloud computing, analyzing various resource scheduling methodologies using soft computing techniques. It discusses the importance of scheduling for enhancing resource utilization and overall performance while addressing the challenges associated with efficiently meeting different QoS requirements. The review covers several techniques, including neural networks, fuzzy logic, and genetic algorithms, providing insights into their applications and effects on scheduling efficiency.
More Related Content
What's hot (18)
Time and Reliability Optimization Bat Algorithm for Scheduling Workflow in Cloud
Time and Reliability Optimization Bat Algorithm for Scheduling Workflow in CloudIRJET Journal This document describes using a meta-heuristic optimization algorithm called the Bat Algorithm (BA) to schedule workflows in cloud computing environments. The BA is applied to optimize a multi-objective function that minimizes workflow execution time and maximizes reliability while keeping costs within a user-specified budget. The BA is compared to a basic randomized evolutionary algorithm (BREA) that uses greedy approaches. Experimental results show the BA performs better by finding schedules that have lower execution times and higher reliability within the given budget constraints. The BA is well-suited for this problem because it can efficiently search large solution spaces and automatically focus on optimal regions like other metaheuristics.
Improved Max-Min Scheduling Algorithm
Improved Max-Min Scheduling Algorithmiosrjce The document discusses an improved max-min scheduling algorithm aimed at enhancing cloud-based services by optimizing task scheduling based on multiple factors, including job size, completion time, and storage capacity. It critiques existing algorithms for their limited parameters and presents a more comprehensive approach that accommodates dynamic workload and resource variability. The research demonstrates that incorporating additional constraints in the scheduling process leads to better performance without significant increased overhead.
C1803052327
C1803052327IOSR Journals This document proposes a genetic algorithm called Workflow Scheduling for Public Cloud Using Genetic Algorithm (WSGA) to optimize the cost of executing workflows in the public cloud. It discusses how genetic algorithms can be applied to the workflow scheduling problem to generate optimal schedules. The WSGA represents potential scheduling solutions as chromosomes, uses a fitness function to evaluate scheduling costs, and applies genetic operators like selection, crossover and mutation to evolve new schedules over multiple iterations. The goal is to minimize total execution cost while meeting workflow dependencies and deadline constraints. An experimental setup is described and the WSGA approach is claimed to reduce costs more than other heuristic scheduling algorithms for communication-intensive workflows.
Time Efficient VM Allocation using KD-Tree Approach in Cloud Server Environment
Time Efficient VM Allocation using KD-Tree Approach in Cloud Server Environmentrahulmonikasharma This document summarizes a research paper that proposes a new algorithm called KD-Tree approach for efficient virtual machine (VM) allocation in cloud computing environments. The algorithm aims to minimize the response time for allocating VMs to user requests. It does this by adopting a KD-Tree data structure to index physical host machines, allowing the scheduler to quickly find the host that can accommodate a new VM request with the minimum latency in O(Log n) time. The proposed approach is evaluated through simulations using the CloudSim toolkit and is shown to outperform an existing linear scheduling strategy (LSTR) algorithm in terms of reducing VM allocation times.
call for papers, research paper publishing, where to publish research paper, ...
call for papers, research paper publishing, where to publish research paper, ...International Journal of Engineering Inventions www.ijeijournal.com This document summarizes and compares various scheduling algorithms used in cloud computing environments. It begins with an introduction to cloud computing and the need for scheduling algorithms in cloud environments. It then describes several existing scheduling algorithms, including compromised-time-cost scheduling, particle swarm optimization-based heuristic, improved cost-based algorithm, resource-aware scheduling, innovative transaction intensive cost-constraint scheduling, scalable heterogeneous earliest-finish-time algorithm, and multiple QoS constrained scheduling strategy of multi-workflows. These algorithms aim to optimize metrics such as execution time, cost, deadline, load balancing, and quality of service. The document concludes by comparing the different scheduling strategies.
(5 10) chitra natarajan
(5 10) chitra natarajanIISRTJournals This document summarizes a research paper that proposes a strategy to improve resource provisioning in heterogeneous cloud environments. The strategy uses an electronic auction model that considers workload selection factors like job deadlines and CPU time. It also presents workflow optimization logic to minimize costs while meeting performance requirements. The strategy employs fault tolerance services using job migration. It is evaluated based on metrics like execution time, makespan time, migration frequency and energy consumption, showing improved performance over existing approaches. Future work plans to introduce new resource provisioning mechanisms considering load, energy and network factors to optimize resource selection and reduce transmission costs and times.
Scheduling Divisible Jobs to Optimize the Computation and Energy Costs
Scheduling Divisible Jobs to Optimize the Computation and Energy Costsinventionjournals The document presents a new analytical framework for scheduling divisible jobs in a cloud computing environment to minimize computation and energy costs. It utilizes the divisible load theory (DLT) to develop a model that supports job scheduling in heterogeneous environments, optimally aligning service quality requirements with cloud infrastructure utilization. Simulations validate that the proposed model outperforms existing scheduling strategies, particularly in managing varied job characteristics and energy consumption.
Service Request Scheduling in Cloud Computing using Meta-Heuristic Technique:...
Service Request Scheduling in Cloud Computing using Meta-Heuristic Technique:...IRJET Journal This document discusses using the Teaching Learning Based Optimization (TLBO) meta-heuristic technique for service request scheduling between users and cloud service providers. TLBO is a nature-inspired algorithm that mimics the teacher-student learning process. It is compared to other meta-heuristic algorithms like Genetic Algorithm. The key steps of TLBO involve initializing a population, evaluating fitness, selecting the best solution as teacher, and updating the population through teacher and learner phases until termination criteria is met. The document proposes using number of users and virtual machines as parameters for TLBO scheduling in cloud computing. MATLAB simulation results show the initial and final iterations converging to an optimal scheduling solution.
A Survey on Service Request Scheduling in Cloud Based Architecture
A Survey on Service Request Scheduling in Cloud Based ArchitectureIJSRD The document discusses service request scheduling in cloud-based architecture, highlighting the importance of resource management and job scheduling to enhance performance and reduce response time. Various scheduling algorithms, such as First Come First Served (FCFS), Static Priority Scheduling Algorithm (SPSA), and Dynamic Priority Scheduling Algorithm (DPSA), are reviewed, with a focus on the advantages and disadvantages of each. The paper concludes that while DPSA offers better treatment for lower priority tasks, there is potential for further improvements in scheduling algorithms.
A BAYE'S THEOREM BASED NODE SELECTION FOR LOAD BALANCING IN CLOUD ENVIRONMENT
A BAYE'S THEOREM BASED NODE SELECTION FOR LOAD BALANCING IN CLOUD ENVIRONMENThiij This paper proposes a heuristic approach based on Bayes' theorem for optimal node selection in load balancing within cloud computing environments. The method, referred to as Bayesian Node Selection for Load Balancing (BNSLB), improves performance by reducing task cancellation rates and enhancing throughput compared to traditional methods such as round robin. Simulation results demonstrate that the BNSLB approach offers more efficient resource utilization and better overall service performance.
A Baye's Theorem Based Node Selection for Load Balancing in Cloud Environment
A Baye's Theorem Based Node Selection for Load Balancing in Cloud Environmentneirew J The paper presents a Baye's theorem-based approach for optimal node selection aimed at improving load balancing in cloud computing environments. The proposed method, tested using CloudSim, demonstrates enhanced task deployment performance and resource utilization compared to existing load balancing techniques, particularly the Round Robin method. Results indicate that the Baye's theorem method reduces task cancellations and improves overall throughput in cloud node operations.
An optimized scientific workflow scheduling in cloud computing
An optimized scientific workflow scheduling in cloud computingDIGVIJAY SHINDE The document discusses optimizing scientific workflow scheduling in cloud computing. It begins with definitions of workflow and cloud computing. Workflow is a group of repeatable dependent tasks, while cloud computing provides applications and hardware resources over the Internet. There are three cloud service models: SaaS, PaaS, and IaaS. The document explores how to efficiently schedule workflows in the cloud to reduce makespan, cost, and energy consumption. It reviews different scheduling algorithms like FCFS, genetic algorithms, and discusses optimizing objectives like time and cost. The document provides a literature review comparing various workflow scheduling methods and algorithms. It concludes with discussing open issues and directions for future work in optimizing workflow scheduling for cloud computing.
Task Scheduling methodology in cloud computing
Task Scheduling methodology in cloud computing Qutub-ud- Din This document outlines a proposed methodology for developing efficient task scheduling strategies in cloud computing. It begins with introductions to cloud computing and task scheduling. It then reviews several relevant existing task scheduling algorithms from literature that focus on objectives like reducing costs, minimizing completion time, and maximizing resource utilization. The problem statement indicates the goals are to reduce costs, minimize completion time, and maximize resource allocation. An overview of the proposed methodology's flow is then provided, followed by references.
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTINGijccsa This document presents a study on load balancing algorithms in cloud computing aimed at improving response times at both physical and virtual server levels. The proposed virtual machine-level load balancing algorithm is designed to optimize average response and processing times, and is compared with existing algorithms like maxmin and throttled, demonstrating enhanced performance. The paper details the theoretical foundation, algorithm design, and simulation results to validate the proposed method's effectiveness.
cloud schedualing
cloud schedualingtwomarkopolo This document proposes a new Ranking Chaos Optimization (RCO) algorithm to solve the dual scheduling problem of cloud services and computing resources (DS-CSCR) in private clouds. It introduces the DS-CSCR concept and models the characteristics of cloud services and computing resources. The RCO algorithm uses ranking selection, individual chaos, and dynamic heuristic operators. Experimental results show RCO has better searching ability, time complexity, and stability compared to other algorithms for solving DS-CSCR. Future work is needed to study additional quality of service properties and improve RCO for other optimization problems.
Ijebea14 287
Ijebea14 287Iasir Journals This document presents a policy-driven architecture for effective service allocation in cloud environments. It begins with an introduction to cloud computing and discusses challenges of scheduling client requests and allocating services as the number of clients increases. It then reviews previous research on resource allocation and process scheduling in distributed cloud systems. The paper proposes a service allocation model and policy-based architecture to address these challenges through effective identification of cloud and client characteristics. This would allow for reliable and efficient allocation of services to clients. The conclusion discusses evaluating the proposed architecture.
REAL-TIME ADAPTIVE ENERGY-SCHEDULING ALGORITHM FOR VIRTUALIZED CLOUD COMPUTING
REAL-TIME ADAPTIVE ENERGY-SCHEDULING ALGORITHM FOR VIRTUALIZED CLOUD COMPUTINGijdpsjournal The paper presents a real-time adaptive energy-scheduling (RTAES) algorithm aimed at optimizing energy consumption and computation time in virtualized cloud computing environments. By utilizing dynamic voltage and frequency scaling (DVFS), the RTAES algorithm minimizes energy and execution costs while meeting quality of service requirements for computationally intensive tasks. The proposed model demonstrates improved effectiveness, scalability, and power consumption metrics compared to existing solutions.
IRJET- Time and Resource Efficient Task Scheduling in Cloud Computing Environ...
IRJET- Time and Resource Efficient Task Scheduling in Cloud Computing Environ...IRJET Journal This document summarizes a research paper that proposes a Task Based Allocation (TBA) algorithm to efficiently schedule tasks in a cloud computing environment. The algorithm aims to minimize makespan (completion time of all tasks) and maximize resource utilization. It first generates an Expected Time to Complete (ETC) matrix that estimates the time each task will take on different virtual machines. It then sorts tasks by length and allocates each task to the VM that minimizes its completion time, updating the VM wait times. The algorithm is evaluated using CloudSim simulation and is shown to reduce makespan, execution time and costs compared to random and first-come, first-served scheduling approaches.
call for papers, research paper publishing, where to publish research paper, ...
call for papers, research paper publishing, where to publish research paper, ...International Journal of Engineering Inventions www.ijeijournal.com
Similar to Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters (20)
A novel scheduling algorithm for cloud computing environment
A novel scheduling algorithm for cloud computing environmentSouvik Pal The document describes a proposed genetic algorithm-based scheduling approach for cloud computing environments. It aims to minimize waiting time and queue length. The algorithm first permutes task burst times and finds minimum waiting times using FCFS and genetic algorithms. It then applies a queuing model to the sequences with minimum waiting time from each approach. Experimental results on 4 sample tasks show the genetic algorithm reduces waiting time compared to FCFS. The genetic operators of selection, crossover and mutation are applied to evolve optimal task scheduling sequences.
D04573033
D04573033IOSR-JEN This document provides an overview of scheduling mechanisms in cloud computing. It discusses task scheduling, gang scheduling based on performance and cost evaluation, and resource scheduling. For task scheduling, it describes classifying tasks based on quality of service parameters and MapReduce level scheduling. It then explains two gang scheduling algorithms - Adaptive First Come First Serve (AFCFS) and Largest Job First Serve (LJFS) - and how they are used to evaluate performance and cost. Finally, it briefly discusses resource scheduling and factors that affect scheduling mechanisms in cloud computing like efficiency, fairness, costs, and communication patterns.
REVIEW PAPER on Scheduling in Cloud Computing
REVIEW PAPER on Scheduling in Cloud ComputingJaya Gautam This document reviews scheduling algorithms for workflow applications in cloud computing. It discusses characteristics of cloud computing, deployment and service models, and the importance of scheduling in cloud computing. The document analyzes several scheduling algorithms proposed in literature that consider parameters like makespan, cost, load balancing, and priority. It finds that algorithms like Max-Min, Min-Min, and HEFT perform better than traditional algorithms in optimizing these parameters for workflow scheduling in cloud environments.
QoS Based Scheduling Techniques in Cloud Computing: Systematic Review
QoS Based Scheduling Techniques in Cloud Computing: Systematic ReviewIJCSIS Research Publications This document is a systematic review of QoS-based scheduling techniques in cloud computing, analyzing various resource scheduling methodologies using soft computing techniques. It discusses the importance of scheduling for enhancing resource utilization and overall performance while addressing the challenges associated with efficiently meeting different QoS requirements. The review covers several techniques, including neural networks, fuzzy logic, and genetic algorithms, providing insights into their applications and effects on scheduling efficiency.
Dynamic Three Stages Task Scheduling Algorithm on Cloud Computing
Dynamic Three Stages Task Scheduling Algorithm on Cloud ComputingIJCSIS Research Publications This paper introduces a dynamic three-stage task scheduling algorithm for cloud computing that aims to optimize resource utilization and minimize task waiting times. The algorithm conducts task classification, prioritizes tasks based on deadlines, and dynamically pairs tasks with virtual machines (VMs) for efficient execution. Simulation results demonstrate its superior performance compared to traditional algorithms in terms of average waiting time, makespan, and VM utilization.
A Survey on Service Request Scheduling in Cloud Based Architecture
A Survey on Service Request Scheduling in Cloud Based ArchitectureIJSRD This document surveys service request scheduling in cloud computing, emphasizing the importance of resource management due to increasing user demands. It discusses various job scheduling algorithms, particularly focusing on dynamic priority scheduling, and contrasts them with methods like First Come First Served and static priority scheduling. The findings indicate that while dynamic priority scheduling improves fairness for lower priority tasks, there is still room for enhancing efficiency in cloud architecture.
A survey of various scheduling algorithm in cloud computing environment
A survey of various scheduling algorithm in cloud computing environmenteSAT Journals The document surveys various scheduling algorithms used in cloud computing, emphasizing the importance of efficient job scheduling for resource utilization and cost-effectiveness. It categorizes scheduling algorithms into static and dynamic types, discussing existing techniques like batch mode and online mode heuristics. The paper concludes that while current algorithms provide high throughput and cost efficiency, improvements are needed in reliability and availability.
A survey of various scheduling algorithm in cloud computing environment
A survey of various scheduling algorithm in cloud computing environmenteSAT Publishing House The document surveys various scheduling algorithms in cloud computing, highlighting their significance for efficient resource utilization and minimizing communication costs. It categorizes scheduling algorithms into static and dynamic types, detailing specific algorithms like First Come First Serve and Round Robin, and discusses improvements through new methods like Resource-Aware Scheduling Algorithm (RASA) and others. The analysis emphasizes the need for reliable and available scheduling solutions to enhance performance and address critical issues in cloud environments.
An efficient cloudlet scheduling via bin packing in cloud computing
An efficient cloudlet scheduling via bin packing in cloud computingIJECEIAES This study presents a novel approach to task scheduling in cloud computing by transforming the problem into a bin packing problem. Three modified bin packing algorithms were proposed, showing significant improvements in metrics such as waiting time and makespan compared to traditional algorithms like particle swarm optimization and first come first serve. The results, validated through simulations using CloudSim, indicate enhanced resource utilization and reduced execution times, ultimately optimizing cloud service delivery.
IRJET- Scheduling of Independent Tasks over Virtual Machines on Computati...
IRJET- Scheduling of Independent Tasks over Virtual Machines on Computati...IRJET Journal This document discusses scheduling independent tasks over virtual machines in a cloud computing environment. It compares the performance of four scheduling algorithms: First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin, and Particle Swarm Optimization (PSO). The algorithms are tested on virtual machines with 1, 2, and 4 CPU cores. PSO consistently achieves the shortest makespan (task completion time). While FCFS, SJF, and Round Robin perform similarly on single-core and dual-core VMs, Round Robin's performance degrades on quad-core VMs likely due to core collision issues. Overall, PSO schedules tasks most efficiently across all virtual machine configurations.
Scheduling in cloud
Scheduling in cloudDr.Manjunath Kotari The document discusses various scheduling techniques in cloud computing. It begins with an introduction to scheduling and its importance in cloud computing. It then covers traditional scheduling approaches like FCFS, priority queue, and shortest job first. The document also presents job scheduling frameworks, dynamic and fault-tolerant scheduling, deadline-constrained scheduling, and inter-cloud meta-scheduling. It concludes with the benefits of effective scheduling in improving service quality and resource utilization in cloud environments.
Stochastic Scheduling Algorithm for Distributed Cloud Networks using Heuristi...
Stochastic Scheduling Algorithm for Distributed Cloud Networks using Heuristi...Eswar Publications The document presents a high-performance hyper-heuristic scheduling algorithm (HHSA) designed to optimize task scheduling in distributed cloud networks. It introduces innovative detection operators to enhance the effectiveness of existing scheduling methods, aiming to reduce the makespan in both sequence-dependent and independent scenarios. The results demonstrate that HHSA significantly outperforms traditional and other heuristic scheduling algorithms in terms of efficiency and resource management.
Qo s aware scientific application scheduling algorithm in cloud environment
Qo s aware scientific application scheduling algorithm in cloud environmentAlexander Decker This document summarizes a research paper that proposes a scheduling algorithm for scientific applications in cloud environments. The algorithm aims to schedule tasks in workflows based on user preferences for quality of service (QoS), like time and cost. It ranks tasks and uses an UPFF function to select resources that meet the user's desired QoS. The algorithm is compared to other similar algorithms through scenarios, and results show it has better efficiency. The full paper provides more details on scientific workflows, cloud computing, related work on workflow scheduling algorithms, and defines the problem of scheduling tasks to resources while considering costs and times.
Qo s aware scientific application scheduling algorithm in cloud environment
Qo s aware scientific application scheduling algorithm in cloud environmentAlexander Decker The document describes a QoS-aware scientific application scheduling algorithm for cloud environments. It proposes an algorithm that ranks tasks in a workflow and uses a user preference fitness function to select resources based on the user's desired quality of service, such as time and cost. The algorithm is compared to other similar works through several scenarios, and results show the proposed algorithm has better efficiency. Key aspects considered include task dependencies, data sizes, compute times, data transfer times, workflow makespan, resource costs and attributes.
A cloud computing scheduling and its evolutionary approaches
A cloud computing scheduling and its evolutionary approachesnooriasukmaningtyas The document discusses resource scheduling algorithms in cloud computing, highlighting the challenges and importance of scheduling in improving system performance. It reviews various scheduling methods, their advantages and disadvantages, and emphasizes the ongoing need for effective solutions to ensure quality of service and resource utilization. The study serves as a comprehensive guide for researchers in selecting appropriate algorithms for specific workloads.
A STUDY ON JOB SCHEDULING IN CLOUD ENVIRONMENT
A STUDY ON JOB SCHEDULING IN CLOUD ENVIRONMENTpharmaindexing This document discusses job scheduling algorithms in cloud computing environments. It begins with an introduction to cloud computing and job scheduling challenges. It then reviews several existing job scheduling algorithms that aim to minimize completion time and costs while improving performance and quality of service. These algorithms use approaches like genetic algorithms, priority queues, and workload prediction. The document also discusses issues like priority-based scheduling and balancing mixed workloads. Overall, the document analyzes the problem of job scheduling in clouds and surveys different proposed scheduling algorithms and their objectives.
Providing a multi-objective scheduling tasks by Using PSO algorithm for cost ...
Providing a multi-objective scheduling tasks by Using PSO algorithm for cost ...Editor IJCATR This document discusses a multi-objective scheduling method using a Particle Swarm Optimization (PSO) algorithm aimed at cost management in cloud computing. It emphasizes the scheduling of tasks while considering migration costs and presents simulations involving different numbers of tasks and vehicles. The findings demonstrate the efficacy of the proposed method in task division within cloud computing environments.
A Review on Scheduling in Cloud Computing
A Review on Scheduling in Cloud Computingijujournal This document provides a comprehensive review of various scheduling techniques in cloud computing, highlighting their role in optimizing task completion and energy efficiency. It discusses multiple scheduling algorithms, their parameters, and applications such as cloud gaming and real-time task management, as well as the relationship between resource utilization and energy consumption. The authors focus on different scheduling challenges and present solutions to improve performance and reliability in cloud environments.
A Review on Scheduling in Cloud Computing
A Review on Scheduling in Cloud Computingijujournal This document reviews scheduling techniques in cloud computing. It discusses key concepts like virtualization and different scheduling algorithms. The review surveys various scheduling algorithms for tasks, workflows, real-time applications and energy optimization. It analyzes algorithms for load balancing, fault tolerance and resource utilization to improve performance metrics like makespan, cost and energy consumption. The document concludes that effective scheduling is important in cloud computing to provide on-demand services and complete tasks accurately and on time.
A Review on Scheduling in Cloud Computing
A Review on Scheduling in Cloud Computingijujournal This document reviews scheduling techniques in cloud computing. It discusses key concepts like virtualization and different scheduling algorithms. The review surveys various scheduling algorithms for tasks, workflows, real-time applications and energy efficiency. It analyzes algorithms based on parameters like makespan, cost, energy consumption and concludes many algorithms can improve resource utilization and performance while reducing energy costs.
Ad
More from iosrjce (20)
An Examination of Effectuation Dimension as Financing Practice of Small and M...
An Examination of Effectuation Dimension as Financing Practice of Small and M...iosrjce This study examines the effectuation framework as a financing practice for small and medium enterprises (SMEs) in Southwestern Nigeria, highlighting how local entrepreneurs utilize internal financing to navigate the challenges posed by formal financial institutions. Using a mixed-method approach, the research finds a strong reliance on internal funding and effectuation logics among entrepreneurs to achieve their business objectives. The study emphasizes the importance of recognizing alternative financing approaches that align with the cultural practices of local SMEs in developing contexts.
Does Goods and Services Tax (GST) Leads to Indian Economic Development?
Does Goods and Services Tax (GST) Leads to Indian Economic Development?iosrjce The document discusses the implementation and impact of the Goods and Services Tax (GST) in India, emphasizing its role as a comprehensive tax reform aimed at unifying the indirect tax structure by replacing multiple taxes with a single national tax. GST is expected to promote economic development, improve tax collections, and create a business-friendly environment, although challenges such as political resistance and compliance complexities remain. The study outlines the potential benefits and disadvantages of GST on various sectors, particularly highlighting its anticipated effects on inflation, revenue generation, and economic growth.
Childhood Factors that influence success in later life
Childhood Factors that influence success in later lifeiosrjce This study investigates the influence of 44 childhood environmental factors on adult success, measured by financial and career goal attainment among 334 professionals. It identifies 19 significant predictors of success, including exposure to successful adults and supportive parenting. The findings aim to provide parents with empirically-based guidance on fostering children's success.
Emotional Intelligence and Work Performance Relationship: A Study on Sales Pe...
Emotional Intelligence and Work Performance Relationship: A Study on Sales Pe...iosrjce This study investigates the relationship between emotional intelligence and work performance among sales personnel in organized retail stores in Karnataka, India. It highlights that emotional intelligence significantly correlates with work performance and suggests training to enhance emotional intelligence within retail organizations. The research employs both exploratory and descriptive methods, utilizing questionnaires to measure emotional intelligence and performance indicators.
Customer’s Acceptance of Internet Banking in Dubai
Customer’s Acceptance of Internet Banking in Dubaiiosrjce The paper examines the acceptance of internet banking in Dubai, identifying convenience, safety, and security as key drivers for adoption, while highlighting barriers such as poor internet quality and lack of familiarization with technology. Based on a survey of 227 respondents, it suggests measures to enhance internet banking operations. The study also reviews varying customer attitudes across different regions regarding online banking services.
A Study of Employee Satisfaction relating to Job Security & Working Hours amo...
A Study of Employee Satisfaction relating to Job Security & Working Hours amo...iosrjce The study examines employee satisfaction regarding job security and working hours at top travel companies in Delhi and Mumbai, finding that employees generally feel secure in their jobs but are dissatisfied with long working hours, particularly in Mumbai. While 56% of employees reported job security satisfaction, only 10% expressed satisfaction with working hours, leading to the conclusion that dissatisfaction with working hours is significant. Recommendations include hiring more staff and increasing shifts to address overwork issues.
Consumer Perspectives on Brand Preference: A Choice Based Model Approach
Consumer Perspectives on Brand Preference: A Choice Based Model Approachiosrjce This study examines consumer preferences between international, national, and isolated brands in the Indian market, utilizing a multinomial discrete choice model to identify key product attributes influencing decisions. It highlights the complexity of brand dynamics in emerging markets, where both cultural differences and market saturation affect consumer choices. The findings provide valuable insights for managers regarding brand positioning and marketing strategies in competitive environments.
Student`S Approach towards Social Network Sites
Student`S Approach towards Social Network Sitesiosrjce The document discusses a study on the use of social network sites among male and female undergraduate students in Saudi Arabia, highlighting similarities in their usage patterns. It reveals that students primarily engage with these platforms for entertainment and connecting with others, with a significant number also recognizing their potential for professional networking and advertising. The research method involved distributing questionnaires to 200 students, analyzing their responses through statistical software to gauge their attitudes towards social media.
Broadcast Management in Nigeria: The systems approach as an imperative
Broadcast Management in Nigeria: The systems approach as an imperativeiosrjce The document discusses various approaches to management within the context of broadcasting in Nigeria, highlighting the relevance of the systems approach for effectively managing broadcasting organizations. It analyzes the classical, human angle, and modern schools of management, emphasizing the importance of adapting management techniques to the unique environment of developing societies. Recommendations are made for implementing best practices in broadcast management to ensure efficiency, productivity, and compliance with regulations.
A Study on Retailer’s Perception on Soya Products with Special Reference to T...
A Study on Retailer’s Perception on Soya Products with Special Reference to T...iosrjce This study investigates retailer perceptions of consumer behavior and preferences regarding soya products in Thiruvallur district, highlighting the nutritional value of soya and the impact of market dynamics on sales. It reflects that Indian consumers are increasingly aware of product quality and healthy options, with recommendations for manufacturers to improve awareness and support among retailers. The findings indicate a positive consumer attitude towards soya products, emphasizing the importance of effective promotional strategies and strong retailer-vendor relationships.
A Study Factors Influence on Organisation Citizenship Behaviour in Corporate ...
A Study Factors Influence on Organisation Citizenship Behaviour in Corporate ...iosrjce The research paper examines the factors influencing Organizational Citizenship Behavior (OCB) within corporate sectors, emphasizing its significance for enhancing organizational effectiveness and employee engagement. It identifies job satisfaction and motivation as key determinants of OCB, utilizing data collected from 250 employees across four corporate sectors. The study concludes that individual, organizational, and leadership characteristics positively impact OCB, contributing to improved morale and organizational performance.
Consumers’ Behaviour on Sony Xperia: A Case Study on Bangladesh
Consumers’ Behaviour on Sony Xperia: A Case Study on Bangladeshiosrjce The document analyzes consumer behavior towards Sony Xperia smartphones in Bangladesh, revealing a significant decline in the brand's popularity compared to rivals like Samsung and iPhone. A survey conducted in Dhaka indicates that factors such as brand prestige and mobile performance are critical in consumers' smartphone preferences, with many opting for more affordable local brands. The study highlights the urgent need for strategic planning by Sony to regain market traction amid diminishing consumer interest.
Design of a Balanced Scorecard on Nonprofit Organizations (Study on Yayasan P...
Design of a Balanced Scorecard on Nonprofit Organizations (Study on Yayasan P...iosrjce 1. The document describes a study that designed a balanced scorecard for a nonprofit organization called Yayasan Pembinaan dan Kesembuhan Batin (YPKB) in Malang, Indonesia.
2. The balanced scorecard translated YPKB's vision and mission into strategic objectives across four perspectives: financial, customer, internal processes, and learning and growth.
3. Key strategic objectives included donation growth, budget effectiveness, customer satisfaction, reputation, service quality, innovation, and employee development. Customers perspective had the highest weighting, suggesting a focus on public service over financial growth.
Public Sector Reforms and Outsourcing Services in Nigeria: An Empirical Evalu...
Public Sector Reforms and Outsourcing Services in Nigeria: An Empirical Evalu...iosrjce This study evaluates the effectiveness of public sector outsourcing in Nigeria since its implementation in 2004 as a cost-saving measure during economic recession. Findings indicate a positive impact on service quality and effectiveness, but no evidence of cost reduction, accountability, or transparency. The authors recommend a review of outsourcing policies to enhance cost-saving benefits while maintaining service quality.
Media Innovations and its Impact on Brand awareness & Consideration
Media Innovations and its Impact on Brand awareness & Considerationiosrjce This document analyzes the impact of media innovations on brand awareness and consumer consideration in marketing. It highlights successful case studies from companies like Volkswagen, Coca-Cola, Unilever, and Fevicol, showcasing how innovative media strategies enhance brand recognition and consumer engagement. The study emphasizes the importance of adapting marketing approaches to changing consumer behaviors and leveraging media creatively to build strong brand images.
Customer experience in supermarkets and hypermarkets – A comparative study
Customer experience in supermarkets and hypermarkets – A comparative studyiosrjce - The document examines customer experience in supermarkets and hypermarkets in India through a survey of 418 customers.
- It finds that in supermarkets, previous experience, atmosphere, price, social environment and experience in other channels most influence customer experience, while in hypermarkets, previous experience, product assortment, social environment and experience in other channels are most influential.
- The study provides insights for retailers on key determinants of customer experience in each format to help them improve strategies and competitive positioning.
Social Media and Small Businesses: A Combinational Strategic Approach under t...
Social Media and Small Businesses: A Combinational Strategic Approach under t...iosrjce This document analyzes the role of social media in assisting small businesses during economic crises, suggesting that social media can provide strategic solutions for growth and survival. It highlights the challenges small businesses face and emphasizes their importance in driving economic activity. The paper presents statistical evidence supporting the effectiveness of social media for marketing and engagement, especially when businesses seek to overcome financial difficulties.
Secretarial Performance and the Gender Question (A Study of Selected Tertiary...
Secretarial Performance and the Gender Question (A Study of Selected Tertiary...iosrjce This study investigates the impact of gender on the job performance of secretaries at two state-owned universities in Rivers State, Nigeria, using a sample of 32 secretaries. Results indicate significant differences in performance based on gender, with male secretaries excelling in computer operations and meeting organization, while female secretaries perform better in staff supervision and handling office materials. The findings underscore the need for a reconsideration of gender biases in the professional assessment of secretaries.
Implementation of Quality Management principles at Zimbabwe Open University (...
Implementation of Quality Management principles at Zimbabwe Open University (...iosrjce This document discusses the implementation of quality management principles at Zimbabwe Open University's Matabeleland North Regional Centre. It begins with background information on ZOU and the importance of quality management in open and distance learning institutions. The study aimed to determine if quality management and its principles were being implemented at the regional centre. Key findings included that the centre prioritized customer focus and staff involvement. Decisions were made based on data analysis. The regional centre implemented a quality system informed by its policy documents. The document recommends ensuring staffing levels match needs and providing sufficient resources to the regional centre.
Organizational Conflicts Management In Selected Organizaions In Lagos State, ...
Organizational Conflicts Management In Selected Organizaions In Lagos State, ...iosrjce The study investigates organizational conflict management in selected organizations in Lagos State, Nigeria, focusing on positive management behaviors that foster motivated and harmonious teams. Using a descriptive survey design and systematic random sampling, the research highlights the significance of accessibility and follow-up procedures in conflict management, emphasizing the need for proactive strategies to resolve disputes. The findings suggest that effective conflict management processes can enhance organizational harmony and prevent disruption, while also addressing the financial and personal costs of unresolved conflicts.
Ad
Recently uploaded (20)
Abraham Silberschatz-Operating System Concepts (9th,2012.12).pdf
Abraham Silberschatz-Operating System Concepts (9th,2012.12).pdfShabista Imam Complete book of operating system edition 9
FUNDAMENTALS OF COMPUTER ORGANIZATION AND ARCHITECTURE
FUNDAMENTALS OF COMPUTER ORGANIZATION AND ARCHITECTUREShabista Imam FUNDAMENTALS OF COMPUTER ORGANIZATION AND ARCHITECTURE
By : Mostafa Abd-El-Barr & Hesham El-Rewini:: wiley
A complete guidance book
ElysiumPro Company Profile 2025-2026.pdf
ElysiumPro Company Profile 2025-2026.pdfinfo751436 Description
ElysiumPro | IEEE Final Year Projects | Best Internship Training | Inplant Training in Madurai
Best Final Year project training center
Address:
First Floor, A Block, 'Elysium Campus, 229, Church Rd, Vaigai Colony, Madurai, Tamil Nadu 625020
Plus Code:
W4CX+56 Madurai, Tamil Nadu
+91 9944793398
[email protected]
Elysium Group of Companies established ElysiumPro in 2001. Since its inception, it has been the most sought-after destination for final year project development and research papers among the students. Our commitment to providing quality project training & documentation to students has always been exceptional. We deliver the final year engineering projects and technical documents that provide extra edge and industry exposure to land prestigious jobs and reputed institutions for higher studies. Students from all over the country avail of our services for their final year projects. On average, we develop 5000+ projects and research papers per year on varied advanced domains. Python, JAVA, PHP, Android, Matlab, LabView, VLSI, SIMULINK, Power electronics, Power System, Antenna, Machine Learning, Deep Learning, Data Science, Artificial Intelligence, data Mining, Big Data, Cloud Computing, IoT,
Hours of Operation: -
Sunday 10am-1pm
Monday 7.30am-8pm
Tuesday 7.30am-8pm
Wednesday 7.30am-8pm
Thursday 7.30am-8pm
Friday 7.30am-8pm
Saturday 7.30am-8pm
Web Site:
https://elysiumpro.in/
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Youtube Geotagged Video:
https://youtu.be/QULY6XfuMyo
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Slideshow Images (Google Photos):
https://photos.app.goo.gl/hVwQJtkeptA1JZKd9
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
GBP Listing:
https://goo.gl/maps/6d6hko6TsDYyeDrz9
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Serving Areas:
https://www.google.com/maps/d/edit?mid=1-fsZogBiEAcjGP_aDyI0UKKIcwVUWfo&usp=sharing
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Google Site:
https://elysiumpro-project-center.business.site
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Google Sheet: https://docs.google.com/spreadsheets/d/1uXA07zxrUx2FCnBZWH80PpBZQrrX-2q1UBBe_0k3Yeo
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Google Document: https://docs.google.com/document/d/1BU4ZHW_41XJm2lvTq9pWYUpZILAEmF9dWEw7-DBbWoE
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Google Slides: https://docs.google.com/presentation/d/1uF8q6ueJWcAnhKTQsZxLE0Bo9PwgRNwCeuGV_ZgbSyU
*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Fundamentals of Digital Design_Class_12th April.pptx
Fundamentals of Digital Design_Class_12th April.pptxdrdebarshi1993 Boolean Algebra and Combinational Logic Circuit
May 2025: Top 10 Read Articles in Data Mining & Knowledge Management Process
May 2025: Top 10 Read Articles in Data Mining & Knowledge Management ProcessIJDKP Data mining and knowledge discovery in databases have been attracting a significant amount of research, industry, and media attention of late. There is an urgent need for a new generation of computational theories and tools to assist researchers in extracting useful information from the rapidly growing volumes of digital data.
This Journal provides a forum for researchers who address this issue and to present their work in a peer-reviewed open access forum. Authors are solicited to contribute to the Journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to these topics only.
Tesla-Stock-Analysis-and-Forecast.pptx (1).pptx
Tesla-Stock-Analysis-and-Forecast.pptx (1).pptxmoonsony54 this is data science ppt for tesla stock (linear regression)
Introduction to Natural Language Processing - Stages in NLP Pipeline, Challen...
Introduction to Natural Language Processing - Stages in NLP Pipeline, Challen...resming1 Lecture delivered in 2021. This gives an introduction to Natural Language Processing. It describes the use cases of NLP in daily life. It discusses the stages in NLP Pipeline. It highlights the challenges involved covering the different levels of ambiguity that could arise. It also gives a brief note on the present scenario with the latest language models, tools and frameworks/libraries for NLP.
International Journal of Advanced Information Technology (IJAIT)
International Journal of Advanced Information Technology (IJAIT)ijait International journal of advanced Information technology (IJAIT) is a bi monthly open access peer-
reviewed journal, will act as a major forum for the presentation of innovative ideas, approaches,
developments, and research projects in the area advanced information technology applications and
services. It will also serve to facilitate the exchange of information between researchers and industry
professionals to discuss the latest issues and advancement in the area of advanced IT. Core areas of
advanced IT and multi-disciplinary and its applications will be covered during the conferences.
Decoding Kotlin - Your Guide to Solving the Mysterious in Kotlin - Devoxx PL ...
Decoding Kotlin - Your Guide to Solving the Mysterious in Kotlin - Devoxx PL ...João Esperancinha Kotlin can be very handy and easy to use. Kotlin offers the possibility to develop code that is easy to understand, safe, immutable, and thus predictable and follows standards that avoid side effects. I realized that very quickly after I started my Kotlin journey that already amounts to more than 5 years.
This is the third version of this presentation focused on more detail explaining inline, crossinline, tailrec and as a bonus a quick run through unnamed classes.
Structured Programming with C++ :: Kjell Backman
Structured Programming with C++ :: Kjell BackmanShabista Imam Step into the world of high-performance programming with the Complete Guidance Book of C++ Programming—a definitive resource for mastering one of the most powerful and versatile languages in computer science.
Whether you're a beginner looking to learn the fundamentals or an intermediate developer aiming to sharpen your skills, this book walks you through C++ from the ground up. You'll start with basics like variables, control structures, and functions, then progress to object-oriented programming (OOP), memory management, file handling, templates, and the Standard Template Library (STL).
(Continuous Integration and Continuous Deployment/Delivery) is a fundamental ...
(Continuous Integration and Continuous Deployment/Delivery) is a fundamental ...ketan09101 (Continuous Integration and Continuous Deployment/Delivery) is a fundamental practice in DevOps that streamlines software development and deployment.
Complete University of Calculus :: 2nd edition
Complete University of Calculus :: 2nd editionShabista Imam Master the language of change with the Complete Guidance Book of Calculus—your comprehensive resource for understanding the core concepts and applications of differential and integral calculus. Designed for high school, college, and self-study learners, this book takes a clear, intuitive approach to a subject often considered challenging.
Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters
- 1. IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 6, Ver. III (Nov – Dec. 2015), PP 35-38 www.iosrjournals.org DOI: 10.9790/0661-17633538 www.iosrjournals.org 35 | Page Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters Dhanmeet Singh Kalra1, Mohit Pal Singh Birdi2 CSE Department Guru Nanak Dev University Regional Campus Jalandhar, INDIA Abstract: Cloud computing is a new design structure for large, distributed data centers. Cloud computing system promises to offer end user “pay as go” model. To meet the expected quality requirements of users, cloud computing need to offer differentiated services to users. QoS differentiation is very important to satisfy different users with different QoS requirements. In this paper, various QoS based scheduling algorithms, scheduling parameters and the future scope of discussed algorithms have been studied. This paper summarizes various cloud scheduling algorithms, findings of algorithms, scheduling factors, type of scheduling and parameters considered. Keywords- Cloud Scheduling, algorithms, Quality of service (QoS), Qda scheduling algorithm, Improved Cost Based, PAPRIKA, ANT Colony, Cmultiqosschedule algorithm, SHEFT Workflow , Job scheduling algorithm based on berger model. I. Introduction Cloud computing is the rising techNology that delivers infrastructure as a service [IaaS], software as a service[SAAS], platform as a service[PAAS] [1]. Cloud computing began to develop at end of 2007. It allows customers to use application without buying any software and hardware and access the files at any computer using internet. Cloud computing has become an interesting way of changing the whole computing through internet. Cloud computing is a model that combines various resources from data center into outside services. Scheduler for cloud computing checks the availability of processing resources on which task should be allotted. Service providers ensure that income is utilized to their fullest so that resource power is Not left unused. Scheduling is a critical problem in Cloud computing, because a cloud provider has to serve many users according to their different needs. Scheduling in cloud computing is of various types: task scheduling, workflow scheduling, resource scheduling, job scheduling etc. Many researchers proposed various scheduling algorithms to achieve load balancing and fairness among users. Because of different QoS parameters like cost, waiting time, execution time, trust etc., scheduling in cloud computing is different from other scheduling environment like grid and distributed scheduling. The demand of resources changes dynamically and scheduling becomes very difficult. QoS is the collective effort of service performance, which determines the degree of user satisfaction for services [2]. The cloud computing environment provides a different platform by creating a virtual machine that assists users in accomplishing their jobs within a reasonable time and cost effectively without sacrificing the quality of the services [3]. The main task is to efficiently and reasonably allocate the user’s needs to available resources according to the QoS from both cloud side and user side. The paper is organized as follows: section II gives a review on some scheduling techniques based on different. QoS parameters, section III shows the comparison of various algorithms by taking different parameters and future scope of discussed algorithms, section IV shows the metrics of various parameters and section V concludes the paper. II. Related work A. QDA scheduling algorithm Luzhang et.al [4] proposed a QDA scheduling algorithm using cloud workflow as a background. Algorithm works on instance-intensive workflow scheduling optimization problem. By combining staggered sub-deadline allocation criteria and differentiate tasks based on QoS preferences of users, QDA algorithm is proposed. It takes many QoS parameters like time, cost, bandwidth, reliability, quantifies them with particular value and use them in QoS based sub-deadline allocation algorithm to meet complete QoS user satisfaction. QDA algorithm simulates on cloudsim new program function called BindcloudToVmByDeadline. By taking QoS utility function into account, QDA algorithm performs better in case of execution time, user satisfaction and load balancing.
- 2. Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters DOI: 10.9790/0661-17633538 www.iosrjournals.org 36 | Page B. Improved Cost Based Scheduling algorithm In [5] paper author proposed the approach that is improved cost-based scheduling algorithm. It measured computation performance and resource cost. It also increased execution data transfer ratio by combining the tasks. C. PAPRIKA Hilda Lawrance and Dr. Salaja Silas[6] proposed a task based scheduling of resources called potentially all pair-wise rankings of all possible alternatives (PAPRIKA). By taking various QoS parameters into account, tasks and resources are arranged according to user satisfaction and PAPRIKA method. According to resources and tasks QoS parameter values, resources and Task matrix is created respectively. PAPRIKA method is based on overall ranking of all possible alternative values. Resource priority is calculated by allocating a threshold value to all QoS parameters, comparing all resources pair-wise with threshold value and finding priority of each resource. Task from task line is taken and allocate tasks to resources according to the user satisfaction. PAPRIKA method proves better result in case of task completion time and resource utility rate. Resource utility rate of PAPRIKA method is higher when compare with S-CSRSA[11] algorithm. D. ANT Colony Algorithm The author proposed a poised Ant colony algorithm [7] which uses a pseudo random proportional rule to poise the integral organization load while completing all the jobs at hand as soon as possible according to the environmental status. This algorithm balances the workload as well as minimizing the make span. E. CMultiQoSSchedule algorithm Due to restriction that most scheduling algorithm takes only time and cost as QoS parameters, Wenjuan Li et.al[8] proposed a new Novel based scheduling algorithm based on trust values. This approach used the trust parameter for workflow scheduling in cloud. Novel workflow scheduling is divided into two stages that is macro and micro. Trust value is calculated from both provider side and user side. On cloud provider side, trust agents manage the trust relationship by differentiating trust domains according to existing cloud platform. Cloud customers take help of intermediate institution to manage trust relationships. Using trust mechanism author proposed a single workflow scheduling algorithm under time and cost constraints. It also introduced fuzzy clustering method to classify workflow process. Cloudsim tool with extended features is used to simulate results. This approach achieve high execution success rate, less completion time and more user’s satisfaction when compared with dynamic level scheduling(DLS), modified critical path(MCP) and berger model. It provides more success rate by eliminating dishonest providers. To use this model in actual cloud platform, its efficiency and effectiveness should test. F. SHEFT Workflow Scheduling Algorithm This paper [9] proposed the SHEFT (Scalable HEFT) scheduling algorithm that helps increasing and decreasing the number of resources at runtime. It provides facility to resources to scale at runtime, outperforms in optimizing workflow execution time. It scheduled a workflow in a cloud environment elastically. There was optimized execution time for the workflow. G. Job scheduling algorithm based on berger model Hongbo Yu [10], proposed a scheduling algorithm based on Berg Model that adapts to commercialization and virtualization features of cloud environment. People element analysis theory is applied to establish dual fairness constraints and efficiency. User’s demand of resources is based on various QoS based parameters. Firstly, selection of resources is done on some expected constraints and then fair judgement constraints allocate resources to tasks. Proposed algorithm reflects better fairness of user tasks. In future, it should experimentally implement using Berg model.
- 3. Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters DOI: 10.9790/0661-17633538 www.iosrjournals.org 37 | Page III. Comparative table of various scheduling algorithms Table II comparison of QoS-based task scheduling algorithms and future scope IV. Metrics for various scheduling algorithms The Existing scheduling algorithms considers various parameters like time, cost, makespan, speed, scalability, trust, resource utilization, scheduling success rate, quality of service and so on. Table II gives the details about the different metrics considered for QoS-based task scheduling. TABLE II Metrics considered by the Qos-based scheduling algorithms V. Conclusion Scheduling is a major factor in cloud environment. As shown in paper scheduling depends upon various QoS parameters. This paper gives review on various QoS based task scheduling algorithms and the future work to be done on that algorithms. The existing scheduling algorithm considered as topic of research and can be used to introduce more efficient and improved performance of algorithms based on parameters like trust value, execution rate, cost of the communication, speed and success rate. References [1] Sumit khurana, Anmol Gaurav Verma “Comparison of Cloud Computing Service Models: SaaS, PaaS, IaaS” IJECT Vol. 4, Issue Spl - 3, April - June 2013 [2] Syed Muhammad Ahsan. ―A framework for QoS computation in web service and techNology selection‖computer standards & Interfaces.2006,28(6),p.714-720. [3] Yang, B., X. Xu, F. Tan and D.H. Park “An utility based job scheduling algorithm for cloud computing considering reliability factor” Proceedings of the 2011 International Conference on Cloud and Service Computing, IEEE Xplore Press. [4] Huifang Li, Siyuan Ge, Lu Zhang “A QoS-based Scheduling Algorithm for Instance-intensive Workflows in Cloud Environment”26th Chinese Control and Decision Conference (CCDC) 978-1-4799-3708-0/14 2014 IEEE. [5] S. Selvarani, G.S. Sadhasivam,“Improved Cost Based Algorithm for Task Scheduling In Cloud Computing”, Computational Intelligence and Computing Research, pp. 1-5,2010. Techni ques Cost Time Reliability bandwidth Makespan Latency Resource utility Completion time Execution time Success rate User satisfaction Trust T1 True True True True False False False False False False False False T2 False False False False True True False False False False False False T3 False False False False False False True True False False False False T4 True False False False False False False False True False False False T5 True True False False False False False True False True True True T6 True False False False False False False False False False False True T7 False False False False False False False False True False True False
- 4. Differentiating Algorithms of Cloud Task Scheduling Based on various Parameters DOI: 10.9790/0661-17633538 www.iosrjournals.org 38 | Page [6] Hilda Lawrance, Dr. Salaja Silas” Efficient Qos Based Resource Scheduling Using PAPRIKA Method for Cloud Computing” International Journal of Engineering Science and TechNology (IJEST) ISSN : 0975-5462 Vol. 5 No.03 March 2013 [7] Kapil Kumar, Abhinav Hans, Ashish Sharma, Navdeep Singh, “Towards The Various Cloud Computing Scheduling Concerns: A Review, ” International Conference on InNovative Applications of Computational Intelligence on Power, Energy and Controls with their Impact on Humanity (CIPECH14) 28 & 29 November 2014. [8] Wenjuan Li, Qifei Zhang, Jiyi Wu1, Jing Li, Haili Zhao “Trust-based and QoS Demand Clustering Analysis Customizable Cloud Workflow Scheduling Strategies” 2012 IEEE International Conference on Cluster Computing Workshops [9] C. Lin, S.Lu, “Scheduling Scientific Workflow Elasticity for Cloud Computing”, IEEE 4th International Conference on Cloud Computing, pp. 246-247,2011. [10] Hongbo Yu, Yihua Lan*,Xingang Zhang, Zhidu Liu, Chao Yin, Lindong Li” Job Scheduling Algorithm In Cloud Environment” International Conference on Computational and Information Sciences 2013 IEEE. [11] Wugi Gao, fengju kanj “Cloud Simulation Resource Scheduling Algorithm Based on Multi-dimension Quality of Service” Science alert November 22, 2011.