Open AccessBook
Priority Based Dynamic Resource Allocation In Cloud Computing
Chandrashekhar S. Pawar,Rajnikant B. Wagh +1 more
- 12 Oct 2017
92
TL;DR: An algorithm which considered Preemptable task execution and multiple SLA parameters such as memory, network bandwidth, and required CPU time is proposed and obtained experimental results show that in a situation where resource contention is fierce the algorithm provides better utilization of resources.
read more
Abstract: Today Cloud computing is on demand as it offers dynamic flexible resource allocation, for reliable and guaranteed services in pay-as-you-use manner, to Cloud service users So there must be a provision that all resources are made available to requesting users in efficient manner to satisfy their needs This resource provision is done by considering the Service Level Agreements (SLA) and with the help of parallel processing Recent work considers various strategies with single SLA parameter Hence by considering multiple SLA parameter and resource allocation by preemption mechanism for high priority task execution can improve the resource utilization in Cloud In this paper we propose an algorithm which considered Preemptable task execution and multiple SLA parameters such as memory, network bandwidth, and required CPU time An obtained experimental results show that in a situation where resource contention is fierce our algorithm provides better utilization of resources
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey on Resource Scheduling in Cloud Computing: Issues and Challenges
Sukhpal Singh,Inderveer Chana +1 more
- 01 Jun 2016
TL;DR: Methodical analysis of this research work will help researchers to find the important characteristics of resource scheduling algorithms and also will help to select most suitable algorithm for scheduling a specific workload.
467
A survey on resource allocation strategies in cloud computing
V. P. Anuradha,D. Sumathi +1 more
- 01 Feb 2014
TL;DR: This study aims to identify an efficient resource allocation strategy that utilizes resources effectively in the resource constrained environment of cloud computing.
210
Prioritized task scheduling in fog computing
Tejaswini Choudhari,Melody Moh,Teng-Sheng Moh +2 more
- 29 Mar 2018
TL;DR: Performance evaluation shows that the proposed task scheduling algorithm in the fog layer based on priority levels reduces the overall response time and notably decreases the total cost.
Cloud resource provisioning: survey, status and future research directions
Sukhpal Singh,Inderveer Chana +1 more
TL;DR: This research depicts a broad methodical literature analysis of cloud resource provisioning in general and cloud resource identification in specific and highlights the previous research, current status and future directions of resource provisioner provisioning and management in cloud computing.
150
A load balancing and optimization strategy (LBOS) using reinforcement learning in fog computing environment
TL;DR: The results show that the proposed solution improves the quality-of-service in the cloud/fog computing environment in terms of the allocation cost and reduce the response time and the LBOS is an efficient way to establish the resource utilization and ensure the continuous service.
141
References
•Book
Service-Oriented Architecture: Concepts, Technology, and Design
Thomas Erl
- 01 Jan 2006
TL;DR: Leading the way to the true service-oriented enterprise, Thomas Erl demystifies the complexities of the open WS-I standards with detailed practical discussions and case studies.
2.6K
A Particle Swarm Optimization-Based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments
Suraj Pandey,Linlin Wu,Siddeswara Mayura Guru,Rajkumar Buyya +3 more
- 20 Apr 2010
TL;DR: This paper presents a particle swarm optimization (PSO) based heuristic to schedule applications to cloud resources that takes into account both computation cost and data transmission cost, and shows that PSO can achieve as much as 3 times cost savings as compared to BRS.
974
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Oscar H. Ibarra,Chul E. Kim +1 more
TL;DR: A simplified scheduling problem involving identical processors and restricted task sets is shown to be P-complete, however, the LPT algorithm applied to this problem yields schedules which are near optimal for large n .
Utility functions in autonomic systems
William E. Walsh,Gerald Tesauro,Jeffrey O. Kephart,Rajarshi Das +3 more
- 17 May 2004
TL;DR: A distributed architecture, implemented in a realistic prototype data center, that demonstrates how utility functions can enable a collection of autonomic elements to continually optimize the use of computational resources in a dynamic, heterogeneous environment is presented.
Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems
Meikang Qiu,Edwin H.-M. Sha +1 more
TL;DR: This article models each varied execution time as a probabilistic random variable and solves heterogeneous assignment with probability (HAP) problem and proposes optimal algorithms to find the optimal solutions for the HAP problem when the input is a tree or a simple path.