Contact
Director
Prof. Gerhard Fohler
Secretary
Stephanie Jung
Phone: +49 631 205 2086

Office Hours
Mon/Tue: 13:00-16:00
Wed-Fri: 08:00-11:00
You are here: RTS-Portal>>Publications

Publications

Search Publications

show/hide

Online Admission of Non-Preemptive Aperiodic Tasks in Offline Schedules


Category: Inproceedings
Author(s)Stefan Schorr, Gerhard Fohler
SourceProceedings of Work-in-Progress Session, 22nd Euromicro Conference on Real-Time Systems 2010, ECRTS, Brussels, Belgium, Work in Progress Session.
Date Jul 2010
Download:

Abstract

In this paper we present an approach to extend slot shifting to integrate single non-preemptive aperiodic tasks. The slot shifting algorithm allows to combine the benefits of offline and online scheduling: the offline scheduler handles periodic task sets with complex constraints and the online algorithm integrates aperiodic tasks. For the admission control of the non-preemptive tasks, our algorithm uses precomputed values derived from the offline phase of slot shifting, hence having low memory overhead. Furthermore, our approach allows to minimize the response time of the non-preemptive aperiodic tasks.

Bibtex


Upcoming Events
Currently no events
Latest News:
20.07.20 16:37
Our paper titled "Enabling Fog-based Industrial Robotics Systems" by Mohammed Shaik,...


17.07.20 12:25
Our paper titled "Distributed Decision-making for Safe and Secure Global Resource Management...


09.04.20 16:47
Dear students, things will run differently this semester, we are figuring out how we can...


All News