mirror of
https://github.com/ceres-solver/ceres-solver.git
synced 2026-08-29 16:40:38 +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
129 lines
5.0 KiB
C++
129 lines
5.0 KiB
C++
// Ceres Solver - A fast non-linear least squares minimizer
|
|
// Copyright 2023 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.
|
|
//
|
|
// Authors: dmitriy.korchemkin@gmail.com (Dmitriy Korchemkin)
|
|
|
|
#include "ceres/cuda_block_structure.h"
|
|
|
|
#ifndef CERES_NO_CUDA
|
|
|
|
namespace ceres::internal {
|
|
namespace {
|
|
// Dimension of a sorted array of blocks
|
|
inline int Dimension(const std::vector<Block>& blocks) {
|
|
if (blocks.empty()) {
|
|
return 0;
|
|
}
|
|
const auto& last = blocks.back();
|
|
return last.size + last.position;
|
|
}
|
|
} // namespace
|
|
|
|
CudaBlockSparseStructure::CudaBlockSparseStructure(
|
|
const CompressedRowBlockStructure& block_structure, ContextImpl* context)
|
|
: first_cell_in_row_block_(context),
|
|
cells_(context),
|
|
row_blocks_(context),
|
|
col_blocks_(context) {
|
|
// Row blocks extracted from CompressedRowBlockStructure::rows
|
|
std::vector<Block> row_blocks;
|
|
// Column blocks can be reused as-is
|
|
const auto& col_blocks = block_structure.cols;
|
|
|
|
// Row block offset is an index of the first cell corresponding to row block
|
|
std::vector<int> first_cell_in_row_block;
|
|
// Flat array of all cells from all row-blocks
|
|
std::vector<Cell> cells;
|
|
|
|
int f_values_offset = 0;
|
|
is_crs_compatible_ = true;
|
|
num_row_blocks_ = block_structure.rows.size();
|
|
num_col_blocks_ = col_blocks.size();
|
|
|
|
row_blocks.reserve(num_row_blocks_);
|
|
first_cell_in_row_block.reserve(num_row_blocks_ + 1);
|
|
num_nonzeros_ = 0;
|
|
sequential_layout_ = true;
|
|
for (const auto& r : block_structure.rows) {
|
|
const int row_block_size = r.block.size;
|
|
if (r.cells.size() > 1 && row_block_size > 1) {
|
|
is_crs_compatible_ = false;
|
|
}
|
|
row_blocks.emplace_back(r.block);
|
|
first_cell_in_row_block.push_back(cells.size());
|
|
for (const auto& c : r.cells) {
|
|
const int col_block_size = col_blocks[c.block_id].size;
|
|
const int cell_size = col_block_size * row_block_size;
|
|
cells.push_back(c);
|
|
sequential_layout_ &= c.position == num_nonzeros_;
|
|
num_nonzeros_ += cell_size;
|
|
}
|
|
}
|
|
first_cell_in_row_block.push_back(cells.size());
|
|
num_cells_ = cells.size();
|
|
|
|
num_rows_ = Dimension(row_blocks);
|
|
num_cols_ = Dimension(col_blocks);
|
|
|
|
is_crs_compatible_ &= sequential_layout_;
|
|
|
|
if (VLOG_IS_ON(3)) {
|
|
const size_t first_cell_in_row_block_size =
|
|
first_cell_in_row_block.size() * sizeof(int);
|
|
const size_t cells_size = cells.size() * sizeof(Cell);
|
|
const size_t row_blocks_size = row_blocks.size() * sizeof(Block);
|
|
const size_t col_blocks_size = col_blocks.size() * sizeof(Block);
|
|
const size_t total_size = first_cell_in_row_block_size + cells_size +
|
|
col_blocks_size + row_blocks_size;
|
|
const double ratio =
|
|
(100. * total_size) / (num_nonzeros_ * (sizeof(int) + sizeof(double)) +
|
|
num_rows_ * sizeof(int));
|
|
VLOG(3) << "\nCudaBlockSparseStructure:\n"
|
|
"\tRow block offsets: "
|
|
<< first_cell_in_row_block_size
|
|
<< " bytes\n"
|
|
"\tColumn blocks: "
|
|
<< col_blocks_size
|
|
<< " bytes\n"
|
|
"\tRow blocks: "
|
|
<< row_blocks_size
|
|
<< " bytes\n"
|
|
"\tCells: "
|
|
<< cells_size << " bytes\n\tTotal: " << total_size
|
|
<< " bytes of GPU memory (" << ratio << "% of CRS matrix size)";
|
|
}
|
|
|
|
first_cell_in_row_block_.CopyFromCpuVector(first_cell_in_row_block);
|
|
cells_.CopyFromCpuVector(cells);
|
|
row_blocks_.CopyFromCpuVector(row_blocks);
|
|
col_blocks_.CopyFromCpuVector(col_blocks);
|
|
}
|
|
} // namespace ceres::internal
|
|
|
|
#endif // CERES_NO_CUDA
|