The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Scheduling algorithms and operating systems support for real-time systems
Abstract
This paper summarizes the state of the real-time field in the areas of scheduling and operating system kernels. Given the vast amount of work that has been done by both the operations research and computer science communities in the scheduling area, we discuss four paradigms underlying the scheduling approaches and present several exemplars of each. The four paradigms are: static table-driven scheduling, static priority preemptive scheduling, dynamic planning-based scheduling, and dynamic best effort scheduling. In the operating system context, we argue that most of the proprietary commercial kernels as well as real-time extensions to time-sharing operating system kernels do not fit the needs of predictable realtime systems. We discuss several research kernels that are currently being built to explicitly meet the needs of real-time applications.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Bounds on Multiprocessing Timing Anomalies
Graham, R. L. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117039 · Cited by 2,443
Priority inheritance protocols: an approach to real-time synchronization
Sha, L., Rajkumar, R., & Lehoczky, J. P. (1990) · IEEE Transactions on Computers · doi:10.1109/12.57058 · Cited by 2,244
Complexity of Machine Scheduling Problems
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70743-x · Cited by 2,197
The rate monotonic scheduling algorithm: exact characterization and average case behavior
Lehoczky, J. P., Sha, L., & Ding, Y. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1989.63567 · Cited by 1,477
(1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90373-1 · Cited by 1,324
Misconceptions about real-time computing: a serious problem for next-generation systems
Stankovic, J. A. (1988) · Computer · doi:10.1109/2.7053 · Cited by 965
Self-citationAperiodic task scheduling for Hard-Real-Time systems
Sprunt, B., Sha, L., & Lehoczky, J. P. (1989) · Real-Time Systems · doi:10.1007/bf02341920 · Cited by 910
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Mok, A. K. (1983) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 852
Stack-based scheduling of realtime processes
Baker, T. P. (1991) · Real-Time Systems · doi:10.1007/bf00365393 · Cited by 817
Mathematical Programming The State of the Art
Bachem, A., Grötschel, M., & Korte, B. H. (1983) · Springer eBooks · doi:10.1007/978-3-642-68874-4 · Cited by 728
Algorithms for scheduling imprecise computations
Liu, J. W. S., Lin, K.-Y., Shih, W.-K., Yu, A., Chung, J.-Y., & Zhao, W. (1991) · Computer · doi:10.1109/2.76287 · Cited by 524
Complexity Results for Multiprocessor Scheduling under Resource Constraints
Garey, M. R., & Johnson, D. S. (1975) · SIAM Journal on Computing · doi:10.1137/0204035 · Cited by 493
Some Results of the Earliest Deadline Scheduling Algorithm
Chetto, H., & Chetto, M. (1989) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1989.559777 · Cited by 438
Multiprocessor online scheduling of hard-real-time tasks
Dertouzos, M. L., & Mok, A. K. (1989) · IEEE Transactions on Software Engineering · doi:10.1109/32.58762 · Cited by 437
Real-time synchronization protocols for multiprocessors
Rajkumar, R., Sha, L., & Lehoczky, J. P. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1988.51121 · Cited by 403
Scheduling processes with release times, deadlines, precedence and exclusion relations
Xu, J., & Parnas, D. L. (1990) · IEEE Transactions on Software Engineering · doi:10.1109/32.48943 · Cited by 347
Distributed scheduling of tasks with deadlines and resource requirements
Ramamritham, K., Stankovic, J. A., & Zhao, W. (1989) · IEEE Transactions on Computers · doi:10.1109/12.30866 · Cited by 316
Self-citationLocke, C. D. (1992) · Real-Time Systems · doi:10.1007/bf00365463 · Cited by 274
(2020) · Springer eBooks · doi:10.1007/978-3-319-78262-1_300273 · Cited by 253
Dynamic Task Scheduling in Hard Real-Time Distributed systems
Ramamritham, K., & Stankovic, J. A. (1984) · IEEE Software · doi:10.1109/ms.1984.234713 · Cited by 246
Self-citationGeneralized rate-monotonic scheduling theory: a framework for developing real-time systems
Sha, L., Rajkumar, R., & Sathaye, S. S. (1994) · Proceedings of the IEEE · doi:10.1109/5.259427 · Cited by 240
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
Zhao, W., Ramamritham, K., & Stankovic, J. A. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.233201 · Cited by 225
Self-citationReal-Time Mach: Towards a Predictable Real-Time System.
Tokuda, H., Nakajima, T., & Rao, P. (1990) · Cited by 186
Mode change protocols for priority-driven preemptive scheduling
Sha, L., Rajkumar, R., Lehoczky, J. P., & Ramamritham, K. (1989) · Real-Time Systems · doi:10.1007/bf00365439 · Cited by 186
Self-citationAllocation and scheduling of complex periodic tasks
Ramamritham, K. (2002) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1990.89256 · Cited by 176
Self-citationARTS: a distributed real-time kernel
Tokuda, H., & Mercer, C. W. (1989) · ACM SIGOPS Operating Systems Review · doi:10.1145/71021.71023 · Cited by 175
Guaranteed Response Times in a Hard-Real-Time Environment
Leinbaugh, D. W. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.234465 · Cited by 151
The integration of deadline and criticalness in hard real-time scheduling
Biyabani, S. R., Stankovic, J. A., & Ramamritham, K. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1988.51111 · Cited by 119
Self-citationOn-line scheduling of real-time tasks
Hong, K. S., & Leung, J. Y. ‐. (1992) · IEEE Transactions on Computers · doi:10.1109/12.166609 · Cited by 111
Task allocation in fault-tolerant distributed systems
Bannister, J. A., & Trivedi, K. S. (1983) · Acta Informatica · doi:10.1007/bf01257086 · Cited by 109
Production and Stabilization of Real-Time Task Schedules
Manacher, G. K. (1967) · Journal of the ACM · doi:10.1145/321406.321408 · Cited by 90
Static allocation of periodic tasks with precedence constraints in distributed real-time systems
Peng, D.-T., & Shin, K. G. (2003) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.1989.37947 · Cited by 79
On-line scheduling of real-time tasks
Hong, K. S., & Leung, J. Y. ‐. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1988.51119 · Cited by 46
Cited by
Operator Scheduling in a Data Stream Manager
Carney, D., Çetintemel, U., Rasin, A., Zdonik, S., Cherniack, M., & Stonebraker, M. (2003) · Proceedings 2003 VLDB Conference · doi:10.1016/b978-012722442-8/50079-3 · Cited by 254
Dynamic Time Quantum Priority Based Round Robin for Load Balancing In Cloud Environment
Ghosh, S., & Banerjee, C. (2018) · 2018 Fourth International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) · doi:10.1109/icrcicn.2018.8718694 · Cited by 21
Metadata
- Authors
- Ramamritham, K., & Stankovic, J. A.
- Venue
- Proceedings of the IEEE
- Published
- 1994
- Volume
- 82
- Issue
- 1
- Pages
- 55-67
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2131069932
- Cited by
- 428
- References
- 36
- FWCI
- 10.81
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.