| 
|
QuoteRef: kleiMH1_1994
topics >
all references >
ThesaHelp:
references i-l
Topic:
hard real time systems
Reference
Klein, M.H., Lehoczky, J.P., Rajkumar, R., "Rate-monotonic analysis for real-time industrial computing", Computer, January 1994, pp. 24-33. Google
26 ;;Quote: while off-line schedules are efficient, they do poorly with changes, aperiodic tasks, large task sets, and schedule overruns
26 ;;Quote: the rate-monotonic scheduling algorithm assigns periodic task priorities in inverse relation to task period; good for real-time
26+;;Quote: the earliest deadline scheduling algorithm assigns the highest priority to the ready task with the nearest deadline; good for real-time
ThesaHelp: references i-l (342 items)
Topic: hard real time systems (64 items)