Stability and Optimization of Speculative Queueing Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE/ACM Transactions on Networking Year : 2021

Stability and Optimization of Speculative Queueing Networks

Abstract

We provide a queueing-theoretic framework for job replication schemes based on the principle "replicate a job as soon as the system detects it as a straggler". This is called job speculation. Recent works have analyzed replication on arrival, which we refer to as replication. Replication is motivated by its implementation in Google's BigTable. However, systems such as Apache Spark and Hadoop MapReduce implement speculative job execution. The performance and optimization of speculative job execution is not well understood. To this end, we propose a queueing network model for load balancing where each server can speculate on the execution time of a job. Specifically, each job is initially assigned to a single server by a frontend dispatcher. Then, when its execution begins, the server sets a timeout. If the job completes before the timeout, it leaves the network, otherwise the job is terminated and relaunched or resumed at another server where it will complete. We provide a necessary and sufficient condition for the stability of speculative queueing networks with heterogeneous servers, general job sizes and scheduling disciplines. We find that speculation can increase the stability region of the network when compared with standard load balancing models and replication schemes. We provide general conditions under which timeouts increase the size of the stability region and derive a formula for the optimal speculation time, i.e., the timeout that minimizes the load induced through speculation. We compare speculation with redundant-d and redundant-to-idle-queued rules under an S&X model. For light loaded systems, redundancy schemes provide better response times. However, for moderate to heavy loadings, redundancy schemes can lose capacity and have markedly worse response times when compared with the proposed speculative scheme.
Fichier principal
Vignette du fichier
SQN.pdf (526.99 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03349775 , version 1 (20-09-2021)

Identifiers

Cite

Jonatha Anselmi, Neil Walton. Stability and Optimization of Speculative Queueing Networks. IEEE/ACM Transactions on Networking, 2021, pp.1-12. ⟨10.1109/TNET.2021.3128778⟩. ⟨hal-03349775⟩
37 View
103 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More