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
|
/***************************************************************************
* tools/benchmarks/pq_benchmark.cpp
*
* Part of the STXXL. See http://stxxl.sourceforge.net
*
* Copyright (C) 2006 Roman Dementiev <dementiev@ira.uka.de>
* Copyright (C) 2009 Andreas Beckmann <beckmann@cs.uni-frankfurt.de>
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
**************************************************************************/
//! \example containers/pq_benchmark.cpp
//! This is a benchmark mentioned in the paper
//! R. Dementiev, L. Kettner, P. Sanders "STXXL: standard template library for XXL data sets"
//! Software: Practice and Experience
//! Volume 38, Issue 6, Pages 589-637, May 2008
//! DOI: 10.1002/spe.844
#include <limits>
#include <stxxl/priority_queue>
#include <stxxl/stats>
#include <stxxl/timer>
#define TOTAL_PQ_MEM_SIZE (768 * 1024 * 1024)
#define PQ_MEM_SIZE (512 * 1024 * 1024)
#define PREFETCH_POOL_SIZE ((TOTAL_PQ_MEM_SIZE - PQ_MEM_SIZE) / 2)
#define WRITE_POOL_SIZE (PREFETCH_POOL_SIZE)
#define MAX_ELEMENTS (2000 * 1024 * 1024)
struct my_record
{
int key;
int data;
my_record() : key(0), data(0) { }
my_record(int k, int d) : key(k), data(d) { }
};
std::ostream& operator << (std::ostream& o, const my_record& obj)
{
o << obj.key << " " << obj.data;
return o;
}
bool operator == (const my_record& a, const my_record& b)
{
return a.key == b.key;
}
bool operator != (const my_record& a, const my_record& b)
{
return a.key != b.key;
}
bool operator < (const my_record& a, const my_record& b)
{
return a.key < b.key;
}
bool operator > (const my_record& a, const my_record& b)
{
return a.key > b.key;
}
struct comp_type : std::binary_function<my_record, my_record, bool>
{
bool operator () (const my_record& a, const my_record& b) const
{
return a > b;
}
static my_record min_value()
{
return my_record(std::numeric_limits<int>::max(), 0);
}
};
typedef stxxl::PRIORITY_QUEUE_GENERATOR<my_record, comp_type,
PQ_MEM_SIZE, MAX_ELEMENTS / (1024 / 8)>::result pq_type;
typedef pq_type::block_type block_type;
#define BLOCK_SIZE block_type::raw_size
#if 1
unsigned ran32State = 0xdeadbeef;
inline int myrand()
{
return ((int)((ran32State = 1664525 * ran32State + 1013904223) >> 1)) - 1;
}
#else // a longer pseudo random sequence
long long unsigned ran32State = 0xdeadbeef;
inline long long unsigned myrand()
{
return (ran32State = (ran32State * 0x5DEECE66DULL + 0xBULL) & 0xFFFFFFFFFFFFULL);
}
#endif
void run_stxxl_insert_all_delete_all(stxxl::uint64 ops)
{
pq_type PQ(PREFETCH_POOL_SIZE, WRITE_POOL_SIZE);
stxxl::uint64 i;
my_record cur;
stxxl::stats_data stats_begin(*stxxl::stats::get_instance());
stxxl::timer Timer;
Timer.start();
for (i = 0; i < ops; ++i)
{
cur.key = myrand();
PQ.push(cur);
}
Timer.stop();
STXXL_MSG("Records in PQ: " << PQ.size());
if (i != PQ.size())
{
STXXL_MSG("Size does not match");
abort();
}
STXXL_MSG("Insertions elapsed time: " << (Timer.mseconds() / 1000.) <<
" seconds : " << (double(ops) / (Timer.mseconds() / 1000.)) << " key/data pairs per sec");
std::cout << stxxl::stats_data(*stxxl::stats::get_instance()) - stats_begin;
////////////////////////////////////////////////
stats_begin = *stxxl::stats::get_instance();
Timer.reset();
Timer.start();
for (i = 0; i < ops; ++i)
{
PQ.pop();
}
Timer.stop();
STXXL_MSG("Records in PQ: " << PQ.size());
if (!PQ.empty())
{
STXXL_MSG("PQ must be empty");
abort();
}
STXXL_MSG("Deletions elapsed time: " << (Timer.mseconds() / 1000.) <<
" seconds : " << (double(ops) / (Timer.mseconds() / 1000.)) << " key/data pairs per sec");
std::cout << stxxl::stats_data(*stxxl::stats::get_instance()) - stats_begin;
}
void run_stxxl_intermixed(stxxl::uint64 ops)
{
pq_type PQ(PREFETCH_POOL_SIZE, WRITE_POOL_SIZE);
stxxl::uint64 i;
my_record cur;
stxxl::stats_data stats_begin(*stxxl::stats::get_instance());
stxxl::timer Timer;
Timer.start();
for (i = 0; i < ops; ++i)
{
cur.key = myrand();
PQ.push(cur);
}
Timer.stop();
STXXL_MSG("Records in PQ: " << PQ.size());
if (i != PQ.size())
{
STXXL_MSG("Size does not match");
abort();
}
STXXL_MSG("Insertions elapsed time: " << (Timer.mseconds() / 1000.) <<
" seconds : " << (double(ops) / (Timer.mseconds() / 1000.)) << " key/data pairs per sec");
std::cout << stxxl::stats_data(*stxxl::stats::get_instance()) - stats_begin;
////////////////////////////////////////////////
stats_begin = *stxxl::stats::get_instance();
Timer.reset();
Timer.start();
for (i = 0; i < ops; ++i)
{
int o = myrand() % 3;
if (o == 0)
{
cur.key = myrand();
PQ.push(cur);
}
else
{
assert(!PQ.empty());
PQ.pop();
}
}
Timer.stop();
STXXL_MSG("Records in PQ: " << PQ.size());
STXXL_MSG("Deletions/Insertion elapsed time: " << (Timer.mseconds() / 1000.) <<
" seconds : " << (double(ops) / (Timer.mseconds() / 1000.)) << " key/data pairs per sec");
std::cout << stxxl::stats_data(*stxxl::stats::get_instance()) - stats_begin;
}
int main(int argc, char* argv[])
{
STXXL_MSG("stxxl::pq lock size: " << BLOCK_SIZE << " bytes");
#if STXXL_DIRECT_IO_OFF
STXXL_MSG("STXXL_DIRECT_IO_OFF is defined");
#else
STXXL_MSG("STXXL_DIRECT_IO_OFF is NOT defined");
#endif
if (argc < 3)
{
STXXL_MSG("Usage: " << argv[0] << " version #ops");
STXXL_MSG("\t version = 1: insert-all-delete-all stxxl pq");
STXXL_MSG("\t version = 2: intermixed insert/delete stxxl pq");
return -1;
}
int version = atoi(argv[1]);
stxxl::uint64 ops = stxxl::atouint64(argv[2]);
STXXL_MSG("Running version : " << version);
STXXL_MSG("Operations to perform: " << ops);
switch (version)
{
case 1:
run_stxxl_insert_all_delete_all(ops);
break;
case 2:
run_stxxl_intermixed(ops);
break;
default:
STXXL_MSG("Unsupported version " << version);
}
}
|