Publications associées à Ordonnancement dans les systèmes d'exploitation

From C/C plus plus Code to High-Performance Dataflow Circuits

Paolo Ienne, Andrea Guerrieri, Lana Josipovic

High-level synthesis (HLS) tools typically generate statically scheduled datapaths. Static scheduling implies that the resulting circuits have a hard time exploiting parallelism in code with potential memory dependences, with control dependences, or where ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Flow Time Scheduling and Prefix Beck-Fiala

Ola Nils Anders Svensson, Lars Rohwedder

We relate discrepancy theory with the classic scheduling problems of minimizing max flow time and total flow time on unrelated machines. Specifically, we give a general reduction that allows us to transfer discrepancy bounds in the prefix Beck-Fiala (bound ...

ASSOC COMPUTING MACHINERY2022

Capturing trade-offs between daily scheduling choices

Michel Bierlaire, Timothy Michael Hillel, Janody Pougala

We propose a new modelling approach for daily activity scheduling which integrates the different daily scheduling choice dimensions (activity participation, location, schedule, duration and transportation mode) into a single optimisation problem. The funda ...

ELSEVIER SCI LTD2022

Deciding Robustness for Lower SQL Isolation Levels

Christoph Koch, Bas Ketsman

While serializability always guarantees application correctness, lower isolation levels can be chosen to improve transaction throughput at the risk of introducing certain anomalies. A set of transactions is robust against a given isolation level if every p ...

ASSOC COMPUTING MACHINERY2022

Resolving time conflicts in activity-based scheduling

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 ...

2021

Resolving time conflicts in activity-based scheduling: A case study of Lausanne

Michel Bierlaire, Timothy Michael Hillel, Janody Pougala

2021

Interleaved Weighted Round-Robin: A Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or tasks. With WRR, a number of packets equal to the weight allocated to a flow can be served consecutively, which leads to a bursty service. Interleaved Weighted Round ...

IEICE-INST ELECTRONICS INFORMATION COMMUNICATION ENGINEERS2021

When to Hedge in Interactive Services

Edouard Bugnion, Mia Primorac

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 ...

USENIX2021

Exploring causalities between modal habits, activity scheduling, and multi-day locational practices.

Marc-Edouard Baptiste Grégoire Schultheiss

Despite raising awareness of sustainable behavior and considerable investments in the public transport network and active mobility infrastructure, car use remains the main practice for daily mobility in Switzerland. This work postulates that resistances to ...

2021

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Ordonnancement dans les systèmes d'exploitation

From C/C plus plus Code to High-Performance Dataflow Circuits

Flow Time Scheduling and Prefix Beck-Fiala

Capturing trade-offs between daily scheduling choices

Grid-Aware Real-Time Control of Electric Vehicles

Deciding Robustness for Lower SQL Isolation Levels

Resolving time conflicts in activity-based scheduling

Resolving time conflicts in activity-based scheduling: A case study of Lausanne

Interleaved Weighted Round-Robin: A Network Calculus Analysis

When to Hedge in Interactive Services

Exploring causalities between modal habits, activity scheduling, and multi-day locational practices.

Graph Chatbot

Chattez avec Graph Search

From C/C plus plus Code to High-Performance Dataflow Circuits

Grid-Aware Real-Time Control of Electric Vehicles

Interleaved Weighted Round-Robin: A Network Calculus Analysis

Resolving time conflicts in activity-based scheduling

Deciding Robustness for Lower SQL Isolation Levels

Flow Time Scheduling and Prefix Beck-Fiala

Resolving time conflicts in activity-based scheduling: A case study of Lausanne

When to Hedge in Interactive Services

Exploring causalities between modal habits, activity scheduling, and multi-day locational practices.

Capturing trade-offs between daily scheduling choices