Abstract
Safety-critical real-time systems must meet stringent timing and fault-tolerance requirements. This article proposes a methodology for synthesizing an optimal preemptive multiprocessor aperiodic task scheduler using a formal supervisory control framework. The scheduler can tolerate single/multiple permanent processor faults. Further, the synthesis framework has been empowered with a novel BDD-based symbolic computation mechanism to control the exponential state-space complexity of the optimal exhaustive enumeration-oriented synthesis methodology.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, Fault-Tolerant Preemptive Aperiodic RT Scheduling by Supervisory Control of TDES on Multiprocessors
- Subrata Acharya and Rabi Mahapatra. 2008. A dynamic slack management technique for real-time distributed embedded systems. IEEE Transactions on Computers 57, 2, 215--230. Google Scholar
Digital Library
- R. D. Brandt, V. Garg, R. Kumar, F. Lin, S. I. Marcus, and W. M. Wonham. 1990. Formulas for calculating supremal controllable and normal sublanguages. Systems 8 Control Letters 15, 2, 111--117. Google Scholar
Digital Library
- R. E. Bryant. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35, 8, 677--691. Google Scholar
Digital Library
- Giorgio C. Buttazzo. 2011. Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Vol. 24. Springer. Google Scholar
Digital Library
- Peter C. Y. Chen and W. Murray Wonham. 2002. Real-time supervisory control of a processor for non-preemptive execution of periodic tasks. Real-Time Systems 23, 3, 183--208. Google Scholar
Digital Library
- Rajesh Devaraj, Arnab Sarkar, and Santosh Biswas. 2015. A design fix to supervisory control for fault-tolerant scheduling of real-time multiprocessor systems with aperiodic tasks. International Journal of Control 88, 11, 2211--2216. Google Scholar
Cross Ref
- Sunondo Ghosh, Rami Melhem, and Daniel Mossé. 1997. Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems 8, 3, 272--284. Google Scholar
Digital Library
- Viacheslav Izosimov, Paul Pop, Petru Eles, and Zebo Peng. 2012. Scheduling and optimization of fault-tolerant embedded systems with transparency/performance trade-offs. ACM Transactions on Embedded Computing Systems 11, 3, 61. Google Scholar
Digital Library
- Vasudevan Janarthanan and Peyman Gohari. 2007. Multiprocessor scheduling in supervisory control of discrete-event systems framework. Control and Intelligent Systems 35, 4, 360. Google Scholar
Digital Library
- Vasudevan Janarthanan, Peyman Gohari, and Abdollah Saffar. 2006. Formalizing real-time scheduling using priority-based supervisory control of discrete-event systems. IEEE Transactions on Automatic Control 51, 6, 1053--1058. Google Scholar
Cross Ref
- Nagarajan Kandasamy, John P. Hayes, and Brian T. Murray. 2005. Dependable communication synthesis for distributed embedded systems. Reliability Engineering 8 System Safety 89, 1, 81--92.Google Scholar
- Frank Liberato, Sylvain Lauzac, Rami Melhem, and Daniel Mossé. 1999. Fault tolerant real-time global scheduling on multiprocessors. In Proceedings of the 11th Euromicro Conference on Real-Time Systems. IEEE, 252--259. Google Scholar
Cross Ref
- Frank Liberato, Rami Melhem, and Daniel Mossé. 2000. Tolerance to multiple transient faults for aperiodic tasks in hard real-time systems. IEEE Transactions on Computers 49, 9, 906--914. Google Scholar
Digital Library
- Sajed Miremadi, Bengt Lennartson, and Knut Akesson. 2012. A BDD-based approach for modeling plant and supervisor by extended finite automata. IEEE Transactions on Control Systems Technology 20, 6, 1421--1435. Google Scholar
Cross Ref
- Seong-Jin Park and Kwang-Hyun Cho. 2009. Supervisory control for fault-tolerant scheduling of real-time multiprocessor systems with aperiodic tasks. International Journal of Control 82, 2, 217--227. Google Scholar
Cross Ref
- Ismael Ripoll, Alfons Crespo, and Ana García-Fornes. 1997. An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Transactions on Software Engineering 23, 6, 388--400. Google Scholar
Digital Library
- Fabio Somenzi. 2015. CUDD: CU decision diagram package release 3.0.0.Google Scholar
Index Terms
Fault-Tolerant Preemptive Aperiodic RT Scheduling by Supervisory Control of TDES on Multiprocessors
Recommendations
The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all ...
Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems
This paper presents a preemptive scheduling scheme for real-time systems with sporadic tasks based on the supervisory control theory of discrete event systems. In particular, we present a systematic method of computing a schedulable language that ...
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
We consider preemptive online and semi-online scheduling of unit jobs on two uniformly related machines. Jobs are presented one by one to an algorithm, and each job has a rejection penalty associated with it. A new job can either be rejected, in which ...






Comments