Synthesizing schedules through heuristics for hard real-time workflows

Thomas Kothmayr, Alfons Kemper, Andreas Scholz, Jorg Heuer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Task assignment and subsequent schedule synthesis in distributed real time systems is a problem that arises in many fields of industry, such as factory automation or the automotive or avionic sector. Monolithic and bus-based approaches, while easy to schedule in the aforementioned context, are giving way to more flexible hardware environments, either because of increased pressure for flexibility (factory automation) or hardware consolidation (automotive and avionics). This paper presents an approach for synthesizing schedules of a distributed hard real time workflow based on existing heuristics. This approach can find a solution for over 85% of all feasible tested system configurations while being orders of magnitude faster than an approach based on a satisfiability solver. We obtained these results by simulating over 1 million different workflows and system configurations.

Original languageEnglish
Title of host publication2015 IEEE International Conference on Industrial Technology, ICIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1937-1944
Number of pages8
EditionJune
ISBN (Electronic)9781479978007
DOIs
StatePublished - 16 Jun 2015
Event2015 IEEE International Conference on Industrial Technology, ICIT 2015 - Seville, Spain
Duration: 17 Mar 201519 Mar 2015

Publication series

NameProceedings of the IEEE International Conference on Industrial Technology
NumberJune
Volume2015-June

Conference

Conference2015 IEEE International Conference on Industrial Technology, ICIT 2015
Country/TerritorySpain
CitySeville
Period17/03/1519/03/15

Fingerprint

Dive into the research topics of 'Synthesizing schedules through heuristics for hard real-time workflows'. Together they form a unique fingerprint.

Cite this