Online scheduling FIFO policies with admission and push-out

DOI10.1007/S00224-015-9626-4zbMATH Open1336.68021DBLPjournals/mst/KoganLNS16OpenAlexW2012445592WikidataQ57100888 ScholiaQ57100888MaRDI QIDQ255276FDOQ255276

Authors: Kirill Kogan, Alejandro Lopez-Ortiz, Sergey Nikolenko, Alexander V. Sirotkin 

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

Recommendations

• scientific article; zbMATH DE number 1947443
• On-line scheduling revisited
• Preemptive online algorithms for scheduling
• Scheduling for flow-time with admission control
• Preemptive online scheduling with reordering
• Preemptive Online Scheduling with Reordering
• Online scheduling of equal-processing-time task systems
• scientific article; zbMATH DE number 7051282
• Online scheduling of packets with agreeable deadlines

zbMATH Keywords

online algorithmsbuffer managementcompetitive analysisfirst-in-first-out queueingschedulingswitches

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• Job-shop scheduling with limited capacity buffers

Cited In (3)

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

This page was built for publication: Online scheduling FIFO policies with admission and push-out

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