This Article 
 Bibliographic References 
 Add to: 
Guaranteeing Real-Time Requirements With Resource-Based Calibration of Periodic Processes
July 1995 (vol. 21 no. 7)
pp. 579-592
This paper presents a comprehensive design methodology for guaranteeing end-to-end requirements of real-time systems. Applications are structured as a set of process components connected by asynchronous channels, in which the endpoints are the system’s external inputs and outputs. Timing constraints are then postulated between these inputs and outputs; they express properties such as end-to-end propagation delay, temporal input-sampling correlation, and allowable separation times between updated output values. The automated design method works as follows: First new tasks are created to correlate related inputs, and an optimization algorithm, whose objective is to minimize CPU utilization, transforms the end-to-end requirements into a set of intermediate rate constraints on the tasks. If the algorithm fails, a restructuring tool attempts to eliminate bottlenecks by transforming the application, which is then re-submitted into the assignment algorithm. The final result is a schedulable set of fully periodic tasks, which collaboratively maintain the end-to-end constraints.

[1] R. Alur,C. Courcoubetis,, and D. Dill,“Model-checking for real-time Systems,” Proc. IEEE Symp. on Logic in Computer Science, 1990.
[2] N. Audsley,A. Burns,M. Richardson,, and A. Wellings,“Hard real-time scheduling: The deadline-monotonic approach,” Proc. IEEE Workshop on Real-Time Operating Systems and Software, pp. 133-137, May 1991.
[3] N. Audsley,A. Burns,M. Richardson,, and A. Wellings,“Data consistency in hard real-time systems,” Technical Report YCS 203 (1993), Dept. of Computer Science, Univ. of York, York, England, June 1993.
[4] G. Berry,S. Moisan,, and J. Rigault,“ESTEREL: Towards a synchronous and semantically sound high level languagefor real time applications,” Proc.IEEE Real-Time Systems Symp., pp. 30-37.Los Alamitos, Calif.: IEEE CS Press, December 1983.
[5] A. Burns,“Preemptive priority based scheduling: An appropriate engineeringapproach,” S. Son, ed., Principles of Real-Time Systems.Englewood Cliffs, N.J.: Prentice Hall, 1994.
[6] G. Dantzig and B. Eaves,“Fourier-Motzkin elimination and its dual,” J. of Combinatorial Theory (A), vol. 14, pp. 288-297, 1973.
[7] R. Gerber and S. Hong,“Semantics-based compiler transformations for enhancedschedulability,” Proc. of IEEE Real-Time Systems Symp., pp. 232-242.Los Alamitos, Calif.: IEEE CS Press, December 1993.
[8] M. Harbour, M. Klein, and J. Lehoczky, “Fixed Priority Scheduling of Periodic Tasks with Varying Execution Priority,” Proc. IEEE Real-Time Systems Symp., pp. 116-128, Dec. 1991.
[9] F. Jahanian and A. K.-L. Mok,“Safety analysis of timing properties in real-time systems,”IEEE Trans. Software Eng., vol. SE-12, pp. 890–904, Sept. 1986.
[10] K. Jeffay,“The real-time producer/consumer paradigm: A paradigm for the constructionof efficient, predictable real-time systems,” ACM/SIGAPP Symp. on Applied Computing, pp. 796-804. ACM Press, February 1983.
[11] M. Klein,J. Lehoczky,, and R. Rajkumar,“Rate-monotonic analysis for real-time industrial computing,” Computer, pp. 24-33, January 1994.
[12] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[13] L. Sha, R. Rajkuma, and J.P. Lehoczky, "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," IEEE Trans. Computers, vol. 39, no. 9, pp. 1,175-1,185, Sept. 1990.
[14] K. Tindell,“Using offset information to analyse static priority pre-emptively scheduledtask sets,” Technical Report YCS 182 (1992), Dept. of Computer Science, Univ. of York, York, England, August 1992.
[15] K. Tindell, A. Burns, and A. Wellings, “An Extendible Approach for Analyzing Fixed Priority Hard Real-Time Tasks,” The J. Real-Time Systems, vol. 6, pp. 133–151, Mar. 1994.
[16] J. Xu and D.L. Parnas, “Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations,” IEEE Trans. Software Eng., vol. 16, no. 3, pp. 360-369, Mar. 1990.
[17] X. Yuan,M. Saksena,, and A. Agrawala,“A decomposition approach to real-time scheduling,” Real-Time Systems, vol. 6, no. 1, 1994.
[18] W. Zhao, K. Ramamritham, and J.A. Stankovic, “Scheduling Tasks with Resource Requirements in Hard Real Time Systems,” IEEE Trans. Software Eng., vol. 13, no. 5, pp. 564-577, May 1987.

Index Terms:
Real-time, design methodology, static priority scheduling, end-to-end timing constraints, constraint solving, non-linear optimization.
Richard Gerber, Seongsoo Hong, Manas Saksena, "Guaranteeing Real-Time Requirements With Resource-Based Calibration of Periodic Processes," IEEE Transactions on Software Engineering, vol. 21, no. 7, pp. 579-592, July 1995, doi:10.1109/32.392979
Usage of this product signifies your acceptance of the Terms of Use.