Amanote Research

Amanote Research

    RegisterSign In

A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors

SIAM Journal of Scientific Computing - United States
doi 10.1137/0914048
Full Text
Open PDF
Abstract

Available in full text

Categories
Computational MathematicsApplied Mathematics
Date

July 1, 1993

Authors
Esmond NgBarry W. Peyton
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

An Algorithm-By-Blocks for SuperMatrix Band Cholesky Factorization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Cache Coherence Protocols in Shared-Memory Multiprocessors

2015English

Linear and Extended Linear Transformations for Shared-Memory Multiprocessors

Computer Journal
Computer Science
1997English

Paging Tradeoffs in Distributed-Shared-Memory Multiprocessors

English

Architectural Support for Scalable Speculative Parallelization in Shared-Memory Multiprocessors

2000English

Improved Rigorous Multiplicative Perturbation Bounds for the Generalized Cholesky Factorization and the Cholesky-Like Factorization

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2019English

An Efficient Cache Design for Scalable Glueless Shared-Memory Multiprocessors

2006English

Locality-Information-Based Scheduling in Shared-Memory Multiprocessors

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Rsim: Simulating Shared-Memory Multiprocessors With ILP Processors

Computer
Computer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy