Articles référencés

[AB98a]

Luca Abeni and Giorgio C. Buttazzo. Integrating multimedia applications in hard real-time systems. In RTSS, pages 4--13, 1998.

[AB98b]

Alia Atlas and Azer Bestavros. An omniscient scheduling oracle for systems with harmonic periods. Technical Report 1998-014, Sept 1998.

[AB98c]

Alia K. Atlas and Azer Bestavros. Design and implementation of statistical rate monotonic scheduling in kurt linux. Technical Report 98-013, Boston University, Sept 1998.

[AB98d]

Alia K. Atlas and Azer Bestavros. Statistical rate monotonic scheduling. In Proceedings of the 19th IEEE Real-Time Systems Symposium, Dec 1998.

[AB99]

S. Aldarmi and A. Burns. Dynamic value-density for scheduling real-time systems. In Proceedings of the 11th Euromicro Conference on Real-Time Systems, Dec 1999.

[ABJ01]

Bjorn Andersson, Sanjoy Baruah, , and Jan Jonsson. Static-priority scheduling on multiprocessors. In Proceedings of the Real-Time Systems Symposium, pages 193--202, Dec 2001.

[ABR⁺93]

N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8(5):284--292, Sep 1993.

[ABRW91]

N. C. Audsley, A. Burns, M. F. Richardson, and A. J. Wellings. Hard Real-Time Scheduling: The Deadline Monotonic Approach. In Proceedings 8th IEEE Workshop on Real-Time Operating Systems and Software, Atalanta, 1991.

[ALB99]

L. Abeni, G. Lipari, and G. Buttazzo. Constant bandwidth vs. proportional share resource allocation. In Proceedings of the International Conference on Multimedia Computing and Systems, volume II, pages 107--111, Jun 1999.

[AP97]

E. Anceaume and I. Puaut. A taxonomy of clock synchronization algorithms. Technical Report PI1103, IRISA, July 1997.

[ARJ95]

J. Anderson, S. Ramamurthy, and K. Jeffay. Real-time computing with lock-free shared objects. In Proceedings of the 16th IEEE Real-Time Systems Symposium, Dec 1995.

[AS99]

J. Anderson and A. Srinivasan. A new look at pfair priorities. Real-time Systems Journal, Oct 1999.

[ATB93]

N.A. Audsley, K. Tindell, and A. Burns. The end of the line for static cyclic scheduling? In Proceedings of the Fifth Euromicro Workshop on Real-time Systems, pages 36--41, Jun 1993.

[Aud91]

N. Audsley. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical Report YCS164, U York, Nov 1991.

[Bak91]

T.P. Baker. Stack-based scheduling of realtime processes. Journal of Real-Time Systems, 3(1):67--100, 1991.

[Bar97]

Michael Barabanov. A linux-based real-time operating system. Master's thesis, New Mexico Institute of Mining and Technology, Jun 1997.

[Bar98]

Sanjoy Baruah. A general model for recurring real-time tasks. In Proceedings of the Real-Time Systems Symposium, pages 114--122, 1998.

[Bat98]

IJ Bates. Scheduling and Timing Analysis for Safety Critical Real-Time Systems. PhD thesis, University of York, Nov 1998.

[BBL01]

G. Bernat, A. Burns, and A. Llamosí. Weakly hard real-time systems. In IEEE, editor, IEEE Transactions on Computers, number 50(4), pages 308--321, Apr 2001. An extended version is also available as a technical report YCS-99-320 September 1999.

[BCG⁺99]

Sanjoy Baruah, Deji Chen, Sergey Gorinsky, , and Aloysius Mok. Generalized multiframe tasks. Real-Time Systems, 1(17):5--22, Jul 1999.

[BCM99]

S. Baruah, D. Chen, and A. Mok. Static-priority scheduling of multiframe tasks. In Proceedings of the Euromicro Conference on Real-Time Systems, Jun 1999.

[BGP95]

S. K. Baruah, J. E. Gehrke, and C. G. Plaxton. Fast scheduling of periodic tasks on multiple resources. In Proceedings of the 9th International Parallel Processing Symposium, pages 280--288, Apr 1995.

[BH97]

Sanjoy Baruah and Jayant Haritsa. Scheduling for overload in real-time systems. IEEE Transactions on Computers, 9(46):1034--1039, Sep 1997.

[BH98]

Sanjoy Baruah and Mary Ellen Hickey. Competitive on-line scheduling of imprecise computations. IEEE Transactions on Computers, 47(9):1027--1032, Sep 1998.

[BHR93]

Sanjoy K. Baruah, Rodney R. Howell, and Louis E. Rosier. Feasibility problems for recurring tasks on one processor. Theoretical Computer Science, 118(1):3--20, 1993.

[BHS01]

