Publications related to Scheduler modeling based on the controller synthesis paradigm

Business/IT Alignment in Practice: Lessons Learned From a Requirements Project at P&G

One of the main objectives of the alignment of Business and IT in both small and large organizations is to improve the chances for an IT department to provide services that result in business success. An essential phase for this alignment is the definition ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

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

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

Friedrich Eisenbrand, Thomas Rothvoss

In the synchronous periodic task model, a set \tau_1,...,\tau_n of tasks is given, each releasing jobs of running time c_i with relative deadline d_i, at each integer multiple of the period p_i. It is a classical result that Earliest Deadline First (EDF) i ...

2010

Priority scheduling of distributed systems based on model checking

Joseph Sifakis

Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is hard to find efficient implementations for priorities; because they express ...

2009

Multi-experts scheduling system for real-time applications

Mario Bellino

This thesis focuses on the decisional process of autonomous systems, and more particularly, on the way to take a decision when the time at disposal in order to assess the whole situation is shorter than necessary. Indeed, numerous systems propose solutions ...

EPFL2009

Exact quantification of the sub-optimality of uniprocessor fixed-priority pre- emptive scheduling

Thomas Rothvoss

This paper examines the relative effectiveness of fixed priority pre-emptive scheduling in a uniprocessor system, compared to an optimal algorithm. The quantitative metric used in this comparison is the processor speedup factor, equivalent to the factor by ...

2009

On the computational complexity of periodic scheduling

Thomas Rothvoss

In periodic scheduling jobs arrive regularly and have to be executed on one or several machines or processors. An enormous amount of literature has been published on this topic, e.g. the founding work of Liu & Layland [LL73] is among the top cited computer ...

EPFL2009

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

Max-Olivier Hongler, Olivier Gallay

We propose a new real-time load sharing policy (LSP), which optimally dispatches the incoming workload according to the current availability of the operators. Optimality means here that the global service permanently requires the engagement of a minimum nu ...

2009

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

Friedrich Eisenbrand, Thomas Rothvoss

We present a polynomial time approximation scheme for the real-time scheduling problem with fixed priorities when resource augmentation is allowed. For a fixed ε > 0, our algorithmcomputes an assignment using atmost (1+ε)·OPT +1 processors in polynomial ti ...

Springer2008

Ianos: An intelligent application oriented scheduling framework for an HPCN grid

Vincent Keller, Pierre Kuonen

We present the architecture and design of the IANOS scheduling framework. The goal of the new Grid scheduling system is to provide a general job submission framework allowing optimal positioning and scheduling of HPCN applications. The scheduling algorithm ...

Springer, 233 Spring Street, New York, Ny 10013, United States2008

Scheduler modeling based on the controller synthesis paradigm

Graph Chatbot

Chat with Graph Search

Business/IT Alignment in Practice: Lessons Learned From a Requirements Project at P&G

Scheduling periodic tasks in a hard real-time environment

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

Priority scheduling of distributed systems based on model checking

Multi-experts scheduling system for real-time applications

Exact quantification of the sub-optimality of uniprocessor fixed-priority pre- emptive scheduling

On the computational complexity of periodic scheduling

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

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

Ianos: An intelligent application oriented scheduling framework for an HPCN grid

Scheduling periodic tasks in a hard real-time environment

Exact quantification of the sub-optimality of uniprocessor fixed-priority pre- emptive scheduling

On the computational complexity of periodic scheduling

Multi-experts scheduling system for real-time applications

Business/IT Alignment in Practice: Lessons Learned From a Requirements Project at P&G

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

Priority scheduling of distributed systems based on model checking

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

Ianos: An intelligent application oriented scheduling framework for an HPCN grid

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