Fork-join and redundancy systems with heavy-tailed job sizes (Q6163557)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7702257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fork-join and redundancy systems with heavy-tailed job sizes |
scientific article; zbMATH DE number 7702257 |
Statements
Fork-join and redundancy systems with heavy-tailed job sizes (English)
0 references
26 June 2023
0 references
The authors study response-time asymptotics for the cancel-on-tart and cancel-on-completion variants of redundancy-$d$ scheduling and the fork-join model with heavy-tailed job sizes. It is examined the tail behavior of the response time when job sizes are heavy-tailed, which is one of the most relevant scenarios in redundancy scheduling and the fork-join model as with the FCFC discipline as with the LCFC-PR discipline. Numerical results on the tail behavior of the response time in redundancy scheduling with Pareto distributed job sizes are presented too.
0 references
parallel-server systems
0 references
fork-join
0 references
redundancy
0 references
heavy-tailed distributions
0 references
response time asymptotics
0 references
0 references
0 references
0 references
0.7569884061813354
0 references
0.7355943322181702
0 references
0.7334657311439514
0 references
0.726833701133728
0 references
0.7259492874145508
0 references
