Efficiency of first-come first-served algorithms
U. Loher · 2002
We derive a new upper bound on the efficiency of first-come first-served algorithms (FCFSA) based on a genie argument. This upper bound of 0.4906 is only slightly higher than today's best known algorithm which achieves a maximum stable throughput of 0.4878.