Raises the lower bound on competitiveness for all deterministic online algorithms in the shared memory switch to √2 and establishes a new lower bound of 1.44546 for the LQD policy via explicit constructions, simulations, and linear programming.
Hahne, Alexander Kesselman, and Yishay Mansour
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
New Competitiveness Bounds for the Shared Memory Switch
Raises the lower bound on competitiveness for all deterministic online algorithms in the shared memory switch to √2 and establishes a new lower bound of 1.44546 for the LQD policy via explicit constructions, simulations, and linear programming.