Approximations and Bounds for (n, k) Fork-Join Queues: A Linear Transformation Approach

07/27/2017
by   Huajin Wang, et al.
0

Compared to basic fork-join queues, a job in (n, k) fork-join queues only needs its k out of all n sub-tasks to be finished. Since (n, k) fork-join queues are prevalent in popular distributed systems, erasure coding based cloud storages, and modern network protocols like multipath routing, estimating the sojourn time of such queues is thus critical for the performance measurement and resource plan of computer clusters. However, the estimating keeps to be a well-known open challenge for years, and only rough bounds for a limited range of load factors have been given. In this paper, we developed a closed-form linear transformation technique for jointly-identical random variables: An order statistic can be represented by a linear combination of maxima. This brand-new technique is then used to transform the sojourn time of non-purging (n, k) fork-join queues into a linear combination of the sojourn times of basic (k, k), (k+1, k+1), ..., (n, n) fork-join queues. Consequently, existing approximations for basic fork-join queues can be bridged to the approximations for non-purging (n, k) fork-join queues. The uncovered approximations are then used to improve the upper bounds for purging (n, k) fork-join queues. Simulation experiments show that this linear transformation approach is practiced well for moderate n and relatively large k.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2020

Instance Optimal Join Size Estimation

We consider the problem of efficiently estimating the size of the inner ...
research
10/20/2016

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

Multi-server systems have received increasing attention with important i...
research
03/22/2022

Non-recursive Approach for Sort-Merge Join Operation

Several algorithms have been developed over the years to perform join op...
research
07/04/2023

APRIL: Approximating Polygons as Raster Interval Lists

The spatial intersection join an important spatial query operation, due ...
research
11/13/2018

PanJoin: A Partition-based Adaptive Stream Join

In stream processing, stream join is one of the critical sources of perf...
research
11/18/2021

Efficiently Transforming Tables for Joinability

Data from different sources rarely conform to a single formatting even i...
research
02/25/2021

Checkpointing and Localized Recovery for Nested Fork-Join Programs

While checkpointing is typically combined with a restart of the whole ap...

Please sign up or login with your details

Forgot password? Click here to reset