Results 1 to 10 of about 1,229 (84)
MathematicsThis 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 finished, the customer is considered completed.
Vladimir Mironovich Vishnevsky +3 more
doaj +6 more sources
A quantitative study of fork-join processes with non-deterministic choice: Application to the statistical exploration of the state-space [PDF]
Theoretical Computer Science, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antoine Genitrini +2 more
exaly +4 more sources
Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources [PDF]
Mathematics of Operations Research, 2022 A fork-join processing network is a queueing network in which tasks associated with a job can be processed simultaneously. Fork-join processing networks are prevalent in computer systems, healthcare, manufacturing, project management, justice systems, and so on.
Erhun Özkan
exaly +5 more sources
Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In this paper we address the problem of understanding Concurrency Theory from a combinatorial point of view. We are interested in quantitative results and algorithmic tools to refine our understanding of the classical combinatorial explosion phenomenon ...
OLivier Bodini +3 more
doaj +1 more source
Statistical Analysis of Non-deterministic Fork-Join Processes [PDF]
, 2020 We study the combinatorial structure of concurrent programs with non-deterministic choice and a fork-join style of coordination. As a first step we establish a link between these concurrent programs and a class of combinatorial structures. Based on this combinatorial interpretation, we develop and experiment algorithms aimed at the statistical ...
Genitrini, Antoine +2 more
openaire +2 more sources
Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
Stochastic Systems, 2016 We study a fork-join network with a single class of jobs, which are forked into a fixed number of parallel tasks upon arrival to be processed at the corresponding multi-server stations.
Hongyuan Lu, Guodong Pang
doaj +1 more source
The Templet language preprocessor: a programming tool for process-per-message modeling
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2014 Motivation: A large number of applications can be described as a set of processes that exchange messages. Traditionally the process-per-message model is used in the form of a specialized language or a run-time library for general purpose language.
Sergey V Vostokin
doaj +1 more source
Departure process in a mixed fork–join synchronization network
Computers & Mathematics with Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Origin and diversity of leaf vein patterns. [PDF]
J Exp BotRobil JM, Scarpella E.
europepmc +1 more source
VeriFed: Temporally Consistent Continuous Cross-Chain Data Federation. [PDF]
Entropy (Basel)Hao K, Bi M, Ma Y.
europepmc +1 more source