The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

A Delicate Union of Batching and Parallelization Models in Distributed Computing and Communication

Key:KR20
Author:Sounak Kar, Amr Rizk
Date:June 2020
Kind:In proceedings - use for conference & workshop papers
Publisher:IEEE
Organization:IFIP
Book title:IFIP Networking
Pages:1-5
Language:English
Abstract:The Fork-Join (FJ) model has been extensively studied in the past due to its natural ability to capture computation and communication systems that employ split and merge techniques, i.e., boosting performance through splitting and parallelizing the input and finally merging the results. This model finds applications ranging from multipath communications to distributed databases. In this work, we explore the effect of batching within FJ systems, i.e., when servers collect the input to benefit from a so-called speedup, observed as a service time reduction due to batching. We numerically compare the performance when the speedup assumes different analytical forms. Our numerical evaluation shows that the steady-state waiting time of such an FJ system is heavily dependent upon the form of the speedup achieved through batching while the optimization thereof is non-trivial.
Full paper (pdf)

[Export this entry to BibTeX]

[back]