RTNS'06 PROGRAM





Tuesday 30th May:





9h00-9h15am: Welcome

9h15-10h15am: Keynote talk: S.K. Baruah, Multiprocessor Real-time Scheduling Theory: questions (many) and answers (a few)



10h15-10h45am: Coffee Break



10h45-12h15pm:

Uniprocessor scheduling I

Chair: S.K. Baruah

24

Worst-case analysis of feasibility tests for self-suspending tasks

Frédéric Ridouard and Pascal Richard

42

Bi-Criteria Fixed-Priority Scheduling in Hard Real-Time Systems: Deadline and Importance

A. Aguilar-Soto and G. Bernat

45

Near-Optimal Fixed Priority Preemptive Scheduling of Offset Free Systems

Mathieu Grenier, Joël Goossens and Nicolas Navet




12h30-2h00pm: Lunch



2h00-3h30pm:

Network

Chair: G. Juanole

22

Worst-case Analysis of a mixed CAN/Switched Ethernet architecture

Jérôme Ermont, Jean-Luc Scharbarg and Christian Fraboul

35

R-(m,k) firm: A novel QoS scheme for real-time flow guarantee in Networks

Jian Li, YeQiong Song

38

SCoCAN: A communication Protocol for Distributed Real Time Systems

J.O. Coronel, P. Pérez, G. Benet, F. Blanes, J.E. Simó and A. Crespo




3h30-4h00pm: Coffee Break



4h00-5h00pm:

Resource and Data Management

Chair: F. Simonot-Lion

33

Utility Accrual Real-Time Resource Access Protocols with Assured Individual Activity Timeliness Behavior

Peng Li, Binoy Ravindran and E. Douglas Jensen

46

The Real-Time MATPLC

Mario de Souza and Adriano Carvalho





6h00pm: Trip to poitiers

6h00-8h00pm: Visit of Poitiers

8h00pm: Banquet Diner





Wednesday 31th May:



8h45-10h15am:

Multiprocessor Scheduling

Chair: J. Goossens

23

The Partitioned Multiprocessor Scheduling of Non-preemptive Sporadic Task Systems

Nathan Fisher and Sanjoy K. Baruah

29

Probabilistic QoS Assessment of Tasks with Uncertain Parameters in Multi-Processor Scheduling

Amare Leulseged and Nimal Nissanke

34

A Comparison of Global and Partitioned EDF Schedulability Tests for Multiprocessors

Ted Baker



10h15-10h45am: Coffee Break



10h45-12h15pm:

Resource and Constraint Management

Chair: N. Nissanke

27

Solving allocation problems of Hard Real-Time Systems with Dynamic Constraint Programming

Pierre-Emmanuel Hladik, Hadrien Cambazard, Anne-Marie Deplanche, Narendra Jussien

30

Improvement of QoD and QoS in RTDBS

Emna Bouazizi, Claude Duvallet and Bruno Sadeg

39

Schedulability Analysis of Serial Transactions

Karim Traore, Emmanuel Grolleau and Francis Cottet




12h30-2h00pm: Lunch



2h00-3h30pm:

WCET

Chair: I. Puaut

40

Code padding to improve the WCET calculability

Christine Rochange and Pacsal Sainrat

43

A Verifiable and Distributed WCET Computation for Constrained Embedded Systems

Nadia Bel Hadj Aissa and David Symplo-Ryl

44

Dymamic Instruction Cache Locking in Hard Real-Time Systems

Alexis Arnaud and Isabelle Puaut




3h30-4h00pm: Coffee Break



4h00-5h00pm:

Uniprocessor scheduling II

Chair: N. Navet

28

Polynomial Time Approximate Schedulability Tests for Fixed-Priority real-time tasks: some numerical experimentations

Pascal Richard

32

Feasibility Conditions with Kernel Overheads for Periodic Tasks with Fixed Priority Scheduling on an Event Driven OSEK System

Franck Bimbard and Laurent George