Article

Adaptive paging for a multifrontal solver

Authors:

Olivier Cozette,

Abdou Guermouche,

Gil UtardAuthors Info & Claims

ICS '04: Proceedings of the 18th annual international conference on Supercomputing

Pages 267 - 276

https://doi.org/10.1145/1006209.1006247

Published: 26 June 2004 Publication History

Abstract

In this paper, we present a new way to improve performance of the factorization of large sparse linear systems which cannot fit in memory. Instead of rewriting a large part of the code to implement an out-of-core algorithm with explicit I/O, we modify the paging mechanisms in such a way that I/O are transparent. This approach will be helpful to study the key points for getting performance with large problems on under sized memory machines with an explicit out-of-core scheme. The modification is done thanks to the MMUM&MMUSSEL software tool which allows the management of the paging activity at the application level. We designed a first paging polic that is well adapted for the parallel multifrontal solver MUMPS We present here a study and we give our preliminary results.

References

[1]

R. D. B. Alan Dearle, A. Lindström, J. Rosenberg, and F. Vaughan. User-level management of persistent data in the grasshopper operating system. Technical report, University of Sidney, 1994.

[2]

P. R. Amestoy and I. S. Duff. Memory management issues in sparse multifrontal methods on multiprocessors. Int. J. of Supercomputer Applics., 7:64--82, 1993.

Digital Library

[3]

C. Ashcraft, R. G. Grimes, J. G. Lewis, B. W. Peyton, and H. D. Simon. Progress in sparse matrix methods for large linear systems on vector computers. Int. Journal of Supercomputer Applications, 1(4):10--30, 1987.

Digital Library

[4]

A. D. Brown, T. C. Mowry, and O. Krieger. Compiler-based I/O prefetching for out-of-core applications. ACM Transactions on Computer Systems, 19(2):111--170, 2001.

Digital Library

[5]

E. Caron, O. Cozette, D. Lazure, and G. Utard. Virtual memory management in data parallel applications. In HPCN'99, High Performance Computing and Networking Europe -- Workshop on High Performance Computation on Very Large Data Sets, volume 1593 of LNCS. Springer, 11-13 April 1999.

Digital Library

[6]

E. Caron and G. Utard. On the performance of parallel factorization of out-of-core matrices. Parallel Computing, 30(3):357--375, 2004.

Digital Library

[7]

I. S. Duff, R. G. Grimes, and J. G. Lewis. The Rutherford-Boeing Sparse Matrix Collection. Technical Report TR/PA/97/36, CERFACS, Toulouse, France, 1997. Also Technical Report RAL-TR-97-031 from Rutherford Appleton Laboratory and Technical Report ISSTECH-97-017 from Boeing Information & Support Services.

[8]

I. S. Duff and J. K. Reid. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Transactions on Mathematical Software, 9:302--325, 1983.

Digital Library

[9]

I. S. Duff and J. K. Reid. The multifrontal solution of unsymmetric sets of linear systems. SIAM Journal on Scientific and Statistical Computing, 5:633--641, 1984.

Digital Library

[10]

G. W. Glass. Adaptative page replacement. Master's thesis, University of Wisconsin - Madison, 1998.

[11]

A. Guermouche and J.-Y. L'Excellent. Memory-based scheduling for a parallel multifrontal solver. In 18th International Parallel and Distributed Processing Symposium (IPDPS'04), 2004. To appear.

[12]

A. Guermouche, J.-Y. L'Excellent, and G. Utard. Impact of reordering on the memory of a multifrontal solver. Parallel Computing, 29(9):1191--1218, 2003.

Digital Library

[13]

G. Heiser. Implementation and performance of the mungi single-address-space operating system. Technical report, University of New South Wales CSE, 1997.

[14]

G. Karypis and V. Kumar. MeTiS -- A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices -- Version 4.0. University of Minnesota, Sept. 1998.

[15]

