AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Enhancing real-time schedules to tolerate transient faults
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Guaranteeing fault tolerance through scheduling in real-time systems
Guaranteeing fault tolerance through scheduling in real-time systems
Design for Timing Predictability
Real-Time Systems
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors
Real-Time Systems
Roundtable: Envisioning the Future for Multiprocessor SoC
IEEE Design & Test
Nomadik®: AMobile Multimedia Application Processor Platform
ASP-DAC '07 Proceedings of the 2007 Asia and South Pacific Design Automation Conference
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
AI Communications - Constraint Programming for Planning and Scheduling
International Journal of Parallel Programming - Special Issue on Multiprocessor-based embedded systems
IEEE Design & Test
Complete MCS-based search: application to resource constrained project scheduling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Planning with sharable resource constraints
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Performance assessment of multiobjective optimizers: an analysis and review
IEEE Transactions on Evolutionary Computation
A precedence constraint posting approach for the RCPSP with time lags and variable durations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
An MILP-based performance analysis technique for non-preemptive multitasking MPSoC
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Advances in Software Engineering
Resource Management in Real Time Distributed System with Security Constraints: A Review
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiprocessor System-on-chip (MPSoC) platforms. In this work we focus on an off-line (design-time) version of this problem, where the target task graph is known before execution time. We address the issue of scheduling robustness, i.e. providing hard guarantees that the schedule will meet the end-to-end deadline in presence of bounded variations of task execution times expressed as min-max intervals known at design time. We present a robust scheduling algorithm that proactively inserts sequencing constraints when they are needed to ensure that execution will have no inserted idle times and will meet the deadline for any possible combination of task execution times within the specified intervals. The algorithm is complete, i.e. it will return a feasible graph augmentation if one exists. Moreover, we provide an optimization version of the algorithm that can compute the shortest deadline that can be met in a robust way.