Optimizing Nonzero-Based Sparse Matrix Partitioning Models via Reducing Latency

Journal of Parallel and Distributed Computing - United States
doi 10.1016/j.jpdc.2018.08.005
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Reducing Latency Cost in 2D Sparse Matrix Partitioning Models

Parallel Computing
Computer GraphicsComputer NetworksHardwareCommunicationsComputer-Aided DesignArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
2016English

Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Partitioning and Communication Strategies for Sparse Non-Negative Matrix Factorization

2018English

Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix

SIAM Journal on Matrix Analysis and Applications
Analysis
2006English

Preprocessing Sparse Semidefinite Programs via Matrix Completion

Optimization Methods and Software
ControlApplied MathematicsOptimizationSoftware
2006English

Reducing the Bandwidth of a Sparse Matrix With Tabu Search

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2001English

Perfomance Models for Blocked Sparse Matrix-Vector Multiplication Kernels

2009English

Two Nonzero Component Lemma and Matrix Trigonometry

Advances in Linear Algebra & Matrix Theory
2017English

A Staggered Eigensolver Based on Sparse Matrix Bidiagonalization

EPJ Web of Conferences
AstronomyPhysics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy