Approximate Analysis of a Generalized Clocked Schedule
A. A. Fredericks, Brian L. Farrell, D. Demaio · AT&T Technical Journal · 1985
Clocked schedules represent an important method of task scheduling for computer systems with real-time applications. In this paper we consider a generalized class of clocked schedule that includes those used in many stored program control switching systems. Key performance measures for this class are discussed, and an analytic approximation method for analyzing certain of these measures is given. This approximation method is most applicable in evaluating long-term delays. (A companion paper by Doshi addresses short-term delays for systems with extremely time-critical tasks.) Comparisons are made with exact numerical results (obtained using the method presented in a companion paper by Ackroyd), detailed simulation models, and field data.