Parallel Server Systems with Cancel-on-Completion Redundancy

Published Online:https://doi.org/10.1287/stsy.2022.0094

References

  • Adan I, Kleiner I, Righter R, Weiss G (2018) FCFS parallel service systems and matching models. Performance Evaluation 127:253–272.Google Scholar
  • Ayesta U, Bodas T, Verloop IM (2018a) On a unifying product form framework for redundancy models. Performance Evaluation 127:93–119.Google Scholar
  • Ayesta U, Bodas T, Verloop IM (2018b) On redundancy-d with cancel-on-start aka join-shortest-work (d). Performance Evaluation Rev. 46(2):24–26.Google Scholar
  • Bramson M (2008) Stability of Queueing Networks (Springer, Berlin, Heidelberg).Google Scholar
  • Bramson M, Lu Y, Prabhakar B (2012) Asymptotic independence of queues under randomized load balancing. Queueing Systems 71:247–292.Google Scholar
  • Dai JG (1995) On the positive Harris recurrence for multiclass queueing networks: A unified approach via fluid models. Ann. Appl. Probab. 5(1):49–77.Google Scholar
  • Ethier S, Kurtz T (1986) Markov Processes: Characterization and Convergence (Wiley, Hoboken, NJ).Google Scholar
  • Foss S, Stolyar AL (2017) Large-scale join-idle-queue system with general service times. J. Appl. Probab. 54(4):995–1007.Google Scholar
  • Gardner K, Harchol-Balter M, Scheller-Wolf A, Velednitsky M, Zbarsky S (2017) Redundancy-d: The power of d choices for redundancy. Oper. Res. 65(4):1078–1094.LinkGoogle Scholar
  • Gardner K, Zbarsky S, Doroudi S, Harchol-Balter M, Hyytia E (2015) Reducing latency via redundant requests: Exact analysis. Performance Evaluation Rev. 43(1):347–360.Google Scholar
  • Hellemans T, Bodas T, Van Houdt B (2019) Performance analysis of workload dependent load balancing policies. Proc. ACM Measurement Anal. Comput. Systems, 3(2):35.Google Scholar
  • Liptser RS, Shiryaev AN (1989) Theory of Martingales (Kluwer Academic Publishers, Dordrecht, Netherlands).Google Scholar
  • Rybko A, Stolyar A (1992) Ergodicity of stochastic processes describing the operation of open queueing networks. Problems Inform. Transmission 28(3):199–200.Google Scholar
  • Shah NB, Lee K, Ramchandran K (2015) When do redundant requests reduce latency? IEEE Trans. Comm. 64(2):715–722.Google Scholar
  • Shneer S, Stolyar AL (2021) Large-scale parallel server system with multi-component jobs. Queueing Systems 98:21–48.Google Scholar
  • Stolyar AL (1995) On the stability of multiclass queueing networks: A relaxed sufficient condition via limiting fluid processes. Markov Processes Related Fields 1(4):491–512.Google Scholar
  • Stolyar AL (2015) Pull-based load distribution in large-scale heterogeneous service systems. Queueing Systems 80(4):341–361.Google Scholar
  • Vulimiri A, Godfrey P, Mittal R, Sherry J, Ratnasamy S, Shenker S (2013) Low latency via redundancy. CoNEXT 2013—Proc. 2013 ACM Internat. Conf. Emerging Networking Experiments Tech. (Association for Computing Machinery), 283–294.Google Scholar
  • Vvedenskaya N, Dobrushin R, Karpelevich F (1996) Queueing system with selection of the shortest of two queues: An asymptotic approach. Problems Inform. Transmission 32(1):20–34.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.