Abstract
This work presents a new approach to the relation between theoretical complexity and performance analysis of MPI programs. The performance analysis is driven by the information produced during the complexity analysis stage and supported at the top level by a complexity analysis oriented language and at the bottom level by a special purpose statistical package. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
García, L., González, J. A., González, J. C., León, C., Rodríguez, C., & Rodríguez, G. (2003). Complexity driven performance analysis. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2840, 55–62. https://doi.org/10.1007/978-3-540-39924-7_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
