Abstract
Real-timecomputer systems are essential for many applications, such asrobot control, avionics, medical instrumentation, manufacturing,etc. The correctness of the system depends on the temporal correctnessas well as the functional correctness of the task executions.In order to assure temporal correctness it is necessary thatthe resources be scheduled to meet the temporal requirementsof applications. When we consider the problem of nonpreemptivescheduling of a set of tasks in a processor for which no feasiblesolution exists, some tasks may have to be rejected so that aschedule can be generated for the rest. In this paper, we considerthe problem of generating an optimal schedule such that the numberof rejected tasks is minimized, and then the finish time is minimizedfor the accepted tasks. We propose to use an analytic approachto solve this problem. We first discuss the super sequence basedtechnique which was originally proposed for reducing the searchspace in testing the feasibility of a task set. Then we showby the Conformation theorem that the super sequence constructedfrom the task set also provides a valid and reduced search spacefor the optimization problem. While the complexity of our schedulingalgorithm in the worst case remains exponential, our simulationresults 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
Babau, J.-P., and Cottet, F. 1996. Extension of scheduling algorithms in case of conditional or parametric synchronization relationships. Proceedings of the 8th Euromicro Workshop on Real-Time Systems pp. 64-69.
Cheng, S. T., Hwang, S. I., and Agrawala, A. K. 1994. 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.
Cheng, S. T., and Hwang, S. I. 1999. Combinatorial optimization in real-time scheduling: Theory and algorithms. Submitted to Journal of Combinatorial Optimization.
Erschler, J., Fontan, G., Merce, C., and Roubellat, F. 1983. A new dominance concept in scheduling n jobs on a single machine with ready times and due dates. Operations Research 31(1): 114-127.
Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability, a Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman Company.
Gillies, D. W., and Liu, J. W-S. 1989. Greed in resource scheduling. IEEE Real-Time Systems Symposium 285-294.
Hwang, Shyh-In, Chen, Chia-Mei, and Agrawala, Ashok K. 1994. 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.
Hwang, Shyh-In, Cheng, Sheng-Tzong, and Agrawala, Ashok K. 1994. Optimization in non-preemptive scheduling for aperiodic tasks. Technical Report CS-TR-3216, UMIACS-TR-94-14, Department of Computer Science, University of Maryland at College Park.
Kopetz, H., Damm, A., Koza, C., Mulazzani, M., Schwabl, W., Senft, C., and Zainlinger, R. 1999. Distributed fault tolerant real-time systems: The mars approach. IEEE Micro 9(1): 25-40.
Lehoczky, J. P. 1990. Fixed priority scheduling of periodic tasks with arbitrary deadlines. IEEE Real-Time Systems Symposium 201-209.
Leung, J. Y., and Whitehead, J. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2(4): 237-250.
Levi, S. T., Tripathi, S. K., Carson, S. D., and Agrawala, A. K. 1989. The maruti hard real-time operating system. ACM SIGOPS, Operating Systems Review 23: 90-106.
Liu, C. L., and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1): 46-61.
Mok, A. 1983. Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment. PhD thesis, MIT Laboratory for Computer Science.
Saksena, Manas, and Agrawala, Ashok. 1993. Temporal analysis for static hard-real time scheduling. Proceedings 12th International Phoenix Conference on Computers and Communications pp. 538-544.
Sha, L., Rajkumar, R., and Lehoczky, J. P. 1990. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers 39(9): 1175-1185.
Son, Sang (editor). 1994. Principles of Real-Time Systems, chapter 4.
Stankovic, J. A., and Ramamritham, K. 1989. The spring kernel: Operating system support for critical, hard real-time systems. Workshop on Operating Systems for Mission Critical Computing pp. A1-A9.
Thambidurai, Philip, and Trivedi, Kishor S. 1989. Transient overloads in fault-tolerant real-time systems. IEEE Real-Time Systems Symposium.
Yuan, X., Saksena, M., and Agrawala, A. K. 1994. A decomposition approach to non-preemptive real-time scheduling. Journal of Real-Time Systems.
Zhang, L., Huang, J., and Zheng, Y. 1997. Scheduling algorithms for multiprocessor real-time systems. Proceedings of 1997 International Conference on Information, Communications and Signal Processing pp. 1470-1474.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cheng, ST., Hwang, SI. Optimal Real-Time Scheduling with Minimal Rejections and Minimal Finishing Time. Real-Time Systems 20, 229–253 (2001). https://doi.org/10.1023/A:1008150101419
Issue Date:
DOI: https://doi.org/10.1023/A:1008150101419