Active harmony: towards automated performance tuning
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Parallel Parameter Tuning for Applications with Performance Variability
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
The Journal of Supercomputing
Modeling master/worker applications for automatic performance tuning
Parallel Computing - Algorithmic skeletons
Design and implementation of a dynamic tuning environment
Journal of Parallel and Distributed Computing
Knowledge engineering for automatic parallel performance diagnosis: Research Articles
Concurrency and Computation: Practice & Experience - European–American Working Group on Automatic Performance Analysis (APART)
Software engineering for multicore systems: an experience report
Proceedings of the 1st international workshop on Multicore software engineering
Patterns for parallel programming
Patterns for parallel programming
Analytic models and empirical search: a hybrid approach to code optimization
LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing
International workshop on multicore software engineering (IWMSE 2009)
ICSE '09 COMPANION Proceedings of the 2009 31st International Conference on Software Engineering: Companion Volume
Engineering parallel applications with tunable architectures
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Predicting multi-core performance: a case study using Solaris containers
Proceedings of the 3rd International Workshop on Multicore Software Engineering
A language-based tuning mechanism for task and pipeline parallelism
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Hi-index | 0.00 |
Auto-tuning is indispensable to achieve best performance of parallel applications, as manual tuning is extremely labor intensive and error-prone. Search-based auto-tuners offer a systematic way to find performance optimums, and existing approaches provide promising results. However, they suffer from large search spaces.