Optimal rate-based scheduling on multiprocessors
From MaRDI portal
Publication:5901053
DOI10.1145/509907.509938zbMath1192.68109OpenAlexW2069733180MaRDI QIDQ5901053
Anand Srinivasan, James H. Anderson
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509938
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (9)
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks ⋮ Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling ⋮ An optimal boundary fair scheduling ⋮ An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems ⋮ Tardiness bounds under global EDF scheduling on a multiprocessor ⋮ A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm ⋮ Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible ⋮ Optimal rate-based scheduling on multiprocessors ⋮ Architecture aware semi partitioned real-time scheduling on multicore platforms
This page was built for publication: Optimal rate-based scheduling on multiprocessors
