M. Gonzalez Harbour, M. H. Klein, and J. P. Lehoczky. Timing analysis for fixed-priority scheduling of hard realtime systems. IEEE Transactions on Software Engineering, 20(1):13--28, January 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....that the tasks are dynamically scheduled according to an o#ine (static) assignment of task priorities. The precedence relationships are implicitly enforced by carefully choosing the task periods, o#sets and deadlines but this makes the analysis pessimistic. Gonzalez Harbour et al. GKL91, GKL94] consider certain types of precedence relationships among tasks and provide schedulability criteria for these situations. Sun et al. SGL97] additionally extend the approach by considering fixed release times for the tasks. Blazewicz [Bla76] showed how to modify the task deadlines under the ....

M. Gonzalez Harbour, M. H. Klein, and J. P. Lehoczky. Timing analysis for fixed-priority scheduling of hard realtime systems. IEEE Transactions on Software Engineering, 20(1):13--28, January 1994.

....overheads are ignored. Naturally, ignoring the overheads is useful only in theory. RMS has been extended to include the consideration of the various overheads. Katcher, Arakawa and Strosnider described in [KAS93] a methodology for incorporating the costs of scheduler implementation into RMS. In [HKL94] Harbour, Klein and Lehoczky presented a timing analysis for a modified task model, where the tasks consist of subtasks with potentially different priorities, execution times, and timing requirements. This allows more accurate modeling of actual systems by accounting for interrupts, ....

Michael Gonzalez Harbour, Mark H. Klein, and John P. Lehoczky. Timing analysis for fixed-priority scheduling of hard real-time systems. IEEE Transactions on Software Engineering, 20(1):13--28, January 1994.

.... are highly structured and interact in very limited ways (e.g. periodic tasks with precedence constraints) These restrictions allow the use of special scheduling techniques and algorithms, such as rate monotonic scheduling [1] to guarantee that a system s timing requirements are satisfied [2,3]. In fact, there are many situations in which developers would benefit from tools that could analyze partiallyimplemented systems, those for which some components are given only as high level specifications while others are fully implemented in a programming language. These include: ffl Initial ....

Michael Gonzalez Harbour, Mark H. Klein, and John P. Lehoczky, "Timing analysis for fixed-priority scheduling of hard real-time systems," IEEE Transactions on Software Engineering, vol. 20, no. 1, pp. 13--28, 1994.

.... are highly structured and interact in very limited ways (e.g. periodic tasks with precedence constraints) These restrictions allow the use of special scheduling techniques and algorithms, such as rate monotonic scheduling [1] to guarantee that a system s timing requirements are satisfied [2, 3]. In fact, there are many situations in which developers would benefit from tools that could analyze partiallyimplemented systems, those for which some components are given only as high level specifications while others are fully implemented in a programming language. These include: ffl Initial ....

Michael Gonzalez Harbour, Mark H. Klein, and John P. Lehoczky, "Timing analysis for fixed-priority scheduling of hard real-time systems," IEEE Transactions on Software Engineering, vol. 20, no. 1, pp. 13--28, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC