Simple algorithms for multiprocessor scheduling to meet deadlines
From MaRDI portal
Publication:1248336
DOI10.1016/0020-0190(77)90015-1zbMath0381.68038OpenAlexW2030829902MaRDI QIDQ1248336
Publication date: 1977
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(77)90015-1
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items
Solving the resource constrained deadline scheduling problem via reduction to the network flow problem, Deadline scheduling of tasks with ready times and resource constraints, Algorithms for minimizing maximum lateness with unit length tasks and resource constraints, Scheduling unit-time tasks with integer release times and deadlines
Cites Work
- Unnamed Item
- Minimizing maximum lateness on one machine: computational experience and some applications
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- On a Real-Time Scheduling Problem
- Sequencing with due-dates and early start times to minimize maximum tardiness
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
