An event stream driven approximation for the analysis of real-time systems. proc, Euromicro Int. Conf. on Real-Time Systems (ECRTS'04), pp.187-195, 2004. ,
Efficient feasibility analysis for real-time systems with edf scheduling. proc, Europe Conference (Date'05), 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00181560
Optimal priority assignment and feasibility of static priority tasks with arbitrary start times, YCS, vol.164, 1991. ,
Applying new scheduling theory to static priority pre-emptive scheduling, Software Engineering Journal, vol.8, issue.5, pp.284-292, 1993. ,
Continuity and approximability of response time bounds, Euromicro Conf. on Real-Time Systems (ECRTS'07), Work-in Progress, 2007. ,
Efficient computation of response time bounds under fixed-priority scheduling . proc. Int. Real-Time and Network Systems, 2007. ,
Schedulability analysis of periodic fixed priority systems, IEEE Transactions on Computers, vol.53, issue.11, 2004. ,
DOI : 10.1109/TC.2004.103
Measuring the Performance of Schedulability Tests, Real-Time Systems, vol.20, issue.1, pp.129-154, 2005. ,
DOI : 10.1007/s11241-005-0507-9
Rate monotonic analysis: the hyperbolic bound, IEEE Transactions on Computers, vol.52, issue.7, pp.933-942, 2003. ,
DOI : 10.1109/TC.2003.1214341
A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines, IEEE Transactions on Computers, vol.58, issue.2, pp.279-286, 2009. ,
DOI : 10.1109/TC.2008.167
Approximate schedulability analysis, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002., 2002. ,
DOI : 10.1109/REAL.2002.1181571
Minimal schedulability interval for real-time systems of periodic tasks with offsets, Theoretical Computer Science, vol.310, issue.1-3, pp.117-134, 2004. ,
DOI : 10.1016/S0304-3975(03)00362-1
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard, 2008 Real-Time Systems Symposium, 2008. ,
DOI : 10.1109/RTSS.2008.25
A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. proc, Euromicro Int. Conf. on Real-Time Systems (ECRTS'05), pp.117-126, 2005. ,
A polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines, Proc. Int. Conf. on Real-Time Systems (RTNS'05), pp.233-249, 2005. ,
Parametric Polynomial-Time Algorithms for Computing Response-Time Bounds for Static-Priority Tasks with Release Jitters, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 2007. ,
DOI : 10.1109/RTCSA.2007.54
Preemptive and non-preemptive real-time uni-processor scheduling, INRIA Research Report, p.55, 1996. ,
Finding Response Times in a Real-Time System, The Computer Journal, vol.29, issue.5, pp.390-395, 1986. ,
DOI : 10.1093/comjnl/29.5.390
Fixed priority scheduling of periodic tasks with arbitrary deadlines. proc, IEEE Int. Real-Time System Symposium (RTSS'90), pp.201-209, 1990. ,
The rate monotonic scheduling algorithm: exact characterization and average case behavior, [1989] Proceedings. Real-Time Systems Symposium, pp.166-171, 1989. ,
DOI : 10.1109/REAL.1989.63567
A note on preemptive scheduling of periodic, real-time tasks, Information Processing Letters, vol.11, issue.3, pp.115-118, 1980. ,
DOI : 10.1016/0020-0190(80)90123-4
On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance evaluation, pp.273-250, 1982. ,
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM, vol.20, issue.1, pp.46-61, 1973. ,
DOI : 10.1145/321738.321743
Efficient implementation of tight response-times for tasks with offsets. Real-Time Systems Journal, 2008. ,
A feasible decision algorithm for rate monotonic and deadline monotonic scheduling. Real-Time Systems Journal, pp.171-181, 1998. ,
Approximation de temps de réponse des tâches à priorité fixe, 2007. ,
Improved approximate response time bounds for static priority tasks. Real-Time and Network Systems, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00336498
Approximation techniques for response-time analysis of static-priority tasks. Real-Time Systems, pp.147-176, 2009. ,
The fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines revisited, proc. Int. Conf. on Real-Time and Networked Systems, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00544444
Polynomial time approximate schedulability tests for fixed-priority real-time tasks : some numerical experimentations, proc. Int. Real-Time and Network Systems, 2006. ,
Approximating response times for static-priority tasks with release jitters, WIP, Euromicro Int. Conf. on Real-Time Systems (ECRTS'06), 2006. ,
Approximate feasibility analysis and response-time bounds of static-priority tasks with release jitters, proc. Int. Real-Time and Network Systems, 2007. ,
Response time upper bounds for fixed priority real-time system. proc, IEEE Int. Symposium on Real-Time Systems (RTSS'08), 2008. ,
Improved response time analysis calculations. proc, IEEE Int. Symposium on Real-Time Systems (RTSS'98, 1998. ,
Analysis of deadline scheduled realtime systems, INRIA Research Report, p.31, 1996. ,
URL : https://hal.archives-ouvertes.fr/inria-00073920