Abstract
In this paper we discuss the deployment of large scale numerical applications on a Grid. Currently, Grid deployments have coarse-grained and massively parallel nature and are suited for applications that are not communication intensive. For our numerical applications, we minimize the communication needs by a good choice of data placement, in particular by using persistent storage of data. We also introduce out-of-core programming for the task farming paradigm in order to achieve interesting degree of scalability. We discuss the performances of the bisection method to compute the eigenpair of a real symmetric tridiagonal matrix and a block-based matrix-vector product. As experimental middleware we use the XtremWeb system in different configurations; a local one and a WAN based platform with heterogeneous resources distributed on two geographic sites: the university of Lille I and Paris-XI university in Orsay.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aouad, L., Petiton, S.: Experimentations and Programming Paradigm For Matrix Computing on Peer to Peer Grid. In: GRID 2004, fifth international workshop on Grid Computing, Pittsburgh (2004)
Cappello, F., Djilali, S., Fedak, G., Herault, T., Magniette, F., Néri, V., Lodygensky, O.: Computing on Large Scale Distributed Systems: XtremWeb Architecture, Programming Models, Security, Tests and Convergence with Grid. In: FGCS (Future Generation Computer Science) (2004)
Demmel, J., Dhillon, I., Ren, H.: On the correctness of parallel bisection in floating point. UCB/CSD 94/805, Berkeley, CA, USA (1994)
Petiton, S., Aouad, L.: Large scale peer to peer performance evaluations, with Gauss-Jordan method as an example. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 938–945. Springer, Heidelberg (2004)
Toledo, S.: A Survey of Out-Of-Core Algorithms in Numerical Linear Algebra. In: Abello, J.M., Vitter, J.S. (eds.) External Memory Algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 161–179. American Mathematical Society, Providence (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petiton, S.G., Aouad, L.M., Choy, L. (2006). Peer to Peer Large Scale Linear Algebra Programming and Experimentations. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2005. Lecture Notes in Computer Science, vol 3743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11666806_49
Download citation
DOI: https://doi.org/10.1007/11666806_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31994-8
Online ISBN: 978-3-540-31995-5
eBook Packages: Computer ScienceComputer Science (R0)