Schedulability Analysis of Distributed Real-Time Applications under Dependence and Several Latency Constraints


This paper focuses on the analysis of real-time non preemptive multiprocessor scheduling with precedence and several latency constraints. It aims to specify a schedulability condition which enables a designer to check a priori -without executing or simulatingif its scheduling of tasks will hold the precedences between tasks as well as several latency… (More)
DOI: 10.5120/10145-4978


  • Presentations referencing similar topics