IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v239y2016i2d10.1007_s10479-014-1591-9.html
   My bibliography  Save this article

Matching performance objectives for open and closed workloads by consolidation and replication

Author

Listed:
  • Davide Cerotti

    (Politecnico di Milano)

  • Marco Gribaudo

    (Politecnico di Milano)

  • Pietro Piazzolla

    (Politecnico di Milano)

  • Giuseppe Serazzi

    (Politecnico di Milano)

Abstract

One of the most crucial task during the design of a computing infrastructure is the decision about the proper amount of equipments required to handle a specific workload while satisfying a set of performance objectives. This problem is emphasized even more in actual computer infrastructure such as clouds, where the user can provision the resources very easily thanks to the use of virtual machines. If the system has to handle a low workload, resources can be consolidated together to reduce the costs. If however the workload is very high, resources must be replicated to gain an acceptable service level. In this paper we derive the impact on several performance indexes for both consolidation and replication when considering both open and closed workloads. In particular, we present an analytical model to determine the best consolidation or replication options that match given performance objectives specified through a set of constraints. Depending on the particular type of workload and constraints, we present either closed form expressions, heuristics or an iterative algorithm to compute the minimum number of resources required.

Suggested Citation

  • Davide Cerotti & Marco Gribaudo & Pietro Piazzolla & Giuseppe Serazzi, 2016. "Matching performance objectives for open and closed workloads by consolidation and replication," Annals of Operations Research, Springer, vol. 239(2), pages 589-612, April.
  • Handle: RePEc:spr:annopr:v:239:y:2016:i:2:d:10.1007_s10479-014-1591-9
    DOI: 10.1007/s10479-014-1591-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-014-1591-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-014-1591-9?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    Full references (including those not matched with items on IDEAS)

    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. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    2. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    3. Pradhan, Salil & Damodaran, Purushothaman & Srihari, Krishnaswami, 2008. "Predicting performance measures for Markovian type of manufacturing systems with product failures," European Journal of Operational Research, Elsevier, vol. 184(2), pages 725-744, January.
    4. Girish, Muckai K. & Hu, Jian-Qiang, 2000. "Higher order approximations for the single server queue with splitting, merging and feedback," European Journal of Operational Research, Elsevier, vol. 124(3), pages 447-467, August.
    5. Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
    6. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    7. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    8. Lin, Yu-Hsin & Lee, Ching-En, 2001. "A total standard WIP estimation method for wafer fabrication," European Journal of Operational Research, Elsevier, vol. 131(1), pages 78-94, May.
    9. Sumi Kim & Seongmoon Kim, 2015. "Differentiated waiting time management according to patient class in an emergency care center using an open Jackson network integrated with pooling and prioritizing," Annals of Operations Research, Springer, vol. 230(1), pages 35-55, July.
    10. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.
    11. Dijk, N.M. van, 1989. "Product forms for queueing networks with limited clusters," Serie Research Memoranda 0029, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    12. Haskose, A. & Kingsman, B. G. & Worthington, D, 2004. "Performance analysis of make-to-order manufacturing systems under different workload control regimes," International Journal of Production Economics, Elsevier, vol. 90(2), pages 169-186, July.
    13. Dijk, N.M. van, 1991. "Product forms for queueing networks with limited clusters," Serie Research Memoranda 0013, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    14. Hong Chen & Hanqin Zhang, 2000. "Stability of Multiclass Queueing Networks Under Priority Service Disciplines," Operations Research, INFORMS, vol. 48(1), pages 26-37, February.
    15. Peter Whittle, 2002. "Applied Probability in Great Britain," Operations Research, INFORMS, vol. 50(1), pages 227-239, February.
    16. Hui-Yu Zhang & Qing-Xin Chen & James MacGregor Smith & Ning Mao & Ai-Lin Yu & Zhan-Tao Li, 2017. "Performance analysis of open general queuing networks with blocking and feedback," International Journal of Production Research, Taylor & Francis Journals, vol. 55(19), pages 5760-5781, October.
    17. Pourbabai, B. & Blanc, J. P. C. & van der Duyn Schouten, F. A., 1996. "Optimizing flow rates in a queueing network with side constraints," European Journal of Operational Research, Elsevier, vol. 88(3), pages 586-591, February.
    18. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    19. Bretthauer, Kurt M., 1996. "Capacity planning in manufacturing and computer networks," European Journal of Operational Research, Elsevier, vol. 91(2), pages 386-394, June.
    20. Mohammad Delasay & Armann Ingolfsson & Bora Kolfal, 2016. "Modeling Load and Overwork Effects in Queueing Systems with Adaptive Service Rates," Operations Research, INFORMS, vol. 64(4), pages 867-885, August.

    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:spr:annopr:v:239:y:2016:i:2:d:10.1007_s10479-014-1591-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.