IDEAS home Printed from https://ideas.repec.org/a/inm/orisre/v31y2020i3p753-775.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Leila Hosseini & Shaojie Tang & Vijay Mookerjee & Chelliah Sriskandarajah, 2020. "A Switch in Time Saves the Dime: A Model to Reduce Rental Cost in Cloud Computing," Information Systems Research, INFORMS, vol. 31(3), pages 753-775, September.
    • Handle: RePEc:inm:orisre:v:31:y:2020:i:3:p:753-775
    DOI: 10.1287/isre.2019.0912
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/isre.2019.0912
    Download Restriction: no
    File URL: https://libkey.io/10.1287/isre.2019.0912?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Hsing Kenneth Cheng & Zhi Li & Andy Naranjo, 2016. "Research Note—Cloud Computing Spot Pricing Dynamics: Latency and Limits to Arbitrage," Information Systems Research, INFORMS, vol. 27(1), pages 145-165, March.
    2. Arun Sangwan & Gaurav Kumar & Sorabh Gupta, 2016. "To Convalesce Task Scheduling in a Decentralized Cloud Computing Environment," Review of Computer Engineering Research, Conscientia Beam, vol. 3(1), pages 25-34.
    3. Kumar, Subodha & Dutta, Kaushik & Mookerjee, Vijay, 2009. "Maximizing business value by optimal assignment of jobs to resources in grid computing," European Journal of Operational Research, Elsevier, vol. 194(3), pages 856-872, May.
    4. Christian Artigues & Oumar Koné & Pierre Lopez & Marcel Mongeau, 2015. "Mixed-Integer Linear Programming Formulations," International Handbooks on Information Systems, in: Christoph Schwindt & Jürgen Zimmermann (ed.), Handbook on Project Management and Scheduling Vol.1, edition 127, chapter 0, pages 17-41, Springer.
    5. Shuai Yuan & Sanjukta Das & R. Ramesh & Chunming Qiao, 2018. "Service Agreement Trifecta: Backup Resources, Price and Penalty in the Availability-Aware Cloud," Information Systems Research, INFORMS, vol. 29(4), pages 947-964, December.
    6. Dengpan Liu & Sumit Sarkar & Chelliah Sriskandarajah, 2010. "Resource Allocation Policies for Personalization in Content Delivery Sites," Information Systems Research, INFORMS, vol. 21(2), pages 227-248, June.
    7. Arun Sangwan & Gaurav Kumar & Sorabh Gupta, 2016. "To Convalesce Task Scheduling in a Decentralized Cloud Computing Environment," Review of Computer Engineering Research, Conscientia Beam, vol. 3(1), pages 25-34.
    8. Hsieh, Chung-Chi, 2003. "Optimal task allocation and hardware redundancy policies in distributed computing systems," European Journal of Operational Research, Elsevier, vol. 147(2), pages 430-447, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rajib L. Saha & Sumanta Singha & Subodha Kumar, 2021. "Does Congestion Always Hurt? Managing Discount Under Congestion in a Game-Theoretic Setting," Information Systems Research, INFORMS, vol. 32(4), pages 1347-1367, December.
    2. Jianguo Zheng & Yilin Wang, 2021. "A Hybrid Multi-Objective Bat Algorithm for Solving Cloud Computing Resource Scheduling Problems," Sustainability, MDPI, vol. 13(14), pages 1-25, July.
    3. Leila Hosseini & Shaojie Tang & Vijay Mookerjee, 2024. "When Is More Merrier? A Cloud-Based Architecture to Procure Impressions from Multiple Ad Exchanges," Information Systems Research, INFORMS, vol. 35(1), pages 294-317, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Muhammad Shuaib Qureshi & Muhammad Bilal Qureshi & Muhammad Fayaz & Wali Khan Mashwani & Samir Brahim Belhaouari & Saima Hassan & Asadullah Shah, 2020. "A comparative analysis of resource allocation schemes for real-time services in high-performance computing systems," International Journal of Distributed Sensor Networks, , vol. 16(8), pages 15501477209, August.
    2. Zhiling Guo & Jin Li & Ram Ramesh, 2019. "Optimal Management of Virtual Infrastructures Under Flexible Cloud Service Agreements," Information Systems Research, INFORMS, vol. 30(4), pages 1424-1446, April.
    3. Brech, Claus-Henning & Ernst, Andreas & Kolisch, Rainer, 2019. "Scheduling medical residents’ training at university hospitals," European Journal of Operational Research, Elsevier, vol. 274(1), pages 253-266.
    4. John Oredo & Denis Dennehy, 2023. "Exploring the Role of Organizational Mindfulness on Cloud Computing and Firm Performance: The Case of Kenyan Organizations," Information Systems Frontiers, Springer, vol. 25(5), pages 2029-2050, October.
    5. Pamela C. Nolz, 2021. "Optimizing construction schedules and material deliveries in city logistics: a case study from the building industry," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 846-878, September.
    6. Rajib L. Saha & Sumanta Singha & Subodha Kumar, 2021. "Does Congestion Always Hurt? Managing Discount Under Congestion in a Game-Theoretic Setting," Information Systems Research, INFORMS, vol. 32(4), pages 1347-1367, December.
    7. Tom Rihm & Norbert Trautmann & Adrian Zimmermann, 2018. "MIP formulations for an application of project scheduling in human resource management," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 609-639, December.
    8. Shi Chen & Kamran Moinzadeh & Yong Tan, 2021. "Discount Schemes for the Preemptible Service of a Cloud Platform with Unutilized Capacity," Information Systems Research, INFORMS, vol. 32(3), pages 967-986, September.
    9. Wilson, Kevin J. & Quigley, John, 2016. "Allocation of tasks for reliability growth using multi-attribute utility," European Journal of Operational Research, Elsevier, vol. 255(1), pages 259-271.
    10. Linda D. Hollebeek & Moira K. Clark & Wafa Hammedi & René Arvola, 2021. "Cocreated brand value: theoretical model and propositions," Journal of Brand Management, Palgrave Macmillan, vol. 28(4), pages 413-428, July.
    11. Shehadeh, Karmel S. & Cohn, Amy E.M. & Epelman, Marina A., 2019. "Analysis of models for the Stochastic Outpatient Procedure Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 279(3), pages 721-731.
    12. Sriram Thirumalai & Kingshuk K. Sinha, 2013. "To Personalize or Not to Personalize Online Purchase Interactions: Implications of Self-Selection by Retailers," Information Systems Research, INFORMS, vol. 24(3), pages 683-708, September.
    13. Hossein Jahandideh & Julie Ward Drew & Filippo Balestrieri & Kevin McCardle, 2020. "Individualized Pricing for a Cloud Provider Hosting Interactive Applications," Service Science, INFORMS, vol. 12(4), pages 130-147, December.
    14. Shuai Yuan & Sanjukta Das & R. Ramesh & Chunming Qiao, 2018. "Service Agreement Trifecta: Backup Resources, Price and Penalty in the Availability-Aware Cloud," Information Systems Research, INFORMS, vol. 29(4), pages 947-964, December.
    15. Sam Ransbotham & Ishwar Murthy & Sabyasachi Mitra & Sridhar Narasimhan, 2011. "Sequential Grid Computing: Models and Computational Experiments," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 174-188, May.
    16. Shuai Yuan & Sanjukta Das & Ram Ramesh & Chunming Qiao, 2023. "Availability-Aware Virtual Resource Provisioning for Infrastructure Service Agreements in the Cloud," Information Systems Frontiers, Springer, vol. 25(4), pages 1495-1512, August.
    17. Tsang, Man Yiu & Shehadeh, Karmel S., 2023. "Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times," European Journal of Operational Research, Elsevier, vol. 307(1), pages 48-63.
    18. Bersch, Christopher V. & Akkerman, Renzo & Kolisch, Rainer, 2021. "Strategic planning of new product introductions: Integrated planning of products and modules in the automotive industry," Omega, Elsevier, vol. 105(C).
    19. Anna Ye Du & Sanjukta Das & R. Ramesh, 2013. "Efficient Risk Hedging by Dynamic Forward Pricing: A Study in Cloud Computing," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 625-642, November.
    20. Dutta, Kaushik & VanderMeer, Debra, 2011. "Cost-based decision-making in middleware virtualization environments," European Journal of Operational Research, Elsevier, vol. 210(2), pages 344-357, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orisre:v:31:y:2020:i:3:p:753-775. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.