Online scheduling FIFO policies with admission and push-out

DOI10.1007/s00224-015-9626-4zbMath1336.68021DBLPjournals/mst/KoganLNS16OpenAlexW2012445592WikidataQ57100888 ScholiaQ57100888MaRDI QIDQ255276

Alejandro López-Ortiz, Alexander V. Sirotkin, Kirill Kogan, Sergey I. Nikolenko

Publication date: 9 March 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-015-9626-4

zbMATH Keywords

schedulingcompetitive analysisonline algorithmsbuffer managementswitchesfirst-in-first-out queueing

Mathematics Subject Classification ID

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

Related Items (2)

The impact of processing order on performance: a taxonomy of semi-FIFO policies ⋮ Online buffer management for transmitting packets with processing cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Job-shop scheduling with limited capacity buffers
• Lower and upper bounds on FIFO buffer management in QoS switches
• Nonclairvoyant scheduling
• Predictive scheduling of network processors.
• The hybrid flow shop scheduling problem
• 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
• Buffer Overflow Management in QoS Switches
• Online Scheduling to Minimize Average Stretch
• FIFO Queueing Policies for Packets with Heterogeneous Processing
• Optimal smoothing schedules for real-time streams
• 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: Online scheduling FIFO policies with admission and push-out