Task Graph Scheduling Using Timed Automata

Authors:
Yasmina Abdeddaïm;Abdelkarim Kerbaa;Oded Maler
Affiliations:
-;-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 14

Production Scheduling by Reachability Analysis - A Case Study

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Optimal scheduling using priced timed automata

ACM SIGMETRICS Performance Evaluation Review
Scheduling with timed automata

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
On using priced timed automata to achieve optimal scheduling

Formal Methods in System Design
Incorporating Time in the Modeling of Hardware and Software Systems: Concepts, Paradigms, and Paradoxes

MISE '07 Proceedings of the International Workshop on Modeling in Software Engineering
ESL power analysis of embedded processors for temperature and reliability estimations

CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Complexity in simplicity: flexible agent-based state space exploration

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
On optimal scheduling under uncertainty

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A novel SAT-based approach to the task graph cost-optimal scheduling problem

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Static scheduling of periodic hardware tasks with precedence and deadline constraints on reconfigurable hardware devices

International Journal of Reconfigurable Computing - Special issue on selected papers from the international workshop on reconfigurable communication-centric systems on chips (ReCoSoC' 2010)
Priced timed automata: algorithms and applications

FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Verification, performance analysis and controller synthesis for real-time systems

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
State-based scheduling with tree schedules: analysis and evaluation

Real-Time Systems
Colored Petri Net model with automatic parallelization on real-time multicore architectures

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, originally developed for verification of real-time programs and digital circuits and more recently adapted for solving time-optimal scheduling problems. In this framework, the scheduling problem admits a state-space representation and an optimal schedule corresponds to a shortest path in the timed automaton. We check our implementation on numerous benchmarks and show how release times and deadlines can be easily incorporated into the model.