Online Sorting Buffers on Line

DOI10.1007/11672142_48MaRDI QIDQ5449832zbMATH OpenOpenAlexFDO

Authors Rohit Khandekar, Vinayaka Pandit

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11672142_48

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Searching and sorting (68P10)

Recommendations

• Online and offline algorithms for the sorting buffers problem on the line metric
• Offline Sorting Buffers on Line
• scientific article; zbMATH DE number 1947443
• Online minimum makespan scheduling with a buffer
• Improved Online Algorithms for the Sorting Buffer Problem

Cited in

(8)

• Online and offline algorithms for the sorting buffers problem on the line metric
• Improved online algorithms for the sorting buffer problem on line metrics
• Weighted reordering buffer improved via variants of knapsack covering inequalities
• Improved Online Algorithms for the Sorting Buffer Problem
• scientific article; zbMATH DE number 1947443 (Why is no real title available?)
• Optimal online buffer scheduling for block devices
• Offline Sorting Buffers on Line
• Buffer management for colored packets with deadlines

This page was built for publication: Online Sorting Buffers on Line

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