An upper bound of the throughput of multirate multiprocessor schedules.
Rainer SchoenenVojin ZivojnovicHeinrich MeyrPublished in: ICASSP (1997)
Keyphrases
- upper bound
- lower bound
- response time
- worst case
- scheduling problem
- scheduling algorithm
- filter bank
- highly parallel
- branch and bound
- error probability
- multiprocessor systems
- branch and bound algorithm
- database machines
- lower and upper bounds
- search algorithm
- subband
- neural network
- signal reconstruction
- low latency
- resource utilization
- single item
- distributed memory
- single processor
- allocation scheme
- special case
- channel capacity
- deadlock free