Efficient scheduling in redundancy systems with general service times

DOI10.1007/S11134-024-09904-3zbMATH Open1544.90056MaRDI QIDQ6579136FDOQ6579136

Authors: Elene Anton, Rhonda Righter, Ina Maria Verloop 

Publication date: 25 July 2024

Published in: Queueing Systems (Search for Journal in Brave)

Recommendations

• Redundancy scheduling with scaled Bernoulli service requirements
• Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
• On the Stability of Redundancy Models
• Queueing with redundant requests: exact analysis
• Fork-join and redundancy systems with heavy-tailed job sizes

zbMATH Keywords

performanceschedulingredundancycompatibilities

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Title not available (Why is that?)
• Performance modeling and design of computer systems. Queueing theory in action
• Queueing with redundant requests: exact analysis
• Resource allocation in grid computing
• Multiple-server system with flexible arrivals
• Stability of queueing networks. École d'Été de probabilités de Saint-Flour XXXVI-2006
• On the Stability of Redundancy Models
• Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
• Redundancy scheduling with scaled Bernoulli service requirements
• Title not available (Why is that?)
• Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
• Partial flexibility in routeing and scheduling
• Job replication on multiserver systems
• A lower bound on the stability region of redundancy-\(d\) with FIFO service discipline

Cited In (1)

• Fork-join and redundancy systems with heavy-tailed job sizes

This page was built for publication: Efficient scheduling in redundancy systems with general service times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579136)