DocumentCode :
3593604
Title :
Synthesizing schedules through heuristics for hard real-time workflows
Author :
Kothmayr, Thomas ; Kemper, Alfons ; Scholz, Andreas ; Heuer, Jorg
Author_Institution :
Dept. of Database Syst., Tech. Univ. Munchen, Mϋnchen, Germany
fYear :
2015
Firstpage :
1937
Lastpage :
1944
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.
Keywords :
computability; distributed processing; real-time systems; scheduling; workflow management software; bus-based approach; distributed hard real-time workflow; distributed real time systems; heuristics; monolithic approach; satisfiability solver; schedule synthesis; system configuration; task assignment; Hardware; Job shop scheduling; Real-time systems; Schedules; Time division multiple access; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Industrial Technology (ICIT), 2015 IEEE International Conference on
Type :
conf
DOI :
10.1109/ICIT.2015.7125380
Filename :
7125380
Link To Document :
بازگشت