Analysis of cache-related preemption delay in fixed-priority preemptive scheduling

IEEE Transactions on Computers

Volumn 47, Issue 6, 1998, Pages 700-713

  Lee, Chang Gun ^a,b   Hahn, Joosun ^a,b   Seo, Yang Min ^b   Min, Sang Lyul ^a,b   Ha, Rhan ^a,c   Hong, Seongsoo ^a,b   Park, Chang Yun ^a,d   Lee, Minsuk ^a,e   Kim, Chong Sang ^a,b  

^a Seoul National University ^*

^b Seoul National University   (South Korea)

^c Hong Ik University   (South Korea)

^d Chung Ang University   (South Korea)

^e Hansung University   (South Korea)

Author keywords

Cache memory; Fixed priority scheduling; Preemption; Real time system; Schedulability analysis

Indexed keywords

EID: 0000940792     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.689649     Document Type: Article

References (34)

1. H. Chetto and M. Chetto, "Some Results of the Earliest Deadline Scheduling Algorithm," IEEE Trans. Software Eng., vol. 15, no. 10, pp. 1,261-1,269, Oct. 1989.
2. M. Joseph and P. Pandya, "Finding Response Times in a Real-Time System," BCS Computer J., vol. 29, no. 5, pp. 390-395, Oct. 1986.
3. J. Lehoczky, L. Sha, and Y. Ding, "The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior," Proc. IEEE 10th Real-Time Systems Symp., pp. 166-171, 1989.
4. C.L. Liu and J.W. Layland, "Scheduling Algorithmsfor Multiprogramming in a Hard Real-Time Environment," J. ACM, vol. 20, no. 1, pp. 45-61, Jan. 1973.
5. K. Schwan and H. Zhou, "Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads," IEEE Trans. Software Eng., vol. 18, no. 8, pp. 736-748, Aug. 1992.
6. K. Tindell, A. Burns, and A. Wellings, "An Extendible Approach for Analyzing Fixed Priority Hard Real-Time Tasks," J. Real-Time Systems, vol. 6, no. 2, pp. 133-151, Mar. 1994.
7. A. Burns, K. Tindell, and A. Wellings, " Effective Analysis for Engineering Real-Time Fixed Priority Schedulers," IEEE Trans. Software Eng., vol. 21, no. 5, pp. 475-480, May 1995.
8. A. Burns and A. Wellings, "The Impact of an Ada Run-time System's Performance Characteristics on Scheduling Models," Proc. 12th Ada-Europe Int'l Conf., pp. 240-248, June 1993.
9. K. Jeffay and D.L. Stone, "Accounting for Interrupt Handling Costs in Dynamic Priority Task Systems," Proc. IEEE 14th Real-Time Systems Symp., pp. 212-221, Dec. 1993.
10. D.I. Katcher, H. Arakawa, and J.K. Strosnider, "Engineering and Analysis of Fixed Priority Schedulers," IEEE Trans. Software Eng., vol. 19, no. 9, pp. 920-934, Sept. 1993.
11. J.L. Hennessy and D.A. Patterson, Computer ArchitectureA Quantitative Approach, second ed. San Mateo, Calif.: Morgan Kaufmann, 1996.
12. S. Basumallick and K. Nilsen, "Cache Issues in Real-Time Systems," Proc. First ACM SIGPLAN Workshop Language, Compiler, and Tool Support for Real-Time Systems, June 1994.
13. J.V. Busquets-Mataix, J.J. Serrano-Martin, R. Ors, P. Gil, and A. Wellings, "Adding Instruction Cache Effect to Schedulability Analysis of Preemptive Real-Time Systems," Proc. IEEE Second Real-Time Technology and Applications Symp., June 1996.
14. D.G. Luenberger, Linear and Nonlinear Programming. Ontario: Addison-Wesley, 1989.
15. R. Arnold, F. Mueller, D.B. Whalley, and M. Harmon, "Bounding Worst-Case Instruction Cache Performance," Proc. IEEE 15th Real-Time Systems Symp., pp. 172-181, Dec. 1994.
16. C.A. Healy, D.B. Whalley, and M. Harmon, "Integrating the Timing Analysis of Pipelining and Instruction Caching," Proc. IEEE 16th Real-Time Systems Symp., pp. 288-297, Dec. 1995.
17. Y. Hur, Y.H. Bae, S.-S. Lim, S.-K. Kim, B.-D. Rhee, S.L. Min, C.Y Park, M. Lee, H. Shin, and C.S. Kim, "Worst Case Timing Analysis of RISC Processors: R3000/ R3010 Case Study," Proc. IEEE 16th Real-Time Systems Symp., pp. 308-319, Dec. 1995.
18. Y.-T.S. Li, S. Malik, and A. Wolfe, "Efficient Microarchitecture Modeling and Path Analysis for Real-Time Software," Proc. IEEE 16th Real-Time Systems Symp., pp. 298-307, Dec. 1995.
19. S.-S. Lim, Y.H. Bae, G.T. Jang, B.-D. Rhee, S.L. Min, C.Y. Park, H. Shin, K. Park, and C.S. Kim, "An Accurate Worst Case Timing Analysis Technique for RISC Processors," Proc. IEEE 15th Real-Time Systems Symp., pp. 97-108, Dec. 1994.
20. D.B. Kirk, "SMART (Strategic Memory Allocation for Real-Time) Cache Design," Proc. IEEE 10th Real-Time Systems Symp., pp. 229-237, Dec. 1989.
21. D.B. Kirk and J.K. Strosnider, "SMART (Strategic Memory Allocation for Real-Time) Cache Design Using the MIPS R3000," Proc. IEEE 11th Real-Time Systems Symp., pp. 322-330, Dec. 1990.
22. D.B. Kirk, J.K. Strosnider, and J.E. Sasinowski, "Allocating SMART Cache Segments for Schedulability," Proc. Euromicro '91 Workshop Real-Time Systems, pp. 41-50, June 1991.
23. A. Wolfe, "Software-Based Cache Partitioning for Real-time Applications," Proc. Third Int'l Workshop Responsive Computer Systems, Sept. 1993.
24. A.V. Aho, R. Sethi, and J.D. Ullman, Compilers Principles, Techniques, and Tools. Reading, Mass.: Addison-Wesley, 1988.
25. M.S. Hecht and J.D. Ullman, "A Simple Algorithm for Global Data Flow Analysis Problems," SIAM J. Computing, vol. 4, no. 4, pp. 519-532, Dec. 1975.
26. C.S. Burrus, DFT/FFT and Convolution Algorithm: Theory & Implementation. New York: Wiley, 1984.
27. S.D. Conte and C. de Boor, Elementary Numerical Analysis. New York: McGraw-Hill, 1987.
28. P.M. Embree, C Algorithms for Real-Time DSP. Upper Saddle River, N.J.: Prentice Hall PTR, 1995.
29. P. Puschner and C. Koza, "Calculating the Maximum Execution Time of Real-Time Programs," J. Real-Time Systems, vol. 1, no. 2, pp. 159-176, Sept. 1989.
30. K.-J. Lin, J.W.S. Liu, K.B. Kenny, and S. Natarajan, "FLEX: A Language for Programming Flexible Real-Time Systems," Foundations of Real-Time Computing: Formal Specifications and Methods, A.M. van Tilborg and G.M. Koob, eds., pp. 251-289. Kluwer Academic, 1990.
31. C.Y. Park, "Predicting Program Execution Times by Analyzing Static and Dynamic Program Paths," J. Real-Time Systems, vol. 5, no. 1, pp. 31-62, Mar. 1993.
32. S.-K. Kim, S.L. Min, and R. Ha, "Efficient Worst Case Timing Analysis of Data Caching," Proc. IEEE Second Real-Time Technology and Applications Symp., June 1996.
33. J. Hahn, "Calculating the Worst Case Preemption Costs of Instruction Cache," MSthesis, Seoul Nat'l Univ., 1996.
34. N.C. Audsley, "Optimal Priority Assignment and Feasibility of Static Priority Taskswith Arbitrary Start Times," Technical Report YCS-91-164, Real-Time Systems Research Group, Dept. of Computer Science, Univ. of York, Nov. 1991.