Incremental reconfiguration and load adjustment in adaptive real-time systems

IEEE Transactions on Computers

Volumn 46, Issue 12, 1997, Pages 1313-1324

  Kuo, Tei Wei ^a,c   Mok, Aloysius K ^b,c  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b University of Texas at Austin   (United States)

^c IEEE   (Taiwan)

Author keywords

Adaptive scheduling; Configuration selection; Load adjustment; Load scaling; Period assignment; Real time systems

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

CONFIGURATION SELECTION; LOAD ADJUSTMENT; LOAD SCALING; PERIOD ASSIGNMENT;

REAL TIME SYSTEMS;

EID: 0031354810     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.641932     Document Type: Article

References (19)

1. T.P. Baker, "A Stack-Based Resource Allocation Policy for Real-Time Processes," IEEE 11th Real-Time Systems Symp., Dec. 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 UI-UCDCS-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. IEEE 14th Real-Time Systems Symp., Dec. 1993.
6. S. Even, Graph Algorithms. Computer Science Press, 1979.
7. M.R. Garey and D.S Johnson, Computers and Intractability: A guide to the Theory of NP-Completeness San Francisco: W.H. Freeman, 1979.
8. 5/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. 46-61, Jan. 1973.
14. C.D. Locke, "Best-Effort Decision Making for Real-Time Scheduling," PhD dissertation, 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 Technology, 1983.
17. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, N.J: Prentice Hall, 1982.
18. L. Sha, R. Rajkumar, and J.P. Lehoczky, "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," Technical Report CMU-CS-87-181, Dept. of Computer Science, Carnegie Mellon Univ., Nov. 1987,
19. also IEEE Trans. Computers, vol. 39, no. 9, Sept. 1990.