Abstract
Consider the problem of scheduling a set ofn tasks on a uniprocessor such that a feasible schedule that satisfies each task's time constraints is generated. Traditionally, researchers have looked at all the tasks as a group and applied heuristic or enumeration search to it. We propose a new approach called thedecomposition scheduling where tasks are decomposed into a sequence of subsets. The subsets are scheduled independently, in the order of the sequence. It is proved that a feasible schedule can be generated as long as one exists for the tasks. In addition, the overall scheduling cost is reduced to the sum of the scheduling costs of the tasks in each subset.
Simulation experiments were conducted to analyze the performance of decomposition scheduling approach. The results show that in many cases decomposition scheduling performs better than the traditional branch-and-bound algorithms in terms of scheduling cost, and heuristic algorithms in terms of percentage of finding feasible schedules over randomly-generated task sets.
Similar content being viewed by others
References
Baker, K.R. and Su, Z. 1974. Sequencing with Due-Date and Early Start Times to Minimize Maximum Tardiness.Naval Res. Log. Quart., 21:171–176.
Bratley, P., Florian, M., and Robillard, P. 1971. Scheduling with Earliest Start and Due Date Constraints.Naval Res. Log. Quart., 18:511–519.
Bratley, P., Florian, M., and Robillard, P. 1975. Scheduling with earliest start and due date constraints on multiple machines.Naval. Res. Log. Quart., 22:165–173.
Dertouzos, M. 1974. Control Robotics: the Procedural Control of Physical Processes.Proceedings of the IFIP Congress, pages 807–813.
Erschler, J., Fontan, G., Merce, C., and Roubellat, F. 1983. A New Dominance Concept in Schedulingn Jobs on a Single Machine with Ready Times and Due Dates.Operations Research, 31: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.
Jackson, J.R. 1955. Scheduling a production line to minimize maximum tardiness. Technical Report Management Science Res. Rep. 43, UCLA.
Jeffay, K., Stanat, D.F., and Martel, C.U. 1991. On Non-Preemptive Scheduling of Periodic and Sporadic Tasks.Proc. IEEE Real-Time Syst. Symp., pages 129–139.
Jensen, E.D., J.D. Northcutt, R.K.C., Shipman, S.E., Reynolds, F.D., Maynard, D.P., and Loepere, K.P. 1989. Alpha: An operating system for the mission-critical integration and operation of large, complex, distributed real-time systems—an overview.Proc. of Workshop on Operating Systems for Mission Critical Computing.
Larson, R.E. and Dessouky, M.I. 1978. Heuristic procedures for the single machine problem to minimize maximum lateness.AIIE Trans., 10:176–183.
Locke, C.D. 1986. Best-effort decision making for real-time scheduling. Carnegie-Mellon University, Ph.D. Dissertation.
Ma, P.R. 1984. A model to solve timing-critical application problems in distributed computing systems.IEEE Computer, 17:62–68.
McMahon, G. and Florian, M. 1975. On scheduling with ready times and due dates to minimize maximum lateness.Operations Research, 23:475–482.
Sorenson, P.G. 1974. A methodology for real-time system development. Ph.D. Dissertation, University of Toronto.
Xu, J. and Parnas, D.L. 1990. Scheduling processes with release times, deadlines, precedence, and exclusion relationsIEEE Trans.on Soft. Eng., SE-16:360–369.
Yuan, X. 1991. A Decomposition Approach to Real-Time Scheduling on a Single Resource. Ph.D. thesis, University of Maryland, College Park, MD 20742.
Zhao, W. and Ramamritham, K. 1987. Simple and Integrated Heuristic Algorithms for Scheduling Tasks with Time and Resource Constraints.Journal of Systems and Software, pages 195–205.
Zhao, W., Ramamritham, K., and Stankovic, J.A. 1987. Scheduling Tasks with Resource requirements in a Hard Real-Time System.IEEE Trans. on Soft. Eng., SE-13:564–577.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yuan, X.(., Saksena, M.C. & Agrawala, A.K. A decomposition approach to non-preemptive real-time scheduling. Real-Time Syst 6, 7–35 (1994). https://doi.org/10.1007/BF01245297
Issue Date:
DOI: https://doi.org/10.1007/BF01245297