7 citations · 11 across the 6 of their papers we have counts for
6 papers
-CounterBoost: Optimizing response time tails using job type information only
Nils Charlet, Benny Van Houdt
In a recent paper the -Boost scheduling policy was shown to minimize the tail of the response time distribution in a light-tailed M/G/1-queue. This policy schedules jobs using a…
Tail Optimality and Performance Analysis of the Nudge*(M) Scheduling Algorithm
Nils Charlet, Benny Van Houdt
Recently it was shown that the response time of First-Come-First-Served (FCFS) scheduling can be stochastically and asymptotically improved upon by the {\it Nudge} scheduling algor…
Approximations to Study the Impact of the Service Discipline in Systems with Redundancy
Nicolas Gast, Benny van Houdt
As job redundancy has been recognized as an effective means to improve performance of large-scale computer systems, queueing systems with redundancy have been studied by various au…
On the stochastic and asymptotic improvement of First-Come First-Served and Nudge scheduling
Benny Van Houdt
Recently it was shown that, contrary to expectations, the First-Come-First-Served (FCFS) scheduling algorithm can be stochastically improved upon by a scheduling algorithm called {…
Free Energy Approximations for CSMA networks
Benny Van Houdt
In this paper we study how to estimate the back-off rates in an idealized CSMA network consisting of links to achieve a given throughput vector using free energy approximations…
Explicit back-off rates for achieving target throughputs in CSMA/CA networks
Benny Van Houdt
CSMA/CA networks have often been analyzed using a stylized model that is fully characterized by a vector of back-off rates and a conflict graph. Further, for any achievable through…