Managing Varying Worst Case Execution Times on DVS Platforms
Vandy BertenChi-Ju ChangTei-Wei KuoPublished in: CoRR (2008)
Keyphrases
- execution times
- worst case
- average case
- np hard
- error bounds
- upper bound
- energy consumption
- communication delays
- lower bound
- greedy algorithm
- scheduling algorithm
- running times
- varying degrees
- sample size
- worst case analysis
- space complexity
- messaging service
- database
- approximation algorithms
- computational complexity
- decision trees
- databases