arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1610.06309cs.PFcs.DC
收藏

具有同步约束的多服务台系统的非渐近时滞界

Non-Asymptotic Delay Bounds for Multi-Server Systems with Synchronization Constraints

Markus Fidler, Brenton Walker, Yuming Jiang

摘要:

多服务器系统随着Google MapReduce、Hadoop和Spark等重要实现而受到越来越多的关注。这些系统的共同点是分叉操作,其中作业首先被划分为并行处理的任务,以及稍后的连接操作,其中完成的任务等待直到作业的所有任务的结果可以被组合并且作业离开系统。连接操作的同步约束使得fork-join系统的分析具有挑战性,并且很少有明确的结果。在这项工作中,我们使用最大加服务器模型,使我们能够推导出一般到达和服务时间过程的等待和逗留时间的统计界限fork-join系统。我们贡献端到端的延迟界限,多阶段fork-join网络,增长在$\mathcal{O}(h \ln k)$为$h$ fork-join阶段,每个与$k$并行服务器。我们对不同的多服务器配置进行了详细的比较,并突出了它们的优缺点。我们还分析了非空闲的单队列fork-join系统,并将这些结果与模拟和实时Spark系统进行了比较。

英文摘要:

Multi-server systems have received increasing attention with important implementations such as Google MapReduce, Hadoop, and Spark. Common to these systems are a fork operation, where jobs are first divided into tasks that are processed in parallel, and a later join operation, where completed tasks wait until the results of all tasks of a job can be combined and the job leaves the system. The synchronization constraint of the join operation makes the analysis of fork-join systems challenging and few explicit results are known. In this work, we model fork-join systems using a max-plus server model that enables us to derive statistical bounds on waiting and sojourn times for general arrival and service time processes. We contribute end-to-end delay bounds for multi-stage fork-join networks that grow in $\mathcal{O}(h \ln k)$ for $h$ fork-join stages, each with $k$ parallel servers. We perform a detailed comparison of different multi-server configurations and highlight their pros and cons. We also include an analysis of single-queue fork-join systems that are non-idling and achieve a fundamental performance gain, and compare these results to both simulation and a live Spark system.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