Publications related to Task (computing)

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.

Scheduling periodic tasks in a hard real-time environment

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks

\tau_i=(c_i,p_i)

on a minimum number of identical machines a ...

Springer-Verlag2010

Task (computing)

Graph Chatbot

Chat with Graph Search

The effects of practice schedule and critical thinking prompts on learning and transfer of a complex judgment task.

A Data-oriented Transaction Execution Engine and Supporting Tools

A Tighter Analysis of Work Stealing

Scheduling periodic tasks in a hard real-time environment

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

Multi-Agent Adaptive Mechanism Leading to Optimal Real-Time Load Sharing

On the computational complexity of periodic scheduling

Systematic Design Flow for Dynamic Data Management in Visual Texture Decoder of MPEG-4

Parallel depth first vs. work stealing schedulers on CMP architectures

Efficient resource sharing in concurrent error detecting superscalar microarchitectures

A Tighter Analysis of Work Stealing

A Data-oriented Transaction Execution Engine and Supporting Tools

The effects of practice schedule and critical thinking prompts on learning and transfer of a complex judgment task.

Scheduling periodic tasks in a hard real-time environment

Parallel depth first vs. work stealing schedulers on CMP architectures

Efficient resource sharing in concurrent error detecting superscalar microarchitectures

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

Multi-Agent Adaptive Mechanism Leading to Optimal Real-Time Load Sharing

On the computational complexity of periodic scheduling

Systematic Design Flow for Dynamic Data Management in Visual Texture Decoder of MPEG-4