We describe a general component software framework designed for demanding grid environments that provides optimal performance for the assembled component application. This is achieved by separating the high level abstract description of the composition from the low level implementations. These implementations are chosen at run time by performance analysis of the composed application on the currently available resources. We show through the solution of a simple linear algebra problem that the framework introduces minimal overheads while always selecting the most effective implementation.
CITATION STYLE
Furmento, N., Mayer, A., McGough, S., Newhouse, S., & Darlington, J. (2001). A component framework for HPC applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2150, pp. 540–548). Springer Verlag. https://doi.org/10.1007/3-540-44681-8_78
Mendeley helps you to discover research relevant for your work.