The impact of processing order on performance: a taxonomy of semi-FIFO policies
From MaRDI portal
Publication:2361355
DOI10.1016/j.jcss.2017.04.001zbMath1371.68047DBLPjournals/jcss/KoganLNS17OpenAlexW2608449519WikidataQ58452100 ScholiaQ58452100MaRDI QIDQ2361355
Alejandro López-Ortiz, Kirill Kogan, Sergey I. Nikolenko, Alexander V. Sirotkin
Publication date: 30 June 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2017.04.001
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online scheduling FIFO policies with admission and push-out
- An experimental study of new and known online packet buffering algorithms
- Lower and upper bounds on FIFO buffer management in QoS switches
- Nonclairvoyant scheduling
- Predictive scheduling of network processors.
- Maximizing throughput in multi-queue switches
- Improved competitive performance bounds for CIOQ switches
- An improved algorithm for CIOQ switches
- Competitive queue policies for differentiated services
- Essential Traffic Parameters for Shared Memory Switch Performance
- Buffer Overflow Management in QoS Switches
- Online Scheduling to Minimize Average Stretch
- Optimal smoothing schedules for real-time streams
- On the Performance of Greedy Algorithms in Packet Buffering
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
This page was built for publication: The impact of processing order on performance: a taxonomy of semi-FIFO policies
