mirror of
https://github.com/ceres-solver/ceres-solver.git
synced 2026-08-30 00:50:37 +08:00
bdee4d6172
Instead of pre-computing pemutation from block-sparse to CRS order, index of value in CRS matrix is computed in the process of updating values using block-sparse structure. When it is possible to update values via a simple host-to-device copy, block-sparse structure on GPU is discarded after computing CRS structure. Computing index is significantly slower than using pre-computed permutation, but is still hidden by host-to-device transfer. On problems from BAL dataset this results into reduction of extra gpu memory consumption from 33% (permutation stored as 32-bit indices) to ~10% for storing block-sparse structure. Benchmark results: ======================= CUDA Device Properties ====================== Cuda version : 11.8 Device ID : 0 Device name : NVIDIA GeForce RTX 2080 Ti Total GPU memory : 11012 MiB GPU memory available : 10852 MiB Compute capability : 7.5 Warp size : 32 Max threads per block: 1024 Max threads per dim : 1024 1024 64 Max grid size : 2147483647 65535 65535 Multiprocessor count : 68 ==================================================================== Running ./bin/evaluation_benchmark Run on (112 X 3200 MHz CPU s) CPU Caches: L1 Data 32 KiB (x56) L1 Instruction 32 KiB (x56) L2 Unified 1024 KiB (x56) L3 Unified 39424 KiB (x2) Load Average: 24.58, 11.75, 8.52 ----------------------------------------------------------------------- Benchmark Time ----------------------------------------------------------------------- Using on-the-fly computation of CRS index corresponding to block-sparse index: JacobianToCRS<g/final/problem-4585-1324582-pre.txt> 1607 ms JacobianToCRSView<g/final/problem-4585-1324582-pre.txt> 564 ms JacobianToCRSMatrix<g/final/problem-4585-1324582-pre.txt> 2226 ms JacobianToCRSViewUpdate<g/final/problem-4585-1324582-pre.txt> 228 ms JacobianToCRSMatrixUpdate<g/final/problem-4585-1324582-pre.txt> 400 ms Using precomputed permutation: JacobianToCRS</final/problem-4585-1324582-pre.txt> 1656 ms JacobianToCRSView</final/problem-4585-1324582-pre.txt> 553 ms JacobianToCRSMatrix</final/problem-4585-1324582-pre.txt> 2255 ms JacobianToCRSViewUpdate</final/problem-4585-1324582-pre.txt> 228 ms JacobianToCRSMatrixUpdate</final/problem-4585-1324582-pre.txt> 406 ms Performance of JacobianToCRSViewUpdate is still limited by host-to-device transfer, and JacobianToCRSView is faster than computing CRS structure on CPU. Change-Id: Ifb6910fb01ae6071400d36c277846fadc5857964
133 lines
4.9 KiB
C++
133 lines
4.9 KiB
C++
// Ceres Solver - A fast non-linear least squares minimizer
|
|
// Copyright 2022 Google Inc. All rights reserved.
|
|
// http://ceres-solver.org/
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright notice,
|
|
// this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above copyright notice,
|
|
// this list of conditions and the following disclaimer in the documentation
|
|
// and/or other materials provided with the distribution.
|
|
// * Neither the name of Google Inc. nor the names of its contributors may be
|
|
// used to endorse or promote products derived from this software without
|
|
// specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
// POSSIBILITY OF SUCH DAMAGE.
|
|
//
|
|
// Author: joydeepb@cs.utexas.edu (Joydeep Biswas)
|
|
//
|
|
// A CUDA sparse matrix linear operator.
|
|
|
|
#ifndef CERES_INTERNAL_CUDA_SPARSE_MATRIX_H_
|
|
#define CERES_INTERNAL_CUDA_SPARSE_MATRIX_H_
|
|
|
|
// This include must come before any #ifndef check on Ceres compile options.
|
|
// clang-format off
|
|
#include "ceres/internal/config.h"
|
|
// clang-format on
|
|
|
|
#include <cstdint>
|
|
#include <memory>
|
|
#include <string>
|
|
|
|
#include "ceres/compressed_row_sparse_matrix.h"
|
|
#include "ceres/context_impl.h"
|
|
#include "ceres/internal/export.h"
|
|
#include "ceres/types.h"
|
|
|
|
#ifndef CERES_NO_CUDA
|
|
#include "ceres/cuda_buffer.h"
|
|
#include "ceres/cuda_vector.h"
|
|
#include "cusparse.h"
|
|
|
|
namespace ceres::internal {
|
|
|
|
// A sparse matrix hosted on the GPU in compressed row sparse format, with
|
|
// CUDA-accelerated operations.
|
|
class CERES_NO_EXPORT CudaSparseMatrix {
|
|
public:
|
|
// Create a GPU copy of the matrix provided. The caller must ensure that
|
|
// InitCuda() has already been successfully called on context before calling
|
|
// this constructor.
|
|
CudaSparseMatrix(ContextImpl* context,
|
|
const CompressedRowSparseMatrix& crs_matrix);
|
|
|
|
// Creates a "blank" matrix with an appropriate amount of memory allocated.
|
|
// The object itself is left in an inconsistent state.
|
|
CudaSparseMatrix(int num_rows,
|
|
int num_cols,
|
|
int num_nonzeros,
|
|
ContextImpl* context);
|
|
|
|
~CudaSparseMatrix();
|
|
|
|
// y = y + Ax;
|
|
void RightMultiplyAndAccumulate(const CudaVector& x, CudaVector* y);
|
|
// y = y + A'x;
|
|
void LeftMultiplyAndAccumulate(const CudaVector& x, CudaVector* y);
|
|
|
|
int num_rows() const { return num_rows_; }
|
|
int num_cols() const { return num_cols_; }
|
|
int num_nonzeros() const { return num_nonzeros_; }
|
|
|
|
const int32_t* rows() const { return rows_.data(); }
|
|
const int32_t* cols() const { return cols_.data(); }
|
|
const double* values() const { return values_.data(); }
|
|
|
|
int32_t* mutable_rows() { return rows_.data(); }
|
|
int32_t* mutable_cols() { return cols_.data(); }
|
|
double* mutable_values() { return values_.data(); }
|
|
|
|
// If subsequent uses of this matrix involve only numerical changes and no
|
|
// structural changes, then this method can be used to copy the updated
|
|
// non-zero values -- the row and column index arrays are kept the same. It
|
|
// is the caller's responsibility to ensure that the sparsity structure of the
|
|
// matrix is unchanged.
|
|
void CopyValuesFromCpu(const CompressedRowSparseMatrix& crs_matrix);
|
|
|
|
const cusparseSpMatDescr_t& descr() const { return descr_; }
|
|
|
|
private:
|
|
// Disable copy and assignment.
|
|
CudaSparseMatrix(const CudaSparseMatrix&) = delete;
|
|
CudaSparseMatrix& operator=(const CudaSparseMatrix&) = delete;
|
|
|
|
// y = y + op(M)x. op must be either CUSPARSE_OPERATION_NON_TRANSPOSE or
|
|
// CUSPARSE_OPERATION_TRANSPOSE.
|
|
void SpMv(cusparseOperation_t op, const CudaVector& x, CudaVector* y);
|
|
|
|
int num_rows_ = 0;
|
|
int num_cols_ = 0;
|
|
int num_nonzeros_ = 0;
|
|
|
|
ContextImpl* context_ = nullptr;
|
|
// CSR row indices.
|
|
CudaBuffer<int32_t> rows_;
|
|
// CSR column indices.
|
|
CudaBuffer<int32_t> cols_;
|
|
// CSR values.
|
|
CudaBuffer<double> values_;
|
|
|
|
// CuSparse object that describes this matrix.
|
|
cusparseSpMatDescr_t descr_ = nullptr;
|
|
|
|
CudaBuffer<uint8_t> spmv_buffer_;
|
|
};
|
|
|
|
} // namespace ceres::internal
|
|
|
|
#endif // CERES_NO_CUDA
|
|
#endif // CERES_INTERNAL_CUDA_SPARSE_MATRIX_H_
|