Fork-join and redundancy systems with heavy-tailed job sizes (Q6163557): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3164151830 / rank
 
Normal rank

Revision as of 10:34, 30 July 2024

scientific article; zbMATH DE number 7702257
Language Label Description Also known as
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references