A practitioner's handbook for real-time analysis
A practitioner's handbook for real-time analysis
Fixed priority pre-emptive scheduling: an historical perspective
Real-Time Systems - Special issue: history of real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Guest Editorial: A Review of Worst-Case Execution-TimeAnalysis
Real-Time Systems - Special issue on worst-case execution-time analysis
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
Effective Analysis for Engineering Real-Time Fixed Priority Schedulers
IEEE Transactions on Software Engineering
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
Semantics-preserving multitask implementation of synchronous programs
ACM Transactions on Embedded Computing Systems (TECS)
A model-based approach for multiple QoS in scheduling: from models to implementation
Automated Software Engineering
Real-Time scheduling techniques for implementation synthesis from component-based software models
CBSE'05 Proceedings of the 8th international conference on Component-Based Software Engineering
Hi-index | 0.00 |
We describe the software architecture of an automated vehicle control system implemented in the PATH lab. The system is responsible for automatic lateral and longitudinal control of a set of vehicles traveling in a platoon formation at close distance and at high speeds [15]. The software architecture consists of a set of processes running concurrently and communicating through a publish/subscribe database. Some processes are triggered periodically by external inputs (e.g., from sensors) while others are triggered by events from other (internal) processes. We model the architecture as a set of periodic tasks each consisting of a sequence of sub-tasks with varying priorities [3,4]. We perform a schedulability analysis to check whether a set of timing requirements expressed as deadlines are met.