A Switch in Time Saves the Dime: A Model to Reduce Rental Cost in Cloud Computing

Leila Hosseini (), Shaojie Tang (), Vijay Mookerjee () and Chelliah Sriskandarajah ()
Additional contact information
Leila Hosseini: Fox School of Business, Temple University, Philadelphia, Pennsylvania 19122
Shaojie Tang: University of Texas at Dallas, Richardson, Texas 75080
Vijay Mookerjee: University of Texas at Dallas, Richardson, Texas 75080
Chelliah Sriskandarajah: Texas A&M University, College Station, Texas 77843

Information Systems Research, 2020, vol. 31, issue 3, 753-775

Abstract: The goal to continually reduce operating costs while meeting computational needs is common to all modern organizations that use cloud computing. We study the problem of selecting computing resources with the goal of minimizing the total rental cost of completing a computing task in the presence of a time constraint. The problem is formulated as a scheduling problem that assigns computing resources to time periods of the planning horizon (time available to complete a single computing task). This (NP-hard) preemptive-resume type scheduling problem—new to the scheduling literature—has not been carefully addressed in practice to provide an implementable solution. Typically, the approach taken in practice is to use a single resource (a single virtual machine instance, or a cluster of identical virtual machine instances) to complete a computing task. The main insight of this study is that rather than completing a computing task using a single computing resource, rental costs can be significantly lowered by using a few resources (sometimes even just two) to complete the task. Thus, the computing task is switched from one resource to another to exploit the cloud provider’s price-performance schedule. Cloud computing has been recognized as an economically attractive computing environment whose adoption has been growing over time. However, providers (such as Amazon Web Services) offer a confusing and diverse set of computing resources with different configurations and unit rental costs. Our near-optimal solution is based on switching the computing task from one resource to another in way that leverages the relationship between the price and performance of the available computing resources. The performance of a given resource can vary randomly as well as be correlated with the performance of another (stronger or weaker) resource. We present a worst-case performance guarantee of the proposed solution. In addition, we study the performance using a detailed computational study and a real-world example of an actual company that can benefit from our proposed solution. In the computational study as well as the real-world example, the cost of our solution is usually about 15%–25% lower than the benchmark solution of using the best single computing resource to process the computing task. Practicing information technology managers can use our approach to migrate in-house solutions to the cloud in a cost-effective manner.

Keywords: cloud computing; total rental cost minimization; near-optimal solution (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1287/isre.2019.0912 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orisre:v:31:y:2020:i:3:p:753-775

Access Statistics for this article

More articles in Information Systems Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().