Mean sojourn times in two-queue fork-join systems: bounds and approximations (Q443829)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mean sojourn times in two-queue fork-join systems: bounds and approximations |
scientific article; zbMATH DE number 6065159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mean sojourn times in two-queue fork-join systems: bounds and approximations |
scientific article; zbMATH DE number 6065159 |
Statements
Mean sojourn times in two-queue fork-join systems: bounds and approximations (English)
0 references
13 August 2012
0 references
queueing
0 references
fork-join network
0 references
simulation
0 references
parallel processing
0 references
synchronization
0 references
throughput time
0 references
0 references
0.8602910041809082
0 references
0.843515157699585
0 references
0.8280826210975647
0 references
0.8234429955482483
0 references
