Publication 1997 Issue No. 12 - December Abstract - Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Tei-Wei Kuo Articles by Aloysius K. Mok
December 1997 (vol. 46 no. 12)
pp. 1313-1324
 ASCII Text x Tei-Wei Kuo, Aloysius K. Mok, "Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems," IEEE Transactions on Computers, vol. 46, no. 12, pp. 1313-1324, December, 1997.
 BibTex x @article{ 10.1109/12.641932,author = {Tei-Wei Kuo and Aloysius K. Mok},title = {Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems},journal ={IEEE Transactions on Computers},volume = {46},number = {12},issn = {0018-9340},year = {1997},pages = {1313-1324},doi = {http://doi.ieeecomputersociety.org/10.1109/12.641932},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time SystemsIS - 12SN - 0018-9340SP1313EP1324EPD - 1313-1324A1 - Tei-Wei Kuo, A1 - Aloysius K. Mok, PY - 1997KW - Adaptive schedulingKW - configuration selectionKW - load adjustmentKW - load scalingKW - period assignmentKW - real-time systems.VL - 46JA - IEEE Transactions on ComputersER -

Abstract—We provide a framework for discussing how to adjust load in order to handle periodic processes whose timing parameters vary with time. The schedulability of adjustable periodic processes by a preemptive fixed priority scheduler is formulated in terms of a configuration selection problem for which a PTIME solution is shown. When the list of allowable configurations is implicitly given by a set of scalable periodic processes, the corresponding period assignment problem is shown to be NP-Complete. We present an approximation algorithm for the period assignment problem for which we show some encouraging experimental results.

[1] T.P. Baker, A Stack-Based Resource Allocation Policy for Real-Time Processes Proc. IEEE Real-Time Systems Symp., pp. 191-200, 1990.
[2] B. Berger, J. Rompel, and P.W. Shor, "Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry," Proc. IEEE 30th Ann. Symp. Foundations of Computer Science, pp. 54-59, Oct. 30- Nov.1, 1989.
[3] V. Chvatal, "A Greedy Heuristic for the Set Covering Problem," Mathematics of Operations Research, vol. 4, pp. 233-235, Aug. 1979.
[4] M. Chen and K.J. Lin, "Dynamic Priority Ceilings: A Concurrency Control Protocol for Real-Time Systems," Technical Report UIUCDCS-R-89-1511, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Apr. 1989.
[5] R.I. Davis, K.W. Tindell, and A. Burns, “Scheduling Slack Time in Fixed Priority Preemptive Systems,” Proc. Real-Time Systems Symp., pp. 222-231, 1993.
[6] S. Even,Graph Algorithms. Pitman Publishing, 1979.
[7] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[8] J.E. Hopcroft and R.M. Karp, "An$n^{{\textstyle{5 \over 2}}}$Algorithm for Maximum Matchings In Bipartite Graph," J. SIAM, vol. 2, no. 4, pp. 225-231, Dec. 1973.
[9] K.L. Heninger, J.W. Kallander, and J.E. Shore, "Software Requirements for the A-7E Aircraft," NRL Memorandum Report 3876, Nov.27, 1978.
[10] D.S. Johnson, "Approximation Algorithms for Combinatorial Problems," J. Computer and System Sciences, vol. 9, pp. 256-278, 1974.
[11] R.M. Karp, "Reducibility Among Combinatorial Problems," Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, eds., pp. 85-103.New York: Plenum Press, 1972.
[12] J.Y.-T. Leung and J. Whitehead, "On the Complexity of a Fixed-Priority Scheduling of Periodic, Real-Time Tasks," Performance Evaluation, vol. 2, pp. 237-250, 1982.
[13] 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.
[14] C. D. Locke, "Best-Effort Decision Making for Real-Time Scheduling," PhD thesis, Computer Science Dept., Carnegie Mellon Univ., 1986.
[15] C. Lund and M. Yannakakis, "On the Hardness of Approximating Minimization Problems," Proc. 25th ACM Symp. Theory of Computing, 1993.
[16] A.K. Mok, "Fundamental Design Problems for the Hard Real-Time Environment," PhD dissertation, Massachusetts Inst. of Tech nology, 1983.
[17] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[18] 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.

Index Terms: