The technical advancements and the availability of massive amounts of data on the Internet
draw huge attention from researchers in the areas of decision-making, data sciences …

Workflows are prevalent in today's computing infrastructures as they support many domains.
Different Quality of Service (QoS) requirements of both users and providers makes workflow …

A fork–join system with Pareto service time distribution is considered as a model of a parallel
structure of data processing. For an approximation of the mean response time of the system …

This paper presents a study of fork–join systems. The fork–join system breaks down each
customer into numerous tasks and processes them on separate servers. Once all tasks are …

The article considers a classic fork-join queueing system with a Poisson input flow and
exponential service times on homogeneous servers. When entering the system, tasks are …

The Fork-Join structure underlays many distributed computing applications in data centers.
In this paper, we develop a technique, called ForkMV, to estimate the mean and variance of …

This paper investigates the fork-join scheduling scheme on a system of n parallel servers
comprising both slow and fast servers. Tasks arriving in the system are divided into k sub …

The article analyzes the relationship between the residence times of subtasks in the fork-join
subsystems of the queuing system. When arriving the fork-join system, the task is divided …

Object cloud storage systems are deployed with diverse applications that have varying
latency service level objectives (SLOs), posting challenges for supporting quality of service …

The paper studies the classical fork-join queueing system with M| M| 1 subsystems. The
analysis of this system is still relevant due to the lack of exact solutions for assessing its …