Optimization of static task and bus access schedules for time-triggered distributed embedded systems with model-checking

Authors:
Zonghua Gu;Xiuqiang He;Mingxuan Yuan
Affiliations:
Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology
Venue:
Proceedings of the 44th annual Design Automation Conference
Year:
2007

Citing 6
Cited 2

Scheduling with bus access optimization for distributed embedded systems

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on the 11th international symposium on system-level synthesis and design (ISSS'98)
Formal Modeling and Analysis of Advanced Scheduling Features in an Avionics RTOS

EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Scheduling and mapping in an incremental design methodology for distributed real-time embedded systems

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Minimising buffer requirements of synchronous dataflow graphs with model checking

Proceedings of the 42nd annual Design Automation Conference
Optimal scheduling using branch and bound with SPIN 4.0

SPIN'03 Proceedings of the 10th international conference on Model checking software

Clock-driven distributed real-time implementation of endochronous synchronous programs

EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Timing analysis of cyber-physical applications for hybrid communication protocols

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

Time-Triggered Protocol for the bus and static task scheduling for the CPU are widely used in safety-critical distributed embedded systems. Researchers have presented efficient heuristic algorithms to jointly optimize static task and bus access schedules. In this paper, we use the model checker SPIN to provide a flexible and configurable technique for obtaining provably optimal solutions, and evaluate its performance tradeoffs compared to heuristic algorithms.