Login / Signup
Characterization of the Space of Feasible Worst-Case Execution Times for Earliest-Deadline-First Scheduling.
Laurent George
Jean-François Hermant
Published in:
J. Aerosp. Comput. Inf. Commun. (2009)
Keyphrases
</>
execution times
scheduling algorithm
worst case
communication delays
lower bound
scheduling problem
np hard
average case
computational complexity
greedy algorithm
linear programming
upper bound
search algorithm
vector space
feasible solution
resource allocation
space time
dynamic scheduling