Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors

DOI10.1287/IJOC.9.4.363MaRDI QIDQ4376737zbMATH OpenOpenAlexFDO

Authors B. A. Kijowski, Udatta S. Palekar

Publication date 11 February 1998

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.9.4.363

zbMATH Keywords

periodically occurring taskspolynomial time solutionssystem of parallel processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Scheduling Periodic Tasks
• Scheduling preemptable tasks on parallel processors with limited availability
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Computing optimal preemptive schedules for parallel tasks: linear programming approaches
• Preemptive multiprocessor task scheduling with release times and time windows

Cited in

(8)

• Optimal scheduling of progressive processing tasks
• Optimizing resource speed for two-stage real-time tasks
• Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
• Asymptotically optimal parallel resource assignment with interference
• Scheduling periodic and aperiodic tasks with time, energy harvesting and precedence constraints on multi-core systems
• Optimal task assignment with precedence in distributed computing systems
• Optimal harmonic period assignment: complexity results and approximation algorithms
• The maximum gain of increasing the number of preemptions in multiprocessor scheduling

This page was built for publication: Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors

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