Results 201 to 210 of about 10,457 (227)

Characterization of the departure process in a closed fork–join synchronization network

Applied Mathematics and Computation, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad El-Taha
exaly   +2 more sources

Notes on the History of Fork and Join [PDF]

IEEE Annals of the History of Computing, 2016
As part of a PhD on code forking in open source software, Linus Nyman looked into the origins of how the practice came to be called forking. This search led back to the early history of the fork system call.
Linus Nyman, Mikael Laakso
exaly   +2 more sources

Beyond the mean in fork-join queues: Efficient approximation for response-time tails [PDF]

Performance Evaluation, 2015
Fork-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
Zhan Qiu, Juan F Perez, Peter G Harrison   +2 more
exaly   +3 more sources

Nonlinear approximation of characteristics of a fork–join queueing system with Pareto service as a model of parallel structure of data processing

Mathematics and Computers in Simulation, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anastasia V. Gorbunova, Alexey V. Lebedev   +1 more
openaire   +2 more sources

Stochastic comparisons for fork-join queues with exponential processing times

Journal of Applied Probability, 1997
Consider a fork-join queue, where each job upon arrival splits into k tasks and each joins a separate queue that is attended by a single server. Service times are independent, exponentially distributed random variables. Server i works at rate , where μ is constant.
Frostig, Esther, Lehtonen, Tapani
openaire   +1 more source

The Influence of Independent Scheduling Delay on Multi-Query Processing Based on Fork-Join

2008 Second Asia International Conference on Modelling & Simulation (AMS), 2008
Fork-join is a basic query processing model in shared-nothing parallel database systems. A query Q is decomposed into a number of sub-queries, and each of which is processed independently on a processing element(PE), then all the results of sub-queries are "joined" and returned as Q's results.
Yong Wang, Limei Jiao, Ying Liu, Huaiming Song   +3 more
openaire   +1 more source

Scheduling Fork-Join Task Graphs with Communication Delays and Equal Processing Times

Proceedings of the 51st International Conference on Parallel Processing, 2022
Huijun Wang, Oliver Sinnen
openaire   +1 more source

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times

Mathematics of Operations Research, 2022
Dennis Schol, Maria Vlasiou, Bert Zwart   +2 more
exaly  

A prediction of processing time in the fork-join distributed system using Globus Toolkit

Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers, 2010
Yasuhira, Nobuto, Ito, Hidetaka, Kumamoto, Akira   +2 more
openaire   +1 more source