Bayesian stopping rules for multistart global optimization methods
Mathematical Programming: Series A and B
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Introduction to algorithms
Distributed Systems: Concepts and Design (4th Edition) (International Computer Science)
Distributed Systems: Concepts and Design (4th Edition) (International Computer Science)
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Scheduling periodic tasks in a hard real-time environment
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Solving an avionics real-time scheduling problem by advanced IP-methods
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Schedulability analysis of non-preemptive recurring real-time tasks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A Best-Response Algorithm for Multiprocessor Periodic Scheduling
ECRTS '11 Proceedings of the 2011 23rd Euromicro Conference on Real-Time Systems
Optimal design of virtual links in AFDX networks
Real-Time Systems
Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
The avionic industry has recently adopted the Integrated Modular Avionics (IMA). Such architectures allow the execution of avionic functions on a shared computing platform while avoiding any interference between them. This is done through hard memory and temporal segregation constraints. Although IMA reduces the weight and the power consumption and shortens the design-cycle times, it gives rise to a complex multiprocessor scheduling problem. One of the key difficulties of this problem is related to the strict periodicity of tasks, which means that the time separating two successive executions of the same task is strictly equal to the associated period. In order to help the system designer in producing a proper schedule, an exact formulation based on Integer Linear Programming and a heuristic inspired from Game Theory are proposed. To enhance the solution quality of the heuristic, a multi-start method, which gives some probabilistic guarantees on the optimality of the solutions, is also introduced.