Results 11 to 20 of about 5,171 (123)
Extreme values for the waiting time in large fork-join queues [PDF]
Abstract We prove that the scaled maximum steady-state waiting time and the scaled maximum steady-state queue length among N GI/GI/1-queues in the N-server fork-join queue converge to a normally distributed random variable as $$N\rightarrow \infty $$ N
D. Schol (Dennis) +2 more
openaire +5 more sources
Mean sojourn times in two-queue fork-join systems: bounds and approximations [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kemper, B., Mandjes, M.
openaire +5 more sources
Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations [PDF]
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, Sabina Rossi
openaire +2 more sources
Approximations and Bounds for (n, k) Fork-Join Queues: A Linear Transformation Approach [PDF]
(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 ...
Huajin Wang +3 more
semanticscholar +1 more source
This paper considers optimal design of queueing networks in which each node consists of a single-server FIFO queue and an infinite-server queue, which is referred to as incubation queue.
E. Tsai +5 more
semanticscholar +1 more source
State-Dependent Estimation of Delay Distributions in Fork-Join Networks
Problem definition: Delay announcements have become an essential tool in service system operations: They influence customer behavior and network efficiency.
Nitzan Carmeli, G. Yom-Tov, O. Boxma
semanticscholar +1 more source
Delay-Optimal Policies in Partial Fork-Join Systems with Redundancy and Random Slowdowns
We consider a large distributed service system consisting of n homogeneous servers with infinite capacity FIFO queues. Jobs arrive as a Poisson process of rate λ n/kn (for some positive constant λ and integer kn).
Martin Zubeldia
semanticscholar +2 more sources
Delay-Optimal Policies in Partial Fork-Join Systems with Redundancy and Random Slowdowns [PDF]
We consider a large distributed service system consisting of n homogeneous servers with infinite capacity FIFO queues. Jobs arrive as a Poisson process of rate λn/kn (for some positive constant kn and integer kn).
Martin Zubeldia
semanticscholar +1 more source
ABSTRACT The dynamic nature of small islands being geographically isolated and their perceived connectedness with global networks complicates research attempts to draw general conclusions on whether insularity leads to marginalization or strengthens their resilience for sustainable development.
Toheeb Lekan Jolaosho +2 more
wiley +1 more source
Abstract The Internet of Things (IoT) in deploying robotic sprayers for pandemic‐associated disinfection and monitoring has garnered significant attention in recent research. The authors introduce a novel architectural framework designed to interconnect smart monitoring robotic devices within healthcare facilities using narrowband Internet of Things ...
Md Motaharul Islam +9 more
wiley +1 more source

