Calculating Worst-Case Response Time Bounds for OpenMP Programs with Loop Structures.
Jinghao SunNan GuanZhishan GuoYekai XueJing HeGuozhen TanPublished in: RTSS (2021)
Keyphrases
- response time
- worst case
- upper bound
- lower bound
- average case
- additive error
- error bounds
- greedy algorithm
- approximation algorithms
- scheduling algorithm
- loss bounds
- computational complexity
- prefetching
- np hard
- worst case analysis
- query execution
- vc dimension
- space complexity
- network latency
- multi core processors
- theoretical guarantees
- upper and lower bounds
- lower and upper bounds
- shared memory
- objective function
- parallel algorithm
- worst case bounds