Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
From MaRDI portal
Publication:5681520
DOI10.1145/321738.321743zbMath0265.68013WikidataQ55879022 ScholiaQ55879022MaRDI QIDQ5681520
No author found.
Publication date: 1973
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321738.321743
Related Items
Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems, Feasibility problems for recurring tasks on one processor, On the complexity of generalized due date scheduling problems, Load adaptive dynamic scheduling of tasks with hard deadlines useful for industrial applications, On optimal lateness and tardiness scheduling in real-time systems, Pinwheel scheduling with two distinct numbers, On the competitiveness of on-line real-time task scheduling, An algorithm for coalescing operations with precedence constraints in real-time systems, Real time task scheduling allowing fuzzy due dates, Rate-monotonic scheduling for hard-real-time systems, Rate monotonic scheduling in hard real-time systems, Conventional and early token release scheduling models for the IEEE 802.5 token ring, Periodic assignment and graph colouring, Choosing task periods to minimise system utilisation in time triggered systems, LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems, Proportionate progress: A notion of fairness in resource allocation, Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems, Schedulers for larger classes of pinwheel instances