Sanjoy Baruah, Jayant Haritsa, and Nitin Sharma. On-line scheduling to maximize task completions. Combinatorial Mathematics and Combinatorial Computing, (39):65--78, 2001.

[BKM⁺91]

S. Baruah, G. Koren, B. Mishra, D. Mao, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang. On the competitiveness of on-line real-time task scheduling. In Proceedings of the 12th Real-Time Systems Symposium, pages 106--115, Dec 1991.

[BM01]

L Porto Barreto and G Muller. Bossa: A dsl framework for application-specific scheduling policies. Technical Report PI-1384, IRISA, March 2001. biblio d2.

[BM02]

Luciano Porto Barreto and Gilles Muller. Bossa: a language-based approach for the design of real-time schedulers. In Proceedings of the Conférence Internationale sur les Systèmes Temps-Réel, Mar 2002.

[BMR90]

Sanjoy K. Baruah, Aloysius K. Mok, and Louis E. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In IEEE Real-Time Systems Symposium, pages 182--190, 1990.

[Bon92]

F. Boniol. Le temps-réel par une approche conjointe synchrone - asynchrone. Technical Report 1/3410.00/DERI, CERT, mar 1992.

[BPB⁺00]

A. Burns, D. Prasad, A. Bondavalli, F. Di Giandomenico, K. Ramamritham, J. Stankovic, and L. Stringini. The meaning and role of value in scheduling flexible real-time systems. Journal of Systems Architecture, 46:305--325, 2000.

[BS93]

G. Buttazzo and J. Stankovic. Red: Robust earliest deadline scheduling. In Proceedings of the International Workshop on Responsive Computing Systems, 1993.

[BSS94]

A. Bondavalli, J. Stankovic, and L. Strigini. Adaptable fault tolerance for real-time systems. Technical Report UM-CS-1994-039, University of Massachusetts, Amherst, Computer Science, May, 1994.

[BSS95]

G. Buttazzo, M. Spuri, and F. Sensini. Value vs. deadline scheduling in overload conditions. In Proceedings of the 15th Real-Time System Symposium, pages 90--99, Dec 1995.

[Bur93]

A. Burns. Fixed priority scheduling with deadlines prior to completion. Technical Report YCS212, 1993.

[Bur94]

A. Burns. Preemptive priority based scheduling: An appropriate engineering approach. Technical Report 214, 1994.

[But97]

G.C. Buttazzo. ard Real-Time Computing Systems. Kluwer academic, 1997.

[BWH93]

A. Burns, A. J. Wellings, and A. D. Hutcheon. The impact of an ada runtime system's performance charactersitics on scheduling models. In Proceedings of the 12th Ada Europe conference, 1993.

[CA97]

Seonho Choi and Ashok K. Agrawala. Scheduling aperiodic and sporadic tasks in hard real-time systems. Technical Report CS-TR-3794, 1997.

[CB97]

M. Caccamo and G. Buttazzo. Exploiting skips in periodic tasks for enhancing aperiodic responsiveness. In Proceedings of the 18th IEEE Real-Time Systems Symposium, 1997.

[CCS02]

L. Cucu, R. Cocif, and Y. Sorel. Real-time scheduling for systems with precedence, periodicity and latency constraints. In Proceedings of the Conférence Internationale sur les Systèmes Temps-Réel, Mar 2002.

[CFBW93]

C.Bailey, E. Fyfe, A. Burns, and A. J. Wellings. The olympus attitude and orbital control system, a case study in hard real-time system design and inplementation. Technical report, University of York, 1993.

[CJ98]

George Candea and Michael B. Jones. Vassal: Loadable scheduler support for multi-policy scheduling. In Second USENIX Windows NT Symposium, pages 157--166, Seattle, WA, August 1998. USENIX.

[CLB99]

Marco Caccamo, Giuseppe Lipari, and Giorgio Buttazzo. Sharing resources among periodic and aperiodic tasks with dynamic deadlines. In Proceedings of the 20th IEEE Real-Time Systems Symposium, 1999.

[Coo71]

Stephen A. Cook. The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, pages 151--158, 1971.

[Coo83]

Stephen A. Cook. An overview of computational complexity. Communications of the ACM, 26(6):400--408, 1983.

[CP99a]

