We address the challenging problem of algorithm design for the Grid by providing the application user with a set of high-level, parameterized components called skeletons. We describe a Java-based Grid programming system in which algorithms are composed of skeletons. The advantage of our approach is that skeletons are reusable for different applications and that skeletons’ implementations can be tuned to particular machines of the Grid with quite well-predictable performance.
CITATION STYLE
Alt, M., Bischof, H., & Gorlatch, S. (2002). Algorithm design and performance prediction in a java-based grid system with skeletons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2400, pp. 899–906). Springer Verlag. https://doi.org/10.1007/3-540-45706-2_127
Mendeley helps you to discover research relevant for your work.