具有冗余和随机减速的部分fork-join系统的延迟最优策略
Delay-optimal policies in partial fork-join systems with redundancy and random slowdowns
摘要:
我们考虑一个大型的分布式服务系统组成的$n$同构服务器与无限容量的FIFO队列。作业到达的速率是一个泊松过程$λn/k_n$(对于某个正常数$λ$和整数$k_n$)。每个传入作业由$k_n$相同的任务组成,这些任务可以并行执行,并且可以编码为至少相同大小的$k_n$“副本”(通过引入冗余),以便当与该作业相关联的任何$k_n$副本完成其服务时,该作业被认为完成。此外,我们假设,服务器可以在其处理速率的随机减速,使副本的服务时间是其大小和随机减速的产品。首先,我们假设服务器的减速是指数变化的,并且与副本大小无关。在此设置中,我们表明,一个典型的工作的延迟渐近最小化(作为$n\to\infty$)时,每个任务的副本数是一个常数,只取决于到达率$λ$,并在预期的服务器的减速。其次,我们引入了一个新的模型的服务器变慢,其中较大的任务比较小的任务经历较少的变量变慢。在此设置中,我们表明,在一类的政策,所有副本在同一时间开始他们的服务,一个典型的工作的延迟渐近最小化(作为$n\to\infty$)时,每个任务的副本的数量取决于被复制的任务的实际大小,与较小的任务被复制比较大的任务。
英文摘要:
We consider a large distributed service system consisting of $n$ homogeneous servers with infinite capacity FIFO queues. Jobs arrive as a Poisson process of rate $λn/k_n$ (for some positive constant $λ$ and integer $k_n$). Each incoming job consists of $k_n$ identical tasks that can be executed in parallel, and that can be encoded into at least $k_n$ "replicas" of the same size (by introducing redundancy) so that the job is considered to be completed when any $k_n$ replicas associated with it finish their service. Moreover, we assume that servers can experience random slowdowns in their processing rate so that the service time of a replica is the product of its size and a random slowdown. First, we assume that the server slowdowns are shifted exponential and independent of the replica sizes. In this setting we show that the delay of a typical job is asymptotically minimized (as $n\to\infty$) when the number of replicas per task is a constant that only depends on the arrival rate $λ$, and on the expected slowdown of servers. Second, we introduce a new model for the server slowdowns in which larger tasks experience less variable slowdowns than smaller tasks. In this setting we show that, under the class of policies where all replicas start their service at the same time, the delay of a typical job is asymptotically minimized (as $n\to\infty$) when the number of replicas per task is made to depend on the actual size of the tasks being replicated, with smaller tasks being replicated more than larger tasks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。