Metrics for grid applicability: A distributed elliptic curve platform assessment

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The distribution of computational load among several nodes is an important step for problems requiring High Performance Computing(HPC). This phase is critical because bad decisions could cost time and money. The emergence of heterogeneous networks with resources available for a wide group of users as provided by Grid Computing [3] creates the need for formal processes and metrics to evaluate if the application of the problem to the Grid is feasible. In this article we introduce some auxiliary indicators for measuring the potential applicability of a parallel application to a Grid. Using the measures defined in the internal draft (GWD-I) produced by the Network Measurement WG [6] from the Global Grid Forum and RFC 2330 [7], the authors present some aggregate metrics that are useful in the characterization of the parallel applications that are well adapted to existing grids. The defined auxiliary metrics were useful in the validation of a concrete application that factorizes numbers using the elliptic curves method (ECM) [5] over a testbed Grid. The results of the application of the metrics to this specific mathematical algorithm are presented.

Cite

CITATION STYLE

APA

Trezentos, P., & Oliveira, A. L. (2004). Metrics for grid applicability: A distributed elliptic curve platform assessment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3019, pp. 864–871). Springer Verlag. https://doi.org/10.1007/978-3-540-24669-5_112

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free