Scheduling periodic tasks in a hard real-time environment

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Understanding the performance of data-parallel workloads when resource-constrained has significant practical importance but unfortunately has received only limited attention. This paper identifies, quantifies and demonstrates memory elasticity, an intrinsi ...

Scheduling periodic tasks in a hard real-time environment

Chat with Graph Search

Relatively Robust Economic Order Quantity with Optimal Laplacian Confidence Intervals

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

Approximation Algorithms for Allocation and Network Design

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

Fairness and Explainability in Clustering Problems

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

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

Streaming and Matching Problems with Submodular Functions

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

Grid-Aware Real-Time Control of Electric Vehicles

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

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

Design of adaptive structures through energy minimization: extension to tensegrity

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

A Quasi-Polynomial Approximation For The Restricted Assignment Problem

Local approximation of the Maximum Cut in regular graphs

Combining Dynamic & Static Scheduling in High-level Synthesis

Local Approximation of the Maximum Cut in Regular Graphs

An Optimal Space Lower Bound for Approximating MAX-CUT

Don't cry over spilled records: Memory elasticity of data-parallel applications and its application to cluster scheduling