A note on preemptive scheduling of periodic, real-time tasks
From MaRDI portal
Publication:1152707
DOI10.1016/0020-0190(80)90123-4zbMath0461.68043OpenAlexW2034751786MaRDI QIDQ1152707
M. L. Merrill, Joseph Y.-T. Leung
Publication date: 1980
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(80)90123-4
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (26)
Schedulers for larger classes of pinwheel instances ⋮ Minimal schedulability interval for real-time systems of periodic tasks with offsets ⋮ Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms ⋮ The partitioned dynamic-priority scheduling of sporadic task systems ⋮ Analysis of window-constrained execution time systems ⋮ A new algorithm for scheduling periodic, real-time tasks ⋮ Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems ⋮ An efficient implementation of a VNS heuristic for the weighted fair sequences problem ⋮ A constant-approximate feasibility test for multiprocessor real-time scheduling ⋮ Scheduling periodically occurring tasks on multiple processors ⋮ State-based scheduling with tree schedules: analysis and evaluation ⋮ Scheduling hard sporadic tasks with regular languages and generating functions. ⋮ A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling ⋮ Graph-based models for real-time workload: a survey ⋮ WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model ⋮ Pinwheel scheduling with two distinct numbers ⋮ Feasibility problems for recurring tasks on one processor ⋮ Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling ⋮ Unnamed Item ⋮ Rate-monotonic scheduling for hard-real-time systems ⋮ Investigating the usability of real-time scheduling theory with the Cheddar project ⋮ On a periodic maintenance problem ⋮ On priority assignment in fixed priority scheduling ⋮ A polynomial feasibility test for preemptive periodic scheduling of unrelated processors ⋮ Combined task- and network-level scheduling for distributed time-triggered systems ⋮ Cache related pre-emption delays in hierarchical scheduling
Cites Work
This page was built for publication: A note on preemptive scheduling of periodic, real-time tasks
