Publications related to Scheduling periodic tasks in a hard real-time environment

Related publications (32)

Relatively Robust Economic Order Quantity with Optimal Laplacian Confidence Intervals

The parameters for determining the economic order quantity (EOQ) are often not well known or may change between order cycles in an unpredictable manner. We propose a distribution-free method to determine a relatively robust EOQ that guarantees optimal cost ...

IEEE2025

Advancing Distributed AC Optimal Power Flow for Integrated Transmission-Distribution Systems

Colin Neil Jones, Yuning Jiang

This paper introduces a distributed operational solution for integrated transmission-distribution (ITD) system management. A fundamental challenge in designing distributed approaches for AC optimal power flow (OPF) problems in ITD systems is the nonconvexi ...

IEEE COMPUTER SOC2025

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

A Proximal-Point Lagrangian-Based Parallelizable Nonconvex Solver for Bilinear Model Predictive Control

Colin Neil Jones, Yuning Jiang, Yingzhao Lian

Nonlinear model predictive control (NMPC) has been widely adopted to manipulate bilinear systems with dynamics that include products of the inputs and the states. These systems are ubiquitous in chemical processes, mechanical systems, and quantum physics, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Fairness and Explainability in Clustering Problems

Xinrui Jia

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

EPFL2023

Structural impact of the start-up sequence on Pelton turbines lifetime: Analytical prediction and polynomial optimization

Mario Paolone, Elena Vagnoni, Aldo Leonardo Alerci

Hydropower plants play a crucial role in the power system facing ambitious renewable energy targets. Due to their inherent controllability, they are well suited to provide flexibility to the grid. However, an increased flexibility provision leads to a prol ...

Pergamon-Elsevier Science Ltd2023

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

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

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

Grid-Aware Real-Time Control of Electric Vehicles

Roman Rudnik

Electric vehicles (EVs) are already part of today's reality and their number is expected to grow rapidly in the near future. A large-scale penetration of EVs will increase the power consumption during charging periods. Hence, the uncoordinated and random c ...

EPFL2022

A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem

Ola Nils Anders Svensson, Etienne Michel François Bamas, Marina Rebekah Rosie Drygala

The Matching Augmentation Problem (MAP) has recently received significant attention as an important step towards better approximation algorithms for finding cheap 2-edge connected subgraphs. This has culminated in a 5/3-approximation algorithm. However, th ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

ASSOC COMPUTING MACHINERY2021

Design of adaptive structures through energy minimization: extension to tensegrity

Gennaro Senatore, Yafeng Wang

This paper gives a new formulation to design adaptive structures through total energy optimization (TEO). This methodology enables the design of truss as well as tensegrity configurations that are equipped with linear actuators to counteract the effect of ...

2021

Equinox: Training (for Free) on a Custom Inference Accelerator

Babak Falsafi, Martin Jaggi, Mario Paulo Drumond Lages De Oliveira, Ahmet Caner Yüzügüler, Arash Pourhabibi Zarandi, Louis Coulon

DNN inference accelerators executing online services exhibit low average loads because of service demand variability, leading to poor resource utilization. Unfortunately, reclaiming idle inference cycles is difficult as other workloads can not execute on a ...

ACM2021

A Quasi-Polynomial Approximation For The Restricted Assignment Problem

Lars Rohwedder

The RESTRICTED ASSIGNMENT problem is a prominent special case of SCHEDULING ON UNRELATED PARALLEL MACHINES. For the strongest known linear programming relaxation, the configuration LP, we improve the nonconstructive bound on its integrality gap from 1.9412 ...

SIAM PUBLICATIONS2020

Local approximation of the Maximum Cut in regular graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut (MAXCUT) in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communica ...

ELSEVIER2020

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

ASSOC COMPUTING MACHINERY2020

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

An Optimal Space Lower Bound for Approximating MAX-CUT

Mikhail Kapralov

We consider the problem of estimating the value of MAX-CUT in a graph in the streaming model of computation. At one extreme, there is a trivial 2-approximation for this problem that uses only O(log n) space, namely, count the number of edges and output hal ...

ASSOC COMPUTING MACHINERY2019