Computable Bounds in Fork-Join Queueing Systems [PDF]
Performance Evaluation Review, 2015 In a Fork-Join (FJ) queueing system an upstream fork station splits incoming jobs into N tasks to be further processed by N parallel servers, each with its own queue; the response time of one job is determined, at a downstream join station, by the maximum of the corresponding tasks' response times.
Amr Rizk, Florin Ciucu
exaly +2 more sources
Tail asymptotics for the delay in a Brownian fork-join queue
Stochastic Processes and Their Applications, 2023 1 ...
Dennis Schol +2 more
exaly +6 more sources
Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times [PDF]
Mathematics of Operations Research, 2022 In this paper, we study an N server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as [Formula: see text]. This fluid limit depends on the initial number of tasks.
Dennis Schol +2 more
exaly +7 more sources
A decomposition procedure for the analysis of a closed fork/join queueing system [PDF]
IEEE Transactions on Computers, 1991 An iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput.
H G Perros
exaly +2 more sources
Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations [PDF]
Lecture Notes in Computer Science, 2016 The analysis of fork-join queueing systems has played an important role for the performance evaluation of distributed systems where parallel computations associated with the same job are carried out and a job is considered served only when all the parallel tasks it consists of are served and then joined. The fork-join nodes that we consider consist of \
Andrea Marin +2 more
exaly +2 more sources
Mean sojourn times in two-queue fork-join systems: bounds and approximations [PDF]
OR Spectrum, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benjamin Kemper +2 more
exaly +5 more sources
Stochastic bounds in ForkâJoin queueing systems under full and partial mapping [PDF]
Queueing Systems, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amr Rizk, Florin Ciucu
exaly +2 more sources
Beyond the mean in fork-join queues: Efficient approximation for response-time tails
Performance Evaluation, 2015 AbstractFork-join queues are natural models for various computer and communications systems that involve parallel multitasking and the splitting and resynchronizing of data, such as parallel computing, query processing in distributed databases, and parallel disk access.
Zhan Qiu +2 more
exaly +3 more sources
Design and analysis of AGV-based cross-docking operations using analytical models
Production and Manufacturing Research: An Open Access Journal, 2022 Cross-docking is important for logistics because it reduces inventory, lead-times, and shipments. However, dynamic imbalances between supply and demand usually results in some inventory being warehoused in cross-docks.
Xiao He, Vittaldas V. Prabhu
doaj +1 more source
ReactiveFnJ: A choreographed model for Fork-Join Workflow in Serverless Computing
Journal of Cloud Computing: Advances, Systems and Applications, 2023 Function-as-a-Service (FaaS) is an event-based reactive programming model where functions run in ephemeral stateless containers for short duration.
Urmil Bharti, Anita Goel, S. C. Gupta
doaj +1 more source