Publications related to Round-robin scheduling

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

EPFL2023

Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

Jean-Yves Le Boudec, Ehsan Mohammadpour

Dampers are devices that reduce delay jitter in the context of time-sensitive networks, by delaying packets for the amount written in packet headers. Jitter reduction is required by some real-time applications; beyond this, dampers have the potential to so ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis

Paolo Ienne, Lana Josipovic

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

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Deficit Round-Robin: A Second Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays for DRR were found by Boyer et al., who used a rigorous network calculus approach and characterized the ser ...

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

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

Deficit Round-Robin: A Second Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays obtained with DRR were found by Boyer et al. They used a rigorous network calculus approach and characteriz ...

2021

Performance Comparison of Alternating Direction Optimization Methods for Linear-OPF based Real-time Predictive Control

Mario Paolone, Fabrizio Sossan, Rahul Kumar Gupta, Vladimir Sovljanski

The paper contributes to improving the computational performance of controls of distributed energy resources (DERs) in distribution grids for efficient real-time control and short-term scheduling. The considered setting is a distribution grid with heteroge ...

IEEE2021

Interleaved Weighted Round-Robin: A Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

2020

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Round-robin scheduling

OASIS: An integrated optimisation framework for activity scheduling

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis

Deficit Round-Robin: A Second Network Calculus Analysis

Flow Time Scheduling and Prefix Beck-Fiala

Interleaved Weighted Round-Robin: A Network Calculus Analysis

Deficit Round-Robin: A Second Network Calculus Analysis

Performance Comparison of Alternating Direction Optimization Methods for Linear-OPF based Real-time Predictive Control

Interleaved Weighted Round-Robin: A Network Calculus Analysis

Graph Chatbot

Chat with Graph Search

Deficit Round-Robin: A Second Network Calculus Analysis

Flow Time Scheduling and Prefix Beck-Fiala

Interleaved Weighted Round-Robin: A Network Calculus Analysis

OASIS: An integrated optimisation framework for activity scheduling

Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Deficit Round-Robin: A Second Network Calculus Analysis

Interleaved Weighted Round-Robin: A Network Calculus Analysis

Performance Comparison of Alternating Direction Optimization Methods for Linear-OPF based Real-time Predictive Control

DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis