File size: 10,851 Bytes
8be366a | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 | //=================================================================================================
/*!
// \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;
}
}
//*************************************************************************************************
|