Proceedings of the 27th annual international symposium on Computer architecture
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Online Scheduling for Sorting Buffers
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
An optimal online algorithm for packet scheduling with agreeable deadlines
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive queue policies for differentiated services
Journal of Algorithms
Reordering buffers for general metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower and upper bounds on FIFO buffer management in QoS switches
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Better online buffer management
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved online algorithms for buffer management in QoS switches
ACM Transactions on Algorithms (TALG)
Exploiting locality: approximating sorting buffers
Journal of Discrete Algorithms
Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors
Proceedings of the 40th Annual IEEE/ACM International Symposium on Microarchitecture
Competitive queue management for latency sensitive packets
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Collecting weighted items from a dynamic queue
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Prefetch-Aware DRAM Controllers
Proceedings of the 41st annual IEEE/ACM International Symposium on Microarchitecture
Improved online algorithms for the sorting buffer problem
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Evaluation of online strategies for reordering buffers
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Online sorting buffers on line
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Reordering buffer management for non-uniform cost models
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Packet buffering: randomization beats deterministic algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Offline sorting buffers on line
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A survey of buffer management policies for packet switches
ACM SIGACT News
Hi-index | 0.00 |
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the number of packets delivered by their deadline. For a single port or with free reconfiguration, the problem reduces to the well-known packets scheduling problem, where the celebrated earliest-deadline-first (EDF) strategy is optimal 1-competitive. However, EDF is not 1-competitive when there is a reconfiguration overhead. We design an online algorithm that achieves a competitive ratio of 1 - o(1) when the ratio between the minimum laxity of the packets and the number of ports tends to infinity. This is one of the rare cases where one can design an almost 1-competitive algorithm. One ingredient of our analysis, which may be interesting on its own right, is a perturbation theorem on EDF for the classical packets scheduling problem. Specifically, we show that a small perturbation in the release and deadline times cannot significantly degrade the optimal throughput. This implies that EDF is robust in the sense that its throughput is close to the optimum even when the deadlines are not precisely known.