K. Krueger, D. L. A. Vahdat, and T. Anderson. Tools for the development of application-specific virtual memory management. Technical report, University of California, Berkeley, 1993.

Digital Library

[16]

J. W. H. Liu. The multifrontal method and paging in sparse Cholesky factorization. ACM Transactions on Mathematical Software, 15:310--325, 1989.

Digital Library

[17]

J. W. H. Liu. The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications, 11:134--172, 1990.

Digital Library

[18]

E. Rothberg and R. Schreiber. Efficient methods for out-of-core sparse cholesky factorization. SIAM Journal on Scientific Computing, 21(1):129--144, 1999.

Digital Library

Cited By

Thibault SDeegan TScott SVallée G(2008)Improving performance by embedding HPC applications in lightweight Xen domainsProceedings of the 2nd workshop on System-level virtualization for high performance computing10.1145/1435452.1435454(9-15)Online publication date: 31-Mar-2008
https://dl.acm.org/doi/10.1145/1435452.1435454
Zhou WLowenthal D(2006)A Parallel, Out-of-Core Algorithm for RNA Secondary Structure PredictionProceedings of the 2006 International Conference on Parallel Processing10.1109/ICPP.2006.10(74-81)Online publication date: 14-Aug-2006
https://dl.acm.org/doi/10.1109/ICPP.2006.10
Agullo EGuermouche AL'Excellent J(2006)A preliminary out-of-core extension of a parallel multifrontal solverProceedings of the 12th international conference on Parallel Processing10.1007/11823285_111(1053-1063)Online publication date: 28-Aug-2006
https://dl.acm.org/doi/10.1007/11823285_111

Index Terms

Adaptive paging for a multifrontal solver

Recommendations

A column pre-ordering strategy for the unsymmetric-pattern multifrontal method

A new method for sparse LU factorization is presented that combines a column pre-ordering strategy with a right-looking unsymmetric-pattern multifrontal numerical factorization. The column ordering is selected to give a good a priori upper bound on fill-...
A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure

We present a structured parallel geometry-based multifrontal sparse solver using hierarchically semiseparable (HSS) representations and exploiting the inherent low-rank structures. Parallel strategies for nested dissection ordering (taking low rankness ...
On the Memory Usage of a Parallel Multifrontal Solver
IPDPS '03: Proceedings of the 17th International Symposium on Parallel and Distributed Processing

Abstract. Memory usage is crucial for sparse direct solvers and particularly for the parallel multifrontal scheme. The active memory size depends on the assembly tree associated to the factorization process and on the distribution of the computation; it ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '04: Proceedings of the 18th annual international conference on Supercomputing

June 2004

360 pages

ISBN:1581138393

DOI:10.1145/1006209

General Chair:
Paul Feautrier
LIP, ENS Lyon
,
Program Chairs:
James Goodman
University of Auckland
,
André Seznec
IRISA, INRIA

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ICS04

Sponsor:

ICS04: International Conference on Supercomputing 2004

June 26 - July 1, 2004

Malo, France

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
313
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Thibault SDeegan TScott SVallée G(2008)Improving performance by embedding HPC applications in lightweight Xen domainsProceedings of the 2nd workshop on System-level virtualization for high performance computing10.1145/1435452.1435454(9-15)Online publication date: 31-Mar-2008
https://dl.acm.org/doi/10.1145/1435452.1435454
Zhou WLowenthal D(2006)A Parallel, Out-of-Core Algorithm for RNA Secondary Structure PredictionProceedings of the 2006 International Conference on Parallel Processing10.1109/ICPP.2006.10(74-81)Online publication date: 14-Aug-2006
https://dl.acm.org/doi/10.1109/ICPP.2006.10
Agullo EGuermouche AL'Excellent J(2006)A preliminary out-of-core extension of a parallel multifrontal solverProceedings of the 12th international conference on Parallel Processing10.1007/11823285_111(1053-1063)Online publication date: 28-Aug-2006
https://dl.acm.org/doi/10.1007/11823285_111

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten