sajaniemi_variable_dataset_large / code /validation /C++ /0050094_TSVecTDMatMult.cpp
Pendigard's picture
Upload folder using huggingface_hub (part 6)
8be366a verified
Raw History Blame Contribute Delete
10.9 kB
//=================================================================================================
/*!
// \file src/blaze/TSVecTDMatMult.cpp
// \brief Source file for the transpose sparse vector/transpose dense matrix multiplication benchmark
//
// Copyright (C) 2013 Klaus Iglberger - All Rights Reserved
//
// This file is part of the Blaze library. You can redistribute it and/or modify it under
// the terms of the New (Revised) BSD License. Redistribution and use in source and binary
// forms, with or without modification, are permitted provided that the following conditions
// are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this list of
// conditions and the following disclaimer.
// 2. 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.
// 3. Neither the names of the Blaze development group 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 HOLDER 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.
*/
//=================================================================================================
//*************************************************************************************************
// Includes
//*************************************************************************************************
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stdexcept>
#include <string>
#include <vector>
#include <blaze/math/CompressedVector.h>
#include <blaze/math/DynamicMatrix.h>
#include <blaze/math/DynamicVector.h>
#include <blaze/math/Functions.h>
#include <blaze/math/Infinity.h>
#include <blaze/util/Random.h>
#include <blaze/util/Timing.h>
#include <blazemark/blaze/init/CompressedVector.h>
#include <blazemark/blaze/init/DynamicMatrix.h>
#include <blazemark/blaze/TSVecTDMatMult.h>
#include <blazemark/boost/TSVecTDMatMult.h>
#include <blazemark/system/Config.h>
#include <blazemark/system/Types.h>
#include <blazemark/util/Benchmarks.h>
#include <blazemark/util/DynamicSparseRun.h>
#include <blazemark/util/Indices.h>
#include <blazemark/util/Parser.h>
//*************************************************************************************************
// Using declarations
//*************************************************************************************************
using blazemark::Benchmarks;
using blazemark::DynamicSparseRun;
using blazemark::Parser;
//=================================================================================================
//
// TYPE DEFINITIONS
//
//=================================================================================================
//*************************************************************************************************
/*!\brief Type of a benchmark run.
//
// This type definition specifies the type of a single benchmark run for the transpose sparse
// vector/transpose dense matrix multiplication benchmark.
*/
typedef DynamicSparseRun Run;
//*************************************************************************************************
//=================================================================================================
//
// UTILITY FUNCTIONS
//
//=================================================================================================
//*************************************************************************************************
/*!\brief Estimating the necessary number of steps for each benchmark.
//
// \param run The parameters for the benchmark run.
// \return void
//
// This function estimates the necessary number of steps for the given benchmark based on the
// performance of the Blaze library.
*/
void estimateSteps( Run& run )
{
using blazemark::element_t;
using blaze::rowVector;
using blaze::columnMajor;
::blaze::setSeed( ::blazemark::seed );
const size_t N( run.getSize() );
const size_t F( run.getNonZeros() );
blaze::CompressedVector<element_t,rowVector> a( N, F );
blaze::DynamicMatrix<element_t,columnMajor> A( N, N );
blaze::DynamicVector<element_t,rowVector> b( N );
blaze::timing::WcTimer timer;
double wct( 0.0 );
size_t steps( 1UL );
blazemark::blaze::init( a, F );
blazemark::blaze::init( A );
while( true ) {
timer.start();
for( size_t i=0UL; i<steps; ++i ) {
b = a * A;
}
timer.end();
wct = timer.last();
if( wct >= 0.2 ) break;
steps *= 2UL;
}
if( b.size() != N )
std::cerr << " Line " << __LINE__ << ": ERROR detected!!!\n";
run.setSteps( blaze::max( 1UL, ( blazemark::runtime * steps ) / timer.last() ) );
}
//*************************************************************************************************
//*************************************************************************************************
/*!\brief Estimating the necessary number of floating point operations.
//
// \param run The parameters for the benchmark run.
// \return void
//
// This function estimates the number of floating point operations required for a single
// computation of the (composite) arithmetic operation.
*/
void estimateFlops( Run& run )
{
const size_t N( run.getSize() );
const size_t F( run.getNonZeros() );
run.setFlops( 2UL*N*F - N );
}
//*************************************************************************************************
//=================================================================================================
//
// BENCHMARK FUNCTIONS
//
//=================================================================================================
//*************************************************************************************************
/*!\brief Transpose sparse vector/transpose dense matrix multiplication benchmark function.
//
// \param runs The specified benchmark runs.
// \param benchmarks The selection of benchmarks.
// \return void
*/
void tsvectdmatmult( std::vector<Run>& runs, Benchmarks benchmarks )
{
std::cout << std::left;
std::sort( runs.begin(), runs.end() );
size_t slowSize( blaze::inf );
for( std::vector<Run>::iterator run=runs.begin(); run!=runs.end(); ++run )
{
estimateFlops( *run );
if( run->getSteps() == 0UL ) {
if( run->getSize() < slowSize ) {
estimateSteps( *run );
if( run->getSteps() == 1UL )
slowSize = run->getSize();
}
else run->setSteps( 1UL );
}
}
if( benchmarks.runBlaze ) {
std::vector<Run>::iterator run=runs.begin();
while( run != runs.end() ) {
const float fill( run->getFillingDegree() );
std::cout << " Blaze (" << fill << "% filled) [MFlop/s]:\n";
for( ; run!=runs.end(); ++run ) {
if( run->getFillingDegree() != fill ) break;
const size_t N ( run->getSize() );
const size_t F ( run->getNonZeros() );
const size_t steps( run->getSteps() );
run->setBlazeResult( blazemark::blaze::tsvectdmatmult( N, F, steps ) );
const double mflops( run->getFlops() * steps / run->getBlazeResult() / 1E6 );
std::cout << " " << std::setw(12) << N << mflops << std::endl;
}
}
}
if( benchmarks.runBoost ) {
std::vector<Run>::iterator run=runs.begin();
while( run != runs.end() ) {
const float fill( run->getFillingDegree() );
std::cout << " Boost uBLAS (" << fill << "% filled) [MFlop/s]:\n";
for( ; run!=runs.end(); ++run ) {
if( run->getFillingDegree() != fill ) break;
const size_t N ( run->getSize() );
const size_t F ( run->getNonZeros() );
const size_t steps( run->getSteps() );
run->setBoostResult( blazemark::boost::tsvectdmatmult( N, F, steps ) );
const double mflops( run->getFlops() * steps / run->getBoostResult() / 1E6 );
std::cout << " " << std::setw(12) << N << mflops << std::endl;
}
}
}
for( std::vector<Run>::iterator run=runs.begin(); run!=runs.end(); ++run ) {
std::cout << *run;
}
}
//*************************************************************************************************
//=================================================================================================
//
// MAIN FUNCTION
//
//=================================================================================================
//*************************************************************************************************
/*!\brief The main function for the transpose sparse vector/transpose dense matrix multiplication
// benchmark.
//
// \param argc The total number of command line arguments.
// \param argv The array of command line arguments.
// \return void
*/
int main( int argc, char** argv )
{
std::cout << "\n Transpose Sparse Vector/Transpose Dense Matrix Multiplication:\n";
Benchmarks benchmarks;
try {
parseCommandLineArguments( argc, argv, benchmarks );
}
catch( std::exception& ex ) {
std::cerr << " " << ex.what() << "\n";
return EXIT_FAILURE;
}
const std::string installPath( INSTALL_PATH );
const std::string parameterFile( installPath + "/params/tsvectdmatmult.prm" );
Parser<Run> parser;
std::vector<Run> runs;
try {
parser.parse( parameterFile.c_str(), runs );
}
catch( std::exception& ex ) {
std::cerr << " Error during parameter extraction: " << ex.what() << "\n";
return EXIT_FAILURE;
}
try {
tsvectdmatmult( runs, benchmarks );
}
catch( std::exception& ex ) {
std::cerr << " Error during benchmark execution: " << ex.what() << "\n";
return EXIT_FAILURE;
}
}
//*************************************************************************************************