Concept
Earliest deadline first scheduling
Publications associées (77)
Resolving time conflicts in activity-based scheduling: A case study of Lausanne
Michel Bierlaire, Timothy Michael Hillel, Janody Pougala
In this paper, we present a novel activity-based scheduling model that combines a continuous optimisation framework for temporal scheduling decisions (i.e. activity timings and durations) with traditional discrete choice models for non-temporal choice dime ...
2021When to Hedge in Interactive Services
In online data-intensive (OLDI) services, each client request typically executes on multiple servers in parallel; as a result, “system hiccups”, although rare within a single server, can interfere with many client requests and cause violations of service-l ...
USENIX2021Extending R2P2 with Congestion Control and Request-Level Scheduling
Distributed low-latency datacenter applications must meet strict service-level objectives in the order of microseconds. R2P2 is a novel datacenter transport protocol designed for such services. This work extends R2P2 with congestion control and request-lev ...
2020Combining Dynamic & Static Scheduling in High-level Synthesis
A central task in high-level synthesis is scheduling: the allocation of operations to clock cycles. The classic approach to scheduling is static, in which each operation is mapped to a clock cycle at compile-time, but recent years have seen the emergence o ...
ASSOC COMPUTING MACHINERY2020Hybrid, Job-Aware, and Preemptive Datacenter Scheduling
Scheduling in datacenters is an important, yet challenging problem. Datacenters are composed of a large number, typically tens of thousands, of commodity computers running a variety of data-parallel jobs. The role of the scheduler is to assign cluster reso ...
EPFL2018Status Updates in a multi-stream M/G/1/1 preemptive queue
We consider a source that collects a multiplicity of streams of updates and sends them through a network to a monitor. However, only a single update can be in the system at a time. Therefore, the transmitter always preempts the packet being served when a n ...
IEEE2018The Battle of the Schedulers: FreeBSD ULE vs. Linux CFS
Willy Zwaenepoel, Baptiste Joseph Eustache Lepers, Sébastien Chevalley, Justinien Gérard Alain Bouron
This paper analyzes the impact on application performance of the design and implementation choices made in two widely used open-source schedulers: ULE, the default FreeBSD scheduler, and CFS, the default Linux scheduler. We compare ULE and CFS in otherwise ...
2018The Battle of the Schedulers: FreeBSD ULE vs. Linux CFS
Willy Zwaenepoel, Baptiste Joseph Eustache Lepers, Sébastien Chevalley, Justinien Gérard Alain Bouron
This paper analyzes the impact on application performance of the design and implementation choices made in two widely used open-source schedulers: ULE, the default FreeBSD scheduler, and CFS, the default Linux scheduler. We compare ULE and CFS in otherwise ...
USENIX ASSOC2018A Framework Based on Predictive Maintenance, Zero-Defect Manufacturing and Scheduling Under Uncertainty Tools, to Optimize Production Capacities of High-End Quality Products
Nowadays exploiting the full potential of the humongous amount of data that manufactures can produce with their production means is a real challenge. Moreover, increasing production capabilities without large investments is a recurring objective for them. ...
SPRINGER-VERLAG BERLIN2018A Theory of Traffic Regulators for Deterministic Networks with Application to Interleaved Regulators
We define the minimal interleaved regulator, which generalizes the Urgency Based Shaper that was recently proposed by Specht and Samii as a simpler alternative to per-flow reshaping in deterministic networks with aggregate scheduling. With this regulator, ...
Arxiv2018