Generalized Reordering Buffer Management

DOI10.4230/LIPICS.STACS.2014.87MaRDI QIDQ2965475zbMATH OpenOpenAlexFDO

Authors Matthias Englert, Iftah Gamzu, Eytan Kidron, Yossi Azar

Publication date 3 March 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.STACS.2014.87

zbMATH Keywords

online algorithmspagingreordering buffer

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• New Approximations for Reordering Buffer Management
• Almost Tight Bounds for Reordering Buffer Management
• Almost tight bounds for reordering buffer management
• Reordering buffer management with advice
• Reordering buffer management with advice
• An improved competitive algorithm for reordering buffer management
• An improved competitive algorithm for reordering buffer management
• scientific article; zbMATH DE number 7204485
• A Constant Factor Approximation Algorithm for Reordering Buffer Management
• Automata, Languages and Programming

Cited in

(9)

• New Approximations for Reordering Buffer Management
• Reordering buffer management with advice
• Almost Tight Bounds for Reordering Buffer Management
• scientific article; zbMATH DE number 2119649 (Why is no real title available?)
• scientific article; zbMATH DE number 5899288 (Why is no real title available?)
• Almost tight bounds for reordering buffer management
• Online stochastic reordering buffer scheduling
• On the randomized competitive ratio of reordering buffer management with non-uniform costs
• Reordering buffer management with advice

This page was built for publication: Generalized Reordering Buffer Management

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