Book ChapterDOI
Bid Selection for Deadline Constrained Jobs over Spot VMs in Computational Cloud
Sharmistha Mandal,Sunirmal Khatua,Rajib K. Das +2 more
- pp 118-128
Reads0
Chats0
TLDR
This paper shows that by combining a greedy approach for bidding with effective use of checkpointing, the total cost of using spot instances can be reduced further without violating the deadline constraint.Abstract:
Spot instance is an attractive pricing option to the cloud service users. But to use the spot instances, the cloud service users (CSU) have tos select an appropriate bid. The total cost of using spot instances and time to complete the user’s job are both determined by the bid chosen. Thus, selection of appropriate bid for spot instances is a critical problem for the CSUs because of the unpredictable nature of spot prices. The problem is more challenging when there is a deadline constraint. The Dynamic Bidding Algorithm (DBA) was considered to be an effective approach in this field. In this paper, we show that by combining a greedy approach for bidding with effective use of checkpointing, the total cost of using spot instances can be reduced further without violating the deadline constraint. To measure the cost of our solutions and those given by DBA with the optimum we have formulated an IPP for the given problem. In formulating the IPP it is assumed that spot prices at all future times are known. Experimental results based on some actual spot and on-demand price data show that the cost of our solution is comparable to those given by IPP. It is also observed that the cost decreases as the deadline to complete the job is extended.read more
Citations
More filters
Journal ArticleDOI
Cost Minimizing Reservation and Scheduling Algorithms for Public Clouds
TL;DR: In this article , the authors proposed two algorithms to determine the reservation amount, and for both algorithms, the future spot prices are unknown, but the first algorithm does not make any such assumption and yet can ensure that the cost of reservation and usage of cloud resources is within a factor
Journal ArticleDOI
Cost Minimizing Reservation and Scheduling Algorithms for Public Clouds
TL;DR: Khatua et al. as mentioned in this paper proposed two algorithms to determine the reservation amount, and for both algorithms, the future spot prices are unknown, but the first algorithm does not make any such assumption and yet can ensure that the cost of reservation and usage of cloud resources is within a factor
Proceedings Article
Unlocking unallocated cloud capacity for long, uninterruptible workloads
TL;DR: In this article , the authors characterize HVMs from a major cloud provider and discover large spatial variations in their stability and resources, and leverage this diversity by predicting which HVM will be stable enough to run tasks without preemptions.
Book ChapterDOI
An Approach to Cost Minimization with EC2 Spot Instances Using VM Based Migration Policy
TL;DR: In this article , the authors proposed a technique that uses spot instances to minimize the cost of running large enterprise applications and compute-intensive workloads to a great extent by using a measure of spot score (represents the general trend of spot prices of a particular VM type over a predetermined duration of time).
References
More filters
Book
Dynamic Programming and Optimal Control
TL;DR: The leading and most up-to-date textbook on the far-ranging algorithmic methododogy of Dynamic Programming, which can be used for optimal control, Markovian decision problems, planning and sequential decision making under uncertainty, and discrete/combinatorial optimization.
Proceedings ArticleDOI
Quincy: fair scheduling for distributed computing clusters
TL;DR: It is argued that data-intensive computation benefits from a fine-grain resource sharing model that differs from the coarser semi-static resource allocations implemented by most existing cluster computing architectures.
Proceedings ArticleDOI
Matchmaking: distributed resource management for high throughput computing
TL;DR: The classified advertisement (classad) matchmaking framework is developed and implemented, a flexible and general approach to resource management in distributed environment with decentralized ownership of resources.
Journal ArticleDOI
Optimization of Resource Provisioning Cost in Cloud Computing
TL;DR: Numerical studies are extensively performed in which the results clearly show that with the OCRP algorithm, cloud consumer can successfully minimize total cost of resource provisioning in cloud computing environments.
Proceedings ArticleDOI
Cloudward bound: planning for beneficial migration of enterprise applications to the cloud
Mohammad Hajjat,Xin Sun,Yu-Wei Eric Sung,David A. Maltz,Sanjay Rao,Kunwadee Sripanidkulchai,Mohit Tawarmalani +6 more
TL;DR: The importance of ensuring assurable reconfiguration of security policies as enterprise applications are migrated to the cloud is articulated, and algorithms to achieve this goal are presented, and their efficacy on realistic migration scenarios are demonstrated.