| 
|
QuoteRef: liuCL1_1973
topics >
all references >
ThesaHelp:
references i-l
Topic:
hard real time systems
Topic:
task scheduling
Reference
Liu, C.L., Layland, J.W., "Scheduling algorithms for multiprogramming in a hard-real-time environment", Journal of the Association of Computing Machinery, 20, 1, January 1973, pp. 46-61. Google
47 ;;Quote: only independent, periodic, regular tasks can have hard deadlines; no hard deadlines for nonperiodic tasks such as initialization and failure recovery
49 ;;Quote: a critical instance occurs when a task has the longest response time; i.e., when requested with higher priority tasks
50 ;;Quote: use rate-monotonic priority assignment for optimal, static priorities; highest priority given to task with highest request rate
55 ;;Quote: use deadline driven scheduling for optimal, dynamic priorities; highest priority to task with nearest deadline; no idle time prior to overflow; best schedulability
58 ;;Quote: combining rate-monotonic with deadline driven scheduling may be best for hard read-time applications
ThesaHelp: references i-l (342 items)
Topic: hard real time systems (64 items)
Topic: task scheduling (49 items)