71 ;;Quote: a periodic process can be described by its period, worst case computation time, deadline, and release time

71 ;;Quote: an asynchronous process can be described by its worst case computation time, deadline, and minimum time between consecutive requests

71+;;Quote: can replace an asynchronous with a periodic one with a period shorter than the minimum request interval

71 ;;Quote: a pre-run-time schedule can satisfy precedence and exclusion relations; e.g., for acquiring information or for sharing resources

73 ;;Quote: for hard-real-time systems, predictability is most important; pre-run-time scheduling is often necessary

75 ;;Quote: pre-run-time scheduling reduces run-time scheduling costs and context switches; asynchronous requests are serviced by a periodic process