Abstract
Real-time computer systems are essential for many applications, such as robot control, avionics, medical instrumentation, manufacturing, etc. The correctness of the system depends on the temporal correctness as well as the functional correctness of the task executions. In order to assure temporal correctness it is necessary that the resources be scheduled to meet the temporal requirements of applications. When we consider the problem of nonpreemptive scheduling of a set of tasks in a processor for which no feasible solution exists, some tasks may have to be rejected so that a schedule can be generated for the rest. In this paper, we consider the problem of generating an optimal schedule such that the number of rejected tasks is minimized, and then the finish time is minimized for the accepted tasks. We propose to use an analytic approach to solve this problem. We first discuss the super sequence based technique which was originally proposed for reducing the search space in testing the feasibility of a task set. Then we show by the Conformation theorem that the super sequence constructed from the task set also provides a valid and reduced search space for the optimization problem. While the complexity of our scheduling algorithm in the worst case remains exponential, our simulation results show that the cost is reasonable for the average case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.T. Cheng, S.I. Hwang, and A.K. Agrawala, “Mission-oriented replication of periodic tasks in distributed real-time systems,” Technical Report CS-TR-3256, UMIACS-94-46, Department of Computer Science, University of Maryland at College Park, 1994.
M. Dertouzos, “Control robotics: The procedural control of physical processes,” in Proceedings of the IFIP Congress, 1974, pp. 807-813.
J. Erschler, G. Fontan, C. Merce, and F. Roubellat, “A new dominance concept in scheduling n jobs on a single machine with ready times and due dates,” Operations Research, vol. 31, no. 1, pp. 114-127, 1983.
M.R. Garey and D.S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, W.H. Freeman Company: San Francisco, 1979.
D.W. Gillies and J.W.-S. Liu, “Greed in resource scheduling,” in IEEE Real-Time Systems Symposium, Dec. 1989, pp. 285-294.
Shyh-In Hwang, Chia-Mei Chen, and A.K. Agrawala, “Scheduling an overloaded real-time system,” Technical Report CS-TR-3377, UMIACS-TR-94-128, Department of Computer Science, University of Maryland at College Park, Nov. 1994a.
Shyh-In Hwang, Sheng-Tzong Cheng, and A.K. Agrawala, “Optimization in non-preemptive scheduling for a periodic tasks,” Technical Report CS-TR-3216, UMIACS-TR-94-14, Department of Computer Science, University of Maryland at College Park, Jan. 1994b.
H. Kopetz, A. Damm, C. Koza, M. Mulazzani, W. Schwabl, C. Senft, and R. Zainlinger, “Distributed fault tolerant real-time systems: The mars approach,” IEEE Micro, vol. 9, no. 1, pp. 25-40, 1989.
J.P. Lehoczky, “Fixed priority scheduling of periodic tasks with arbitrary deadlines,” in IEEE Real-Time Systems Symposium, Dec. 1990, pp. 201-209.
J.Y. Leung and J. Whitehead, “On the complexity of fixed priority scheduling of periodic, real-time tasks,” Performance Evaluation, vol. 2, no. 4, pp. 237-250, 1982.
S.T. Levi, S.K. Tripathi, S.D. Carson, and A.K. Agrawala, “The maruti hard real-time operating system,” ACM SIGOPS, Operating Systems Review, vol. 23, pp. 90-106, 1989.
C.L. Liu and J. Layland, “Scheduling algorithm for multiprogramming in a hard real-time environment,” Journal of the ACM, vol. 20, no. 1, pp. 46-61, 1973.
M. Saksena and A. Agrawala, “Temporal analysis for static hard-real time scheduling,” in Proceedings 12th International Phoenix Conference on Computers and Communications, March 1993, pp. 538-544.
A. Mok, “Fundamental design problems of distributed systems for the hard real-time environment,” PhD thesis, MIT Laboratory for Computer Science, May 1983.
Sang Son (Ed.), Principles of Real-Time Systems, 1994, ch. 4.
L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority inheritance protocols: An approach to real-time synchronization,” Technical Report CMU-CS-87-181, Department of Computer Science, Carnegie-Mellon University, 1987.
L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority inheritance protocols: An approach to real-time synchronization,” IEEE Transactions on Computers, vol. 39, no. 9, pp. 1175-1185, 1990.
J.A. Stankovic and K. Ramamritham, “The spring kernel: Operating system support for critical, hard real-time systems,” in Workshop on Operating Systems for Mission Critical Computing, Sept. 1989, pp. A1-A9.
P. Thambidurai and K.S. Trivedi, “Transient overloads in fault-tolerant real-time systems,” in IEEE Real-Time Systems Symposium, Dec. 1989.
X. Yuan, M. Saksena, and A.K. Agrawala, “A decomposition approach to non-preemptive real-time scheduling,” Journal of Real-Time Systems, Jan. 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hwang, SI., Cheng, ST. Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms. Journal of Combinatorial Optimization 5, 345–375 (2001). https://doi.org/10.1023/A:1011449311477
Issue Date:
DOI: https://doi.org/10.1023/A:1011449311477