Optimized composition of performance-aware parallel components
作者： C. Kessler , W. Löwe
DOI: 10.1002/CPE.1844
关键词:
摘要: We describe the principles of a novel framework for performance-aware composition sequential and explicitly parallel software components with implementation variants. Automatic results in table-driven that, each call component, looks up expected best variant, processor allocation schedule given current problem, group sizes. The dispatch tables are computed off-line at component deployment time by an interleaved dynamic programming algorithm from time-prediction meta-code provided supplier. Copyright © 2011 John Wiley & Sons, Ltd.
welf.se 参考文章(32)
Michael Voss, Marek Olszewski, Install-Time System for Automatic Generation of Optimized Parallel Sorting Algorithms. parallel and distributed processing techniques and applications. pp. 17- 23 ,(2004)
Michael J. Pazzani, Eamonn J. Keogh, Learning augmented Bayesian classifiers: A comparison of distribution-based and classification-based approaches. international conference on artificial intelligence and statistics. ,(1999)
Mikhail Chalabine, Christoph Kessler, Mattias Eriksson, Load Balancing of Irregular Parallel Divide-and-Conquer Algorithms in Group-SPMD Programming Environments arcs workshops. pp. 313- 322 ,(2006)
Christoph W. Kessler, Welf Löwe, A Framework for Performance-aware Composition of Explicitly Parallel Components parallel computing. pp. 227- 234 ,(2007)
Antonina Danylenko, Christoph Kessler, Welf Löwe, Comparing Machine Learning Approaches for Context-Aware Composition Software Composition. ,vol. 6708, pp. 18- 33 ,(2011) , 10.1007/978-3-642-22045-6_2
Jesper Andersson, Morgan Ericsson, Christoph Kessler, Welf Löwe, Profile-guided composition SC'08 Proceedings of the 7th international conference on Software composition. pp. 157- 164 ,(2008) , 10.1007/978-3-540-78789-1_12
R. Clint Whaley, Antoine Petitet, Jack J. Dongarra, New trends in high performance computing ieee international conference on high performance computing data and analytics. ,vol. 27, pp. 3- 35 ,(2001) , 10.1016/S0167-8191(00)00087-9
Gregory Mounie, Christophe Rapine, Dennis Trystram, Efficient approximation algorithms for scheduling malleable tasks acm symposium on parallel algorithms and architectures. pp. 23- 32 ,(1999) , 10.1145/305619.305622
Nathan Thomas, Gabriel Tanase, Olga Tkachyshyn, Jack Perdue, Nancy M Amato, Lawrence Rauchwerger, None, A framework for adaptive algorithm selection in STAPL Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '05. pp. 277- 288 ,(2005) , 10.1145/1065944.1065981
Jason Ansel, Cy Chan, Yee Lok Wong, Marek Olszewski, Qin Zhao, Alan Edelman, Saman Amarasinghe, PetaBricks Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation - PLDI '09. ,vol. 44, pp. 38- 49 ,(2009) , 10.1145/1542476.1542481