A GENERALIZED VIEW ON BENEFICIAL TASK SORTINGS FOR PARTITIONED RMS TASK
ALLOCATION ON MULTIPROCESSORS
Dirk Müller and Matthias Werner

ADAPTIVE SCHEDULABILITY ANALYSIS
Luca Santinelli

HOW MANY BOUNDARIES ARE REQUIRED TO ENSURE OPTIMALITY IN MULTIPROCESSOR
SCHEDULING?
Geoffrey Nelissen, Shelby Funk, Dakai Zhu and Joel Goossens

INFLUENCE OF THE TASK MODEL ON THE PRECISION OF SCHEDULING ANALYSIS FOR
PREEMPTIVE SYSTEMS STATUS REPORT
Sebastian Altmeyer and Claire Maiza

IS PROCESS SCHEDULING A DEAD SUBJECT?
Neil Audsley

NON-PREEMPTIVE FIXED-PRIORITY UNIPROCESSOR SCHEDULING WHERE THE
EXECUTION TIME OF A JOB DEPENDS ON THE SCHEDULING OF JOBS THAT EXECUTED
BEFORE IT
Björn Andersson, Dionisio de Niz and Sagar Chaki

PARTITIONED SCHEDULING OF MULTIMODE SYSTEMS ON MULTIPROCESSOR
PLATFORMS: WHEN TO DO THE MODE TRANSITION?
Jose Marinho, Gurulingesh Raravi, Vincent Nelis and Stefan Petters

PROBABILISTIC SENSITIVITY ANALYSIS
Luca Santinelli, Liliana Cucu-Grosjean and Laurent George

THE EXPLICIT PREEMPTION PLACEMENT PROBLEM FOR REAL-TIME CONDITIONAL
CODE
Marko Bertogna and Nathan Fisher

TWO-TYPE HETEROGENEOUS MULTIPROCESSOR SCHEDULING: IS THERE A PHASE
TRANSITION?
Gurulingesh Raravi, Björn Andersson and Konstantinos Bletsas

USING WORST-CASE RESPONSE TIME TECHNIQUES TO DERIVE THE AVERAGE-CASE
BEHAVIOUR WITH A MONTE-CARLO SIMULATION
Steffen Kollmann, Victor Pollex and Frank Slomka

WHAT IS THE DIFFERENCE BETWEEN OFFLINE AND ONLINE SCHEDULING?
Gerhard Fohler

WHAT IS THE MEANING OF PREEMPTION IN UTILITY-BASED REAL-TIME
SCHEDULING?
Raphael Guerra and Gerhard Fohler