Skip to main content
Conference ProceedingsOPEN ACCESS

A mapping and scheduling algorithm for parallel sparse fan-in numerical factorization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1685 LNCS 1059-1067
DOI: 10.1007/3-540-48311-x_148
14Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present and analyze a general algorithm which computes efficient static schedulings of block computations for parallel sparse linear factorization. Our solver, based on a supernodal fan-in approach, is fully driven by this scheduling. We give an overview of the algorithms and present performance results on a 16-node IBM-SP2 with 66 MHz Power2 thin nodes for a collection of grid and irregular problems. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Hénon, P., Ramet, P., & Roman, J. (1999). A mapping and scheduling algorithm for parallel sparse fan-in numerical factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 1059–1067). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_148

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