On the public citation graph
New Scheduling Strategies and Hybrid Programming for a Parallel Right-looking Sparse LU Factorization Algorithm on Multicore Cluster Systems
0 signed · 32 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11752578_127openalex-snapshot
On Using an Hybrid MPI-Thread Programming for the Implementation of a Parallel Sparse Direct Solver on a Network of SMP Nodes
inferredcites →https://doi.org/10.1007/978-3-540-75755-9_18openalex-snapshot
Implementing Linear Algebra Routines on Multi-core Processors with Pipelining and a Look Ahead
inferredcites →https://doi.org/10.1016/s0167-8191(01)00141-7openalex-snapshot
PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems
inferredcites →https://doi.org/10.1109/sc.2002.10032openalex-snapshot
A New Scheduling Algorithm for Parallel Sparse LU Factorization with Static Pivoting
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1137/050638102openalex-snapshot
Parallel Symbolic Factorization for Sparse LU with Static Pivoting
inferredcites →https://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferredcites →https://doi.org/10.1137/0613017openalex-snapshot
Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
inferredcites →https://doi.org/10.1137/090757216openalex-snapshot
Design of a Multicore Sparse Cholesky Factorization Using DAGs
inferredcites →https://doi.org/10.1137/s0895479887139455openalex-snapshot
Predicting Structure in Sparse Matrix Computations
inferredcites →https://doi.org/10.1137/s0895479895291765openalex-snapshot
A Supernodal Approach to Sparse Partial Pivoting
inferredcites →https://doi.org/10.1137/s0895479897317661openalex-snapshot
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
inferredcites →https://doi.org/10.1145/504210.504212openalex-snapshot
Analysis and comparison of two general sparse solvers for distributed memory computers
inferredcites →https://doi.org/10.1145/582034.582081openalex-snapshot
Solution of a three-body problem in quantum mechanics using sparse linear algebra on parallel computers
inferredcites →https://doi.org/10.1177/1094342010391989openalex-snapshot
The International Exascale Software Project roadmap
inferredcites →https://doi.org/10.2172/1063296openalex-snapshot
Community Petascale Project for Accelerator Science and Simulation
inferredcites →https://doi.org/10.5555/509058.509092openalex-snapshot
Making Sparse Gaussian Elimination Scalable by Static Pivoting
inferredcites →https://doi.org/10.5555/762761.762772openalex-snapshot
A New Scheduling Algorithm for Parallel Sparse LU Factorization with Static Pivoting
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_41openalex-snapshot
A Distributed CPU-GPU Sparse Direct Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-30256-0_1openalex-snapshot
Introduction to Scientific Computing
inferred← citeshttps://doi.org/10.1007/s11227-021-04270-wopenalex-snapshot
swSuperLU: A highly scalable sparse direct solver on Sunway manycore architecture
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.03.004openalex-snapshot
A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems
inferred← citeshttps://doi.org/10.1109/asp-dac58780.2024.10473846openalex-snapshot
Machine Learning and GPU Accelerated Sparse Linear Solvers for Transistor-Level Circuit Simulation: A Perspective Survey (Invited Paper)
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9378385openalex-snapshot
Improved Data Locality Using Morton-order Curve on the Example of LU Decomposition
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00100openalex-snapshot
A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices
inferred← citeshttps://doi.org/10.1145/3149457.3149472openalex-snapshot
A Left-Looking Selected Inversion Algorithm and Task Parallelism on Shared Memory Systems
inferred← citeshttps://doi.org/10.1145/3332466.3374533openalex-snapshot
A supernodal all-pairs shortest path algorithm
inferred← citeshttps://doi.org/10.1145/3577197openalex-snapshot
Newly Released Capabilities in the Distributed-Memory SuperLU Sparse Direct Solver
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0447openalex-snapshot
PSelInv -- A Distributed Memory Parallel Algorithm for Selected Inversion : the Symmetric Case
inferred← citeshttps://doi.org/10.48550/arxiv.2109.07563openalex-snapshot
Non-smooth Bayesian Optimization in Tuning Problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.