Abstract
In many real-time applications, the set of tasks in the system, as well as the characteristics of the tasks, change during system execution. Specifically, the system moves from one mode of execution to another as its mission progresses. A mode change is characterized by the deletion of some tasks, addition of new tasks, or changes in the parameters of certain tasks, for example, increasing the sampling rate to obtain a more accurate result. This paper discusses how mode changes can be accommodated within a given framework of priority driven real-time scheduling.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Goodenough, J. B., and L. Sha 1988. The Priority Ceiling Protocol: A Method for Minimizing the Blocking of High Priority Ada Tasks. The Proceedings of the 2nd ACM International Workshop on Real-Time Ada Issues.
Lehoczky, J. P. and L. Sha 1986. Performance of Real-Time Bus Scheduling Algorithms. ACM Performance Evaluation Review, Special Issue. 14, (1) (May).
Lehoczky, J. P., L. Sha, and J. Strosnider 1987. Enhancing Aperiodic Responsiveness in a Hard Real-Time Environment. IEEE Real-Time System Symposium.
Lehoczky, J. P., L. Sha, and Y. Ding 1987. The Rate Monotonic Scheduling Algorithm—Characterization and Average Case Behavior. Technical Report, Department of Statistics, Carnegie Mellon University.
Leinbaugh, D. W. 1980. Guaranteed Response Time in a Hard Real-Time Environment. IEEE Transactions on Software Engineering, (Jan).
Leung, J. Y. and M. L. Merrill 1980. A Note on Preemptive Scheduling of Periodic Real-Time Tasks. Information Processing Letters 11 (3) (Nov.): 115–118.
Liu, C. L. and J. W. Layland 1973. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. JACM 20 (1): 46–61.
Mok, A. K. 1983. Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment. Ph.D. thesis, Massachusetts Institute of Technology.
Rajkumar, R., L. Sha, and L. Lehoczky 1987. On Countering the Effect of Cycle Stealing in A Hard Real-Time Environment. IEEE Real-Time System Symposium.
Rajkumar, R., L. Sha, and J. P. Lehockzy 1988. Real-Time Synchronization Protocols for Multiprocessors. Proceedings of the IEEE Real-Time Systems Symposium.
Ramaritham, K. and J. A. Stankovic 1984. Dynamic Task Scheduling in Hard Real-Time Distributed Systems. IEEE Software (July).
Sha, L., J. P. Lohoczky, and R. Rajkumar 1986. Solutions for Some Practical Problems in Prioritized Preemptive Scheduling. IEEE Real-Time Systems Symposium.
Sha, L., R. Rajkumar, and J. P. Lehoczky 1987. Priority Inheritance Protocols: An Approach to Real-Time Synchronization. Technical Report, Department of Computer Science, Carnegie Mellon University (To appear in IEEE Transactions on Computers).
Sprunt, B., L. Sha, and J. P. Lehoczky 1989. Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System. Real-Time Systems 1 (1) (June).
Zhao, W., K. Ramamritham, and J. Stankovic 1987. Preemptive Scheduling Under Time and Resource Constraints. IEEE Transactions on Computers, (Aug).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sha, L., Rajkumar, R., Lehoczky, J. et al. Mode change protocols for priority-driven preemptive scheduling. The Journal of Real-Time Systems 1, 243–264 (1989). https://doi.org/10.1007/BF00365439
Issue Date:
DOI: https://doi.org/10.1007/BF00365439