P. Chevochot and I. Puaut. An approach for fault-tolerance in hard real-time distributed systems. In Proc. 18th IEEE Symposium on Reliable Distributed Systems (SRDS'99) (short paper), pages 292--293, Lausanne, Switzerland, October 1999.

[CP99b]

P. Chevochot and I. Puaut. Tolérance aux fautes dans les systèmes répartis temps-réel strict. Techniques et Sciences Informatiques (TSI), 18(8):837--870, October 1999.

[CP01a]

A. Colin and I. Puaut. Analyse de temps d'exécution au pire cas du système d'exploitation temps-réel rtems. In Seconde Conférence Française sur les Systèmes d'Exploitation (CFSE2), pages 73--84, Paris, France, April 2001.

[CP01b]

A. Colin and I. Puaut. Worst-case execution time analysis of the rtems real-time operating system. In Proc. of the 13th Euromicro Conference on Real-Time Systems, pages 191--198, Delft, The Netherlands, June 2001.

[CPC⁺00]

P. Chevochot, I. Puaut, G. Cabillic, A. Colin, D. Decotigny, and M. Banâtre. Hades: a distributed system for dependable hard real-time applications built from cots components. Technical Report PI1357, IRISA, October 2000.

[Dav93]

R. Davis. Approximate slack stealing algorithms for fixed priority preemptive systems. Technical Report 216, U. York, Dec 1993.

[Dav94]

R. Davis. Dual priority scheduling: A means of providing flexibility in hard real-time systems. Technical Report YCS230, University of York, UK, May 1994.

[Del96]

J. Delacroix. Towards a stable earliest deadline scheduling algorithm. Real-Time Systems, 10:263--291, 1996.

[DFP01]

Radu Dobrin, Gerhard Fohler, and Peter Puschner. Translating offline schedules into task attributes for fixed priority scheduling. 22nd IEEE Real-Time Systems Symposium, December 2001, London, United Kingdom, Dec. 2001.

[DFW02]

W. Dinkel, M. Frisbie, and J. Woltersdorf. Kurt-Linux User Manual. UC Kansas at Lawrence, Mar 2002.

[DTB93]

R. I. Davis, K. W. Tindell, and A. Burns. Scheduling slack time in fixed priority preemptive systems. In Proceedings of the Real-Time Systems Symposium, pages 222--231, 1993.

[EJ00]

Cecilia Ekelin and Jan Jonsson. Solving embedded system scheduling problems using constraint programming. In IEEE RTSS, May 2000.

[FGB01]

Shelby Funk, Joel Goossens, and Sanjoy Baruah. On-line scheduling on uniform multiprocessors. In Proceedings of the Real-Time Systems Symposium, pages 183--192, Dec 2001.

[fIT93]

IEEE Standard for Information Technology. Portable Operating System Interface 1003.1b & 1003.1c. IEEE, 1993.

[Foh94]

Gerhard Fohler. Flexibility in Statically Scheduled Hard Real-Time Systems. PhD thesis, Technische Universität Wien, Institut für Technische Informatik, Treitlstr. 3/3/182-1, 1040 Vienna, Austria, 1994.

[GAGB01]

Paolo Gai, Luca Abeni, Massimiliano Giorgi, and Giorgio Buttazzo. A new kernel approach for modular real-time systems development. In Proceedings of the 13th IEEE Euromicro Conference on Real-Time Systems, June 2001.

[Gar99]

M. K. Gardner. Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems. PhD thesis, University of Illinois at Urbana-Champaign, Sep 1999.

[GBF02]

J. Goossens, S. Baruah, and S. Funk. Real-time scheduling on multiprocessors. In Proceedings of the Conférence Internationale sur les Systèmes Temps-Réel, Mar 2002.

[GFB01]

Joel Goossens, Shelby Funk, and Sanjoy Baruah. Edf scheduling on multiprocessor platforms: some (perhaps) counterintuitive observations. Technical Report UNC-CS TR01-033, UNC, Nov 2001.

[GJ79]

Michael R. Garey and David S. Johnson. Computers and Intractability : A Guide to the Theory of Np-Completeness. Number ISBN 0716710455. W H Freeman & Co., 1979.

[GL95]

Donald W. Gillies and Jane W.-S. Liu. Scheduling tasks with AND/OR precedence constraints. SIAM J. Comput., 24(4):797--810, 1995.

[GL99]

Mark K. Gardner and Jane W. S. Liu. Performance of algorithms for scheduling real-time systems with overrun and overload. In Proceedings of the Eleventh Euromicro Conference on Real-Time Systems, Jun 1999.

[GLLK79]

R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287--326, 1979.

[GMR95]

L. George, P. Muhletahler, and N. Rivierre. Optimality and non-preemptive real-time scheduling revisited. Technical Report 2516, INRIA, 1995.

[GNM99]

Bruno Gaujal, Nicolas Navet, and Jorn Migge. Dual-priority versus background scheduling: A path-wise comparison. Technical-report, Inria, Institut National de Recherche en Informatique et en Automatique, July 1999.

[GP96]

R. Gopalakrishnan and Guru M. Parulkar. Bringing real-time scheduling theory and practice closer for multimedia computing. In Measurement and Modeling of Computer Systems, pages 1--12, 1996.

[GRS96]

L. George, N. Rivierre, and M. Spuri. Preemptive and non-preemptive real-time uniprocessor scheduling. Technical Report 2966, INRIA Rocquencourt, sep 1996.

[GS96]

M. Gergeleit and H. Streich. Taskpair-scheduling with optimistic case execution times -- an example for an adaptive real-time system. In Second International Workshop on Object-oriented Real-time Dependable Systems, Laguna Beach, CA, GMD, Germany, February 1,2 1996.

[GSSR97]

O. Gonzalez, H. Shrikumar, John A. Stankovic, and K. Ramamritham. Adaptive fault tolerance and graceful degradation under dynamic hard real-time constraints. In Proceedings of the 18th IEEE Real-Time Systems Symposium, San Francisco, California. U. Mass, December 1997.

[Hal98]

Nicolas Halbwachs. Synchronous programming of reactive systems. In Computer Aided Verification, pages 1--16, 1998.

[Heu01]

Arnd Christian Heursch. Preemption concepts, rhealstone benchmark and scheduler analysis of linux 2.4. In Proceedings of the Real-Time & Embedded Computing Expo & Conference, 2001.

[HMT90]

Chetto H., Silly M., and Bouchentouf T. Dynamic scheduling of real-time task under precedence constraints. Real Time Systems, (2):181--194, 1990.

[HS90]

D. Haban and K.G. Shin. Application of real-time monitoring to scheduling tasks with random execution times. IEEE Transactions on Software Engineering, 16(2):1374--1389, 1990.

[HV95]

Rodney R. Howell and Muralidhar K. Venkatrao. On non-preemptive scheduling of recurring tasks using inserted idle times. Information and Computation, 117(1):50--62, 1995.

[IF99]

Damir Isovic and Gerhard Fohler. Online handling of firm aperiodic tasks in time triggered systems. In 11th Euromicro Conference on Real-Time Systems, York, UK, June 1999.

[IMR96]

Hong Inki, Potkonjak Miodrag, and Karri Ramesh. Hetergeneous BISR-approach using system level synthesis flexibility. Technical Report 960047, University of California, Los Angeles, Computer Science Department, December 31, 1996.

[JD90]

Xu J. and Parnas D. Scheduling processes with release times, deadlines, precedence, and exclusion, relations. IEEE Transactions on Software Engineering, 16(3):360--369, 1990.

[Jef89]

K. Jeffay. Analysis of a synchronization and scheduling discipline for real-time tasks with preemption constraints. In IEEE Real-Time Systems Symposium, 1989.

[Jef92]

Kevin Jeffay. Scheduling sporadic tasks with shared resources in hard-real-time systems. In IEEE Real-Time Systems Symposium, pages 89--99, 1992.

[JG99]

Kevin Jeffay and Steve Goddard. A theory of rate-based execution. In Proceedings of the of the 20th IEEE Real-Time Systems Symposium, Dec 1999.

[JG01]

K. Jeffay and S.M. Goddard. Rate-based resource allocation models for embedded systems. In Proceedings of the First International Workshop on Embedded Software, pages 204--222, Oct 2001.

[JP86]

M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390--395, 1986.

[JS93]

K. Jeffay and D. L. Stone. Accounting for interrupt handling costs in dynamic priority task systems. In Proceedings of the 14th IEEE Real-Time Systems Symposium, pages 212--221, Dec 1993.

[JSM91]

K. Jeffay, D. F. Stanat, and C. U. Martel. On non-preemptive scheduling of periodic and sporadic tasks. In IEEE, editor, Proceedings of the 12 th IEEE Symposium on Real-Time Systems (December 1991), pages 129--139, december 1991.

[KAS93]

Daniel I. Katcher, Hiroshi Arakawa, and Jay K. Strosnider. Engineering and analysis of fixed priority schedulers. Software Engineering, 19(9):920--934, 1993.

[KFG⁺92]

H. Kopetz, G. Fohler, G. Grünsteidl, H. Kantz, G. Pospischil, P. Puschner, J. Reisinger, R. Schlatterbeck, W. Schütz, A. Vrchotichy, and R. Zainlinger. The programmer's view of MARS. In Robert Werner, editor, Proceedings of the Real-Time Systems Symposium - 1992, pages 223--226, Phoenix, Arizona, USA, December 1992. IEEE Computer Society Press.

[KNH⁺97]

Hermann Kopetz, Roman Nossal, René Hexel, Andreas Krüger, Dietmar Millinger, Roman Pallierer, Christopher Temple, and Markus Krug. Mode handling in the time-triggered architecture. IFAC DCCS 97, June 1997, Seoul, Korea, Jun. 1997.

[KS93]

G. Koren and D. Shasha. D^over: An optimal online scheduling algorithm for overloaded realtime systems. In Proceedings IEEE Real-Time Systems Symposium, pages 290--299, 1993.

[KS95]

G. Koren and D. Shasha. Skip-over: algorithms and complexity for overloaded systems that allow skips. In Proceedings of the 16th IEEE Real-Time Systems Symposium, 1995.

[KSSR96]

H. Kaneko, J. A. Stankovic, S. Sen, and K. Ramamritham. Integrated scheduling of multimedia and hard real-time tasks. Technical Report UM-CS-1996-045, University of Massachusetts, Amherst, Computer Science, December, 1996.

[Law73]

E.L. Lawler. Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19, 1973.

[Law78]

E.L. Lawler. Sequencing jobs to minimize total weighted completion time. Annals of Discrete Mathematics, 2:75--90, 1978.

[Law83]

Eugene L. Lawler. Scheduling a single machine to minimize the number of late jobs. Technical Report CSD-83-139, UC Berkeley, 1983.

[LB00a]

G. Lipari and G.C. Buttazzo. Schedulability analysis of periodic and aperiodic tasks with resource constraints. Journal of System Architectures, 46:327--338, 2000.

[LB00b]

Giuseppe Lipari and Sanjoy Baruah. Efficient scheduling of real-time multi-task applications in dynamic systems. In Proceedings of the Real-Time Technology and Applications Symposium, pages 166--175, May 2000.

[LB01]

G. Lipari and S.K. Baruah. A hierarchical extension to the constant bandwidth server framework. In Proceedings of the Real-Time Technology and Application Symposium, 2001.

[LL73]

C. L. Liu and James W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46--61, 1973.

[LLS⁺91]

Jane W.-S. Liu, Kwei-Jay Lin, Wei Kuan Shih, Albert Chuang shi Yu, Jen-Yao Chung, and Wei Zhao. Algorithms for scheduling imprecise computations. IEEE Computer, 24(5):58--68, 1991.

[LMA88]

S. T. Levi, D. Mosse, and A. K. Agrawala. Allocation of real-time computations under fault-tolerance constraints. In Proceedings IEEE Real-Time Systems Symposium, pages 161--170, 1988.

[LSA⁺00]

C. Lu, J. A. Stankovic, T. F. Abdelzaher, G. Tao, S. H. Son, and M. Marley. Performance specifications and metrics for adaptive real-time systems. In Proceedings of the 21th IEEE Real-Time Systems Symposium, Dec 2000.

[LSD89]

John P. Lehoczky, Lui Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In IEEE Real-Time Systems Symposium, pages 166--171, 1989.

[LT94]

John P. Lehoczky and Sandra R. Thuel. Scheduling periodic and aperiodic tasks using the slack stealing algorithm. Advances in Real-Time Systems, pages 172--195, 1994.

[LW82]

J. Leung and J.W. Whitehead. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation, 2(4), 1982.

[Man98]

G. Manimaran. Resource management with dynamic scheduling in parallel and distributed real-time systems. PhD thesis, Indian Institute of Technology, Madras, jan 1998.

[MB97]

C. McElhone and A. Burns. Scheduling optional computations for adaptive real-time systems. Technical Report YCS289, 1997.

[MC96a]

Aloysius K. Mok and Deji Chen. A general model for real-time tasks. Technical Report CS-TR-96-24, 1996.

[MC96b]

Aloysius K. Mok and Deji Chen. A multiframe model for real-time tasks. In Proceedings of the Real-Time Systems Symposium, 1996.

[McE94]

C. McElhone. Adapting and evaluating algorithms for dynamic schedulability testing. Technical report, AC York, Feb 1994.

[McN59]

R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 12:1--12, 1959.

[Mer92]

Clifford W. Mercer. An introduction to real time operating systems: Scheduling theory. Technical report, CMU, Nov 1992. Unpublished manuscript.

[MF02]

Aloysius K. Mok and Alex Xiang Feng. Real-time virtual resource: A timely abstraction for embedded systems. In Second International Conference on Embedded Software, EMSOFT 2002, LNCS 2491, Oct 2002.

[Mig99]

Jörn Migge. L'ordonnancement sous contraintes temps-réel : un modèle à base de trajectoires. PhD thesis, INRIA Sophia Antipolis, Nov 1999.

[MM97]

G. Manimaran and C. Siva Ram Murthy. A new scheduling approach supporting different fault-tolerant techniques for real-time multiprocessor systems. Journal of Microprocessors and Microsystems, 21(3):163--173, dec 1997.

[MMM00a]

G. Manimaran, A. Manikutty, and C Siva Ram Murthy. Dharma: A tool for evaluating dynamic scheduling algorithms for real-time multiprocessor systems. Journal of Systems and Software, 50(2):131--149, Feb 2000.

[MMM00b]

A. Mittal, G. Manimaran, and C. Siva Ram Murthy. Integrated dynamic scheduling of hard and qos degradable real-time tasks in multiprocessor systems. to appear in Journal of Systems Architecture, 2000.

[Mok83]

A.K. Mok. Fundamental design problems of distributed systems for the hard-real-time environment. PhD thesis, Massachusetts Institute of Technology, Jun 1983.

[MS95]

M. Marucheck and J. Strosnider. An evaluation of the graceful degradation properties of real-time schedulers. In 25th Annual International Symposium on Fault-Tolerant Computing, June 1995.

[MW01]

Aloysius K. Mok and Weirong Wang. Window-constrained real-time periodic task scheduling. In Workshop on Real-Time Embedded Systems, Dec 2001.

[MZ93]

C. E. Moron and H. Zedan. Adaptable scheduler using milestones for hard real-time systems. Technical report, UYork, 1993.

[Nav99]

Nicolas Navet. Évaluation de performances temporelles et optimisation de l'ordonnancement de tâches et messages. PhD thesis, Institut National Polytechnique de Lorraine, Nov 1999.

[Net97]

E. Nett. Real-time behaviour in a heterogeneous environment. In Third International Workshop on Object-oriented Real-time Dependable Systems, Newport Beach, CA, GMD, Germany, February 6-7 1997.

[NG97a]

E. Nett and M. Gergeleit. Preserving real-time behavior in dynamic distributed systems. In IASTED International Conference on Artificial Intelligence and Soft Computing, The Bahamas, GMD, Germany, December 8--10 1997.

[NG97b]

E. Nett and M. Gergeleit. Preserving real-time behavior un dynamic distributed systems. In IEEE, editor, IEEE IASTED International Conference on Intelligent Information Systems, Grand Bahama Island, The Bahams, December 1997.

[NGM98]

E. Nett, M. Gergeleit, and M. Mock. An adaptive approach to object-oriented real-time computing. In Proceedings of ISORC'98, Kyoto, Japan, GMD, Germany, April 20--22 1998.

[NGM01]

E. Nett, M. Gergeleit, and M. Mock. Enhancing oo middleware to become time-aware. RTS Journal, ??:??, ? 2001.

[NGS97]

E. Nett, M. Gergeleit, and H. Streich. Flexible resource scheduling and control in an adaptive real-time environment. In IASTED International Conference on Artificial Intelligence and Soft Computing, Banff, Canada, GMD, Germany, July 27 --August1 1997.

[Nic98]

Guillem Bernat Nicolau. Specification and Analysis of Weakly Hard Real-Time Systems. PhD thesis, Universitat de les Illes Balears, Jan 1998.

[oCCL00]

University of Cambrifge Computer Laboratory. The Nemesis System Documentation, jan 2000.

[Pua02]

I. Puaut. Real-time performance of dynamic memory allocation algorithms. In Proc. of the 14th Euromicro Conference on Real-Time Systems, Vienna, Austria, June 2002.

[RH01]

Mario Aldea Rivas and Michael González Harbour. Posix-compatible application-defined scheduling in marte os. Technical report, Universidad de Cantabria. SP., 2001.

[Rie98]

Marco Riedel. Classification of deterministic scheduling problems (survey and notation), Aug 1998.

[RJMO98]

Raj Rajkumar, Kanaka Juvva, Anastasio Molano, and Shui Oikawa. Resource kernels: A resource-centric approach to real-time systems. In Proceedings of the SPIE/ACM Conference on Multimedia Computing and Networking, Jan 1998.

[RM00]

S. Ramamurthy and M. Moir. Static-priority periodic scheduling of multiprocessors. In Proceedings of the 21st IEEE Real-Time Systems Symposium, pages 69--78, Dec 2000.

[RRGC02]

Michael Richard, P. Richard, E. Grolleau, and F. Cottet. Contraintes de précédences et ordonnancement mono-processeur. In Proceedings of the Conférence Internationale sur les Systèmes Temps-Réel, Mar 2002.

[RS94]

K. Ramamritham and J. Stankovic. Scheduling algorithms and operating systems support for real-time systems. In IEEE, editor, Proceedings of the IEEE, volume 82, January 1994.

[RS01]

J. Regehr and J. Stankovic. Hls: A framework for composing soft real-time schedulers. In Proceedings of the Real-Time Systems Symposium, pages 3--14, Dec 2001.

[RSH00]

John Regehr, Jack Stankovic, and Marty Humphrey. The case for hierarchical schedulers with performance guarantees. Technical Report CS-2000-07, CS Virginia, 14, 2000.

[RSYJ97]

Daniela Rosu, Karsten Schwan, Sudhakar Yalamanchili, and Rakesh Jha. On adaptive resource allocation for complex real-time applications. In IEEE, editor, 18th IEEE Real-Time Systems Symposium, San Francisco, CA, volume GIT-CC-97-26, dec 1997.

[SA00]

K. Subramani and Ashok Agrawala. A dual interpretation of "standard constraints" in parametric scheduling. In Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, pages 121--133, Sep 2000.

[SAWJ⁺96]

Ion Stoica, Hussein Abdel-Wahab, Kevin Jeffay, Sanjoy Baruah, Johannes Gehrke, and C. Greg Plaxton. A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems. In Proceedings of the IEEE Real-Time Systems Symposium, December 1996.

[SB94]

M. Spuri and G. Buttazzo. Efficient aperiodic service under earliest deadline scheduling. In Proceedings of the 15th IEEE Real-Time System Symposium, pages 2--21, 1994.

[SBS95]

M. Spuri, G. Buttazzo, and F. Sensini. Robust aperiodic scheduling under dynamic priority systems. In Proc. of the IEEE Real-Time Systems Symposium, Pisa, Italy, dec 1995.

[SdSA95]

M. Saksena, J. da Silva, and A. K. Agrawala. Design and implementation of maruti-ii. Advances in Real-Time Systems, pages 72--102, 1995.

[SG97a]

H. Streich and M. Gergeleit. On the design of a dynamic distributed real-time environment. In 11th International Parallel Processing Symposium, University of Geneva, Switzerland, GMD, Germany, April 1-5 1997. University of Geneva, Switzerland.

[SG97b]

H. Streich and M. Gergeleit. On the design of a dynamic distributed real-time environment. In IEEE, editor, IEEE Workshop Parallel Distributed Real-Time Systems (WPDRTS), Geneva, Switzerland, 1997.

[SGL97]

Jun Sun, Mark K. Gardner, , and Jane W. S. Liu. Bounding completion times of jobs with arbitrary release times, variable execution times, and resource sharing. IEEE Transactions on Software Engineering, 23(10):603--615, Oct 1997.

[SL94]

Matthew F. Storch and Jane W.-S. Liu. A simulation environment for distributed real-time systems. In Proceedings of the SCS Simulation Multiconference, April 1994.

[SL95]

WK Shih and WS Liu. Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error. Proceedings of the IEEE Transactions on Computers, 44(3), March 1995.

[SLL93]

Wei Kuan Shih, Jane W.-S. Liu, and C. L. Liu. Modified rate-monotonic algorithm for scheduling periodic jobs with deferred deadlines. Software Engineering, 19(12):1171--1179, 1993.

[SLS95]

J.K. Strosnider, J.P. Lehoczky, and L. Sha. The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Transactions On Computers, 44(1):73--91, Jan 1995.

[SLS98]

John A. Stankovic, Chenyang Lu, and Sang H. Son. The case for feedback control real-time scheduling. Technical Report CS-98-35, Department of Computer Science, University of Virginia, November 27 1998.

[SNF98]

Kristian Sandström, Christer Norström, and Gerhard Fohler. Handling interrupts with static scheduling in an automotive vehicle control system. In Proceedings of the International Conferance on Real-Time Computing Systems and Applications, pages 158--165, Oct 1998.

[SP97]

Steven Sommer and John Potter. Admissibility tests for interrupted earliest deadline first scheduling with priority inheritance. Technical Report C/TR97-10, U Macquarie, Australia, Jun 1997.

[Spr90]

B. Sprunt. Aperiodic task scheduling for real-time systems. PhD thesis, Carnegie Mellon University, Aug 1990.

[Spu96]

M. Spuri. Analysis of deadline scheduled real-time systems. Technical Report 2772, INRIA Rocquencourt, jan 1996.

[SRG89]

W. Schwabl, J. Reisinger, and G. Grunsteidl. A survey of mars. Technical report, Institut fur Technische Informatik, Technical University Wein, 1989.

[SRL90]

L. Sha, R. Rajkumar, and J.P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers, 39(9):1175--1185, Sept 1990.

[SRN⁺98]

John A. Stankovic, Krithi Ramamritham, Douglas Niehaus, Marty Humphrey, and Gary Wallace. The spring system: Integrated support for complex real-time systems. Technical Report CS-98-18, Department of Computer Science, University of Virginia, August 1 1998.

[SS93]

Marco Spuri and John A. Stankovic. How to integrate precedence constraints and shared resources in real-time scheduling. Technical Report UM-CS-1993-019, U. Mass, 1993.

[SSDB94]

J. Stankovic, M. Spuri, M. DiNatale, and G. Buttazzo. Implications of classical scheduling results for real-time systems. Technical Report UM-CS-1994-089, U. Mass, 1994.

[SSNB94]

J.A. Stankovic, M. Spuri, M. Di Natale, and G. Buttazzo. Implications of classical scheduling results for real-time systems. Technical report, Scuola Superiore S.Anna, Pisa - Italy, June 1994.

[Sta88]

John A. Stankovic. Misconceptions about real-time computing. IEEE Computer, 21(10):10--19, 1988.

[Sta93a]

John A. Stankovic. Reflective real-time systems. Technical Report UM-CS-1993-056, University of Massachusetts, Amherst, Computer Science, June, 1993.

[Sta93b]

Prof. John A. Stankovic. Major real-time challenges for mechatronic systems. In to appear in Proceedings of International Workshop on Mechatronical Computer Systems for Perception and Action, June 1993, Massachussetts University, May 14 1993.

[Sta94]

John A. Stankovic. Adjustable flow control filters and reflective memories as support for distributed real-time systems. Technical Report UM-CS-1994-034, University of Massachusetts, Amherst, Computer Science, April, 1994.

[Str95]

H. Streich. Taskpair-scheduling: An approach for dynamic real-time systems. Int. Journal of Mini & Microcomputers, 17, No. 2:77--83, 1995.

[TBW92a]

K. Tindell, A. Burns, and A.J. Wellings. Allocating real-time tasks (an np-hard problem made easy). Real-Time Systems, 4(2):145--165, Jun 1992.

[TBW92b]

Ken Tindell, Alan Burns, and Andy J. Wellings. Mode changes in priority pre-emptively scheduled systems. In IEEE Real-Time Systems Symposium, pages 100--109, 1992.

[TC94]

K. Tindell and J. Clark. Holistic schedulability analysis for distributed hard real-time systems. Microprocessing and Microprogramming - Euromicro Journal (Special Issue on Parallel Embedded Real-Time Systems), 40:117--134, 1994.

[TDS⁺95]

T. Tia, Z. Deng, M. Shankar, M. Storch, J. Sun, L. Wu, and J. Liu. Probabilistic performance guarantee for real-time tasks with varying computation times. In Proceedings of the Real-Time Technology and Applications Symposium, pages 164--173, may 1995.

[TH99]

Henrik Thane and Hans Hansson. Handling interrupts in testing of distributed real-time systems. In Proceedings of the IEEE International Conference on Real-Time Computing Systems and Applications, 1999.

[Tin92a]

K. Tindell. An extendible approach for analyzing fixed priority hard real-time tasks. Technical Report YCS189, 1992.

[Tin92b]

K. Tindell. Using offset information to analyse static priority pre-emptively scheduled task sets. Technical Report YCS182, Aug 1992.

[Tin93]

K.W. Tindell. Fixed Priority Scheduling of Hard Real-Time Systems. PhD thesis, University of York, Dec 1993.

[Tin94]

K. Tindell. Adding time-offsets to schedulability analysis. Technical Report YCS221, 1994.

[TLS95]

T. Tia, J. Liu, and M. Shankar. Algorithms and optimality of scheduling aperiodic requests in fixed-priority preemptive systems. Journal of Real-Time Systems, 1995.

[TLSH94]

T. Tia, W. Liu, J. Sun, and R. Ha. A linear-time optimal acceptance test for scheduling of hard real-time tasks, 1994.

[TNR90]

H. Tokuda, T. Nakajima, and P. Rao. Real-Time Mach: Toward a Predictable Real-Time System. In Proceedings of USENIX Mach Workshop, pages 73--82, October 1990.

[Vij98]

Josh Haines Vijay. Development of application-level fault tolerance in a real-time benchmark. In Proceedings of the IEEE Workshop On Embedded Fault-Tolerant Systems, May 1998.

[VJP97]

Brian VanVoorst, Rakesh Jha, and Luiz Pires. A real-time parallel benchmark suite. SIAM's Parallel Processing for Scientific Computing, 1997.

[WL99a]

Yu-Chung Wang and Kwei-Jay Lin. Implementing a general real-time scheduling framework in the RED-linux real-time kernel. In IEEE Real-Time Systems Symposium, pages 246--255, 1999.

[WL99b]

Yu-Chung Wang and Kwei-Jay Lin. Providing real-time support in the linux kernel. In IEEE Real-Time Technology and Applications Symposium, 1999.

[WS99a]

Y. Wang and M. Saksena. Scheduling fixed priority tasks with preemption threshold. In Proceedings of the IEEE International Conference on Real-Time Computing Systems and Applications, 1999.

[WS99b]

Lonnie R. Welch and Behrooz A. Shirazi. A dynamic real-time benchmark for assessment of qos and resource management technology. In Real-Time Technology and Applications Symposium, Jun 1999.

[WS02]

Yun Wang and Manas Saksena. Scheduling fixed-priority tasks with preemption threshold: An attractive technology?, 2002. Regehr's readings.

[Zub98]

Khawar M. Zuberi. Real-Time Operating System Services for Networked Embedded Systems. PhD thesis, University of Michigan, 1998.