Pipelined Processors and Worst Case Execution Times.
N. ZhangAlan BurnsMark NicholsonPublished in: Real Time Syst. (1993)
Keyphrases
- execution times
- worst case
- communication delays
- parallel architecture
- upper bound
- average case
- parallel algorithm
- lower bound
- np hard
- error bounds
- parallel processing
- approximation algorithms
- greedy algorithm
- space complexity
- data flow
- worst case scenario
- single processor
- data sets
- parallel processors
- parallel computing
- general purpose
- parallel architectures
- linear array
- special case
- learning algorithm