We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
George Christodoulou, Elias Koutsoupias, Angelina ...
In the last years, a progressive migration from single processor chips to multi-core computing devices has taken place in the general-purpose and embedded system market. The devel...
In this article we present the design choices and the evaluation of a batch scheduler for large clusters, named OAR. This batch scheduler is based upon an original design that emp...
Nicolas Capit, Georges Da Costa, Yiannis Georgiou,...
We propose using least attained service (LAS) scheduling in network routers to prevent some connections against utilizing all or a large fraction of network bandwidth. This phenome...
Idris A. Rai, Guillaume Urvoy-Keller, Ernst W. Bie...
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...