Scheduling with deadlines and buffer management with processing requirements

DOI10.1007/S00453-016-0257-1MaRDI QIDQ2408172zbMATH OpenOpenAlexFDO

Authors Yossi Azar, Oren Gilon

Publication date 10 October 2017

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-016-0257-1

zbMATH Keywords

buffer managementcompetitive analysisdeadlinesjob schedulingonline algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Buffer management for packets with processing times
• Online scheduling of packets with agreeable deadlines
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Online scheduling of bounded length jobs to maximize throughput
• Online buffer management for transmitting packets with processing cycles

Cites work

• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Algorithms – ESA 2004
• An improved algorithm for CIOQ switches
• Buffer Overflow Management in QoS Switches
• Competitive buffer management with packet dependencies
• Competitive queue policies for differentiated services
• Considering suppressed packets improves buffer management in QoS switches
• scientific article; zbMATH DE number 1670533 (Why is no real title available?)
• scientific article; zbMATH DE number 1263237 (Why is no real title available?)
• Improved competitive performance bounds for CIOQ switches
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• On the Performance of Greedy Algorithms in Packet Buffering
• Optimal smoothing schedules for real-time streams (extended abstract)
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Speed is as powerful as clairvoyance

Cited in

(5)

• Scheduling multipacket frames with frame deadlines
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Randomized algorithm for agreeable deadlines packet scheduling
• Buffer management for packets with processing times
• Scheduling with tails and deadlines

This page was built for publication: Scheduling with deadlines and buffer management with processing requirements

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