Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor, Real Time Systems 90, pp.301-324 ,
How to insure feasibility in a distributed system for real-time control?, Int. Symp. on High Performance Computer Systems, 1987. ,
Dynamic scheduling of real-time tasks under precedence constraints, Real-Time Systems, vol.21, issue.10, pp.181-194 ,
DOI : 10.1007/BF00365326
Computer and Intractability, a Guide to the Theory of NP-Completeness, 1979. ,
On Non-Preemptive Scheduling of Periodic and Sporadic Tasks, IEEE Real-Time Systems Symposium, pp.129-139, 1991. ,
Prevention of task overruns in real-time non-preemptive multiprogramming systems, Assoc. Comp. Mach, pp.267-276, 1980. ,
On the complexity of fixed-priority scheduling of periodic, real-time tasks, Performance Evaluation, vol.2, issue.4, pp.237-250, 1982. ,
DOI : 10.1016/0166-5316(82)90024-4
Scheduling Algorithms for multiprogramming in a Hard Real Time Environment, Journal of the Association for Computing Machinery, vol.20, issue.1, 1973. ,
A note on preemptive scheduling of periodic, real-time tasks, Information Processing Letters, vol.11, issue.3, 1980. ,
DOI : 10.1016/0020-0190(80)90123-4
A Model to Solve Timing-Critical Application Problems in Distributed Computer Systems, Computer, vol.17, issue.1, pp.62-68, 1984. ,
DOI : 10.1109/MC.1984.1658932
Fundamental Design Problems for the Hard Real-Time Environments, 1983. ,
Generalized Scheduling on a Single Machine in Real-Time Systems based on Time Value Functions, 11th IFAC Workshop on Distributed, Computer Control Systems (DCCS'92), 1992. ,
URL : https://hal.archives-ouvertes.fr/inria-00076999
On the Ability of Establishing Real-Time Channels in Point-to-Point Packet Switched Networks, IEEE Transactions on Communications, pp.42-44 ,
A decomposition approach to Non-Preemptive Scheduling on a single ressource ,
A decomposition approach to non-preemptive real-time scheduling, Real-time Systems, vol.13, issue.1, pp.7-35, 1994. ,
DOI : 10.1007/BF01245297