Results 1 to 10 of about 122 (109)

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, Maria Vlasiou, Bert Zwart   +2 more
exaly   +7 more sources

Interpolation approximations for symmetric Fork-Join queues [PDF]

Performance Evaluation, 1994
Abstract We propose a family of heuristic approximations for the expected response time of K-dimensional symmetric Fork-Join systems in statistical equilibrium with general inter-arrival and service time distributions. To do this, we rely on the light traffic interpolation technique popularized by Reiman and Simon. Our starting point is a formula for
Armand M Makowski
exaly   +2 more sources

Tail asymptotics for the delay in a Brownian fork-join queue

Stochastic Processes and Their Applications, 2023
1 ...
Dennis Schol, Maria Vlasiou, Bert Zwart   +2 more
exaly   +6 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, Juan F Perez, Peter G Harrison   +2 more
exaly   +3 more sources

Performance characteristics of the fork-join queuing system

Informatika, 2023
Objectives. The problem of investigating a fork-join queuing system is considered. It is required to build the process of the system functioning, to find the condition for the existence of a stationary distribution, and propose algorithms for calculating
V. I. Klimenok
doaj   +1 more source

Computable Bounds in Fork-Join Queueing Systems [PDF]

Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 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.
Rizk, Amr, Poloczek, Felix, Ciucu, Florin   +2 more
openaire   +1 more source

A Worst-Case Latency and Age Analysis of Coded Distributed Computing With Unreliable Workers and Periodic Tasks

IEEE Open Journal of the Communications Society
Over the past decade, the deep learning revolution has led to ever-increasing demands for computing power and working memory to support larger and larger neural networks.
Federico Chiariotti, Beatriz Soret, Petar Popovski   +2 more
doaj   +1 more source

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.
Y. C. Liu, Harry G. Perros
openaire   +1 more source

Blood Biomarkers of Helicobacter pylori‐Infected Chronic Gastritis in Active Versus Stable Phases: A Clinical Indicator Analysis Combined With Proteomic and Metabolomic Investigations

iMetaMed, EarlyView.
Combining clinical data with serum proteomics and metabolomics, the HGB–CAPZB–acetic acid model was developed as a potential diagnostic index to distinguish the active and stable stages of Helicobacter pylori‐infected chronic gastritis, and the related mechanism was explored through multi‐omics.
Tiantong Jiang, Zhen Ma, Yang Li, Shaoli Wang, Yanjiao Zhang, Lei Song, Xianyu Li, Zhen Liu   +7 more
wiley   +1 more source

Tracing Three Decades of Low Earth Orbit Satellite Communication Development: A Bibliometric and Main Path Analysis of Network Architectures, Protocol Evolution, and Emerging Intelligent Services

International Journal of Satellite Communications and Networking, EarlyView.
ABSTRACT Low Earth Orbit (LEO) satellite communication systems have evolved into a critical component of global broadband networks, enabling wide‐area connectivity, IoT services, and intelligent multilayer satellite–terrestrial integration. Despite rapid advancements in constellation deployment, routing mechanisms, resource management, and LEO–5G/6G ...
Wei‐Hao Su, Ya‐Chen Chuang, Long‐Sheng Chen   +2 more
wiley   +1 more source