A polynomial feasibility test for preemptive periodic scheduling of unrelated processors.
Alan A. BertossiMaurizio A. BonuccelliPublished in: Discret. Appl. Math. (1985)
Keyphrases
- scheduling problem
- scheduling algorithm
- list scheduling
- parallel processing
- lower bound
- multiprocessor systems
- parallel processors
- parallel machines
- parallel algorithm
- response time
- test data
- neural network
- single machine
- test cases
- np hard
- special case
- parallel computing
- resource allocation
- round robin
- load balancing
- priority queue
- communication delays