A note on preemptive scheduling of periodic, real-time tasks

DOI10.1016/0020-0190(80)90123-4zbMATH Open0461.68043OpenAlexW2034751786MaRDI QIDQ1152707FDOQ1152707

Authors: Joseph Y.-T. Leung, M. L. Merrill 

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

zbMATH Keywords

NP-completenessfeasibility testoptimal scheduling algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Title not available (Why is that?)

Cited In (26)

• Cache related pre-emption delays in hierarchical scheduling
• Combined task- and network-level scheduling for distributed time-triggered systems
• An efficient implementation of a VNS heuristic for the weighted fair sequences problem
• A constant-approximate feasibility test for multiprocessor real-time scheduling
• Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
• Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms
• Analysis of window-constrained execution time systems
• Scheduling hard sporadic tasks with regular languages and generating functions.
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
• State-based scheduling with tree schedules: analysis and evaluation
• On priority assignment in fixed priority scheduling
• Scheduling periodically occurring tasks on multiple processors
• The partitioned dynamic-priority scheduling of sporadic task systems
• Rate-monotonic scheduling for hard-real-time systems
• Feasibility problems for recurring tasks on one processor
• A new algorithm for scheduling periodic, real-time tasks
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
• Investigating the usability of real-time scheduling theory with the Cheddar project
• Pinwheel scheduling with two distinct numbers
• 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
• Schedulers for larger classes of pinwheel instances
• Minimal schedulability interval for real-time systems of periodic tasks with offsets
• Title not available (Why is that?)
• On a periodic maintenance problem

This page was built for publication: A note on preemptive scheduling of periodic, real-time tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152707)