Evaluating execution time predictability of task-based programs on multi-core processors
Document typeConference report
Rights accessRestricted access - publisher's policy
European Commisision's projectROMOL - Riding on Moore's Law (EC-FP7-321253)
Task-based programming models are becoming increasingly important, as they can reduce the synchronization costs of parallel programs on multi-cores. Instances of the same task type in task-based programs consist of the same code, which leads us to the hypothesis that their performance should be regular and thus their execution time should be predictable. We evaluate this hypothesis for a set of 12 taskbased programs on 4 different machines: a high-end Intel SandyBridge, an IBM POWER7, an ARM Cortex-A9 and an ARM Cortex-A15. We show, that predicting execution time assuming performance regularity can lead to errors of up to 92%. We identify and analyze three sources of execution time impredictability: input dependence, multiple behaviors per task type and resource sharing. We present two models based on linear interpolation and clustering, reducing the prediction error to less than 12% for input dependent task types and to less than 2% for task types with multiple classes of behavior. All in all, this work invalidates the assumption that performance is always regular across instances of the same task type and quantifies its variability on a wide range of benchmarks and multi-core systems.
CitationGrass, T. [et al.]. Evaluating execution time predictability of task-based programs on multi-core processors. A: International European Conference on Parallel and Distributed Computing. "Euro-Par 2014: Parallel Processing Workshops: Euro-Par 2014 International Workshops: Porto, Portugal: August 25-26, 2014: revised selected papers: part II". Porto: Springer, 2015, p. 218-229.
|Evaluating exec ... multi-core processors.pdf||Evaluating execution time predictability of task-based programs on multi-core processors||734,3Kb||Restricted access|