The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%.

Björn Andersson

Published in: J. Embed. Comput. (2011)

Keyphrases

priority queue
lower bound
upper bound
scheduling problem
database
data structure
processing times
preemptive scheduling
special case
high priority
error bounds
priority scheduling
higher priority
inductive inference
single machine
model selection
evolutionary algorithm
databases