Publications related to EDF-schedulability of synchronous periodic task systems is coNP-hard

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.

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

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

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

Hardness Results for Consensus-Halving

Jie Zhang, Aris Filos Ratsikas

The Consensus-halving problem is the problem of dividing an object into two portions, such that each of n agents has equal valuation for the two portions. We study the epsilon-approximate version, which allows each agent to have an epsilon discrepancy on t ...

Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik2018

Near-optimal Deployment of Dataflow Applications on Many-core Platforms with Real-time Guarantees

Alena Simalatsar, Stefanos Skalistis

Safe and optimal deployment of data-streaming applications on many-core platforms requires the realistic estimation of task Worst-Case Execution Time (WCET). On the other hand, task WCET depends on the deployment solution, due to the varying number of inte ...

IEEE2017

Online Energy-Efficient Task-Graph Scheduling for Multicore Platforms

David Atienza Alonso, Karim Kanoun

Numerous Directed-Acyclic Graph (DAG) schedulers have been developed to improve the energy efficiency of various multi-core platforms. However, these schedulers make a priori assumptions about the relationship between the task dependencies, and they are un ...

Institute of Electrical and Electronics Engineers2014

Task Scheduling for Highly Concurrent Analytical and Transactional Main-Memory Workloads

Anastasia Ailamaki, Iraklis Psaroudakis

Task scheduling typically employs a worker thread per hardware context to process a dynamically changing set of tasks. It is an appealing solution to exploit modern multi-core processors, as it eases parallelization and avoids unnecessary context switches ...

2013

Santa Claus Schedules Jobs On Unrelated Machines

Ola Nils Anders Svensson

One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines; i.e., job j requires time p(ij) if processed on machine i. More t ...

Siam Publications2012

EDF-schedulability of synchronous periodic task systems is coNP-hard

Graph Chatbot

Chat with Graph Search

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

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

Combining Dynamic & Static Scheduling in High-level Synthesis

Hybrid, Job-Aware, and Preemptive Datacenter Scheduling

Hardness Results for Consensus-Halving

Near-optimal Deployment of Dataflow Applications on Many-core Platforms with Real-time Guarantees

Efficient Adaptive Hard Real-time Multi-processor Systems

Online Energy-Efficient Task-Graph Scheduling for Multicore Platforms

Task Scheduling for Highly Concurrent Analytical and Transactional Main-Memory Workloads

Santa Claus Schedules Jobs On Unrelated Machines

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

Hybrid, Job-Aware, and Preemptive Datacenter Scheduling

Combining Dynamic & Static Scheduling in High-level Synthesis

Task Scheduling for Highly Concurrent Analytical and Transactional Main-Memory Workloads

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

Near-optimal Deployment of Dataflow Applications on Many-core Platforms with Real-time Guarantees

Efficient Adaptive Hard Real-time Multi-processor Systems

Online Energy-Efficient Task-Graph Scheduling for Multicore Platforms

Hardness Results for Consensus-Halving

Santa Claus Schedules Jobs On Unrelated Machines