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 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542
|
// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
// SPDX-FileCopyrightText: Bradley M. Bell <bradbell@seanet.com>
// SPDX-FileContributor: 2003-24 Bradley M. Bell
// ----------------------------------------------------------------------------
/*
{xrst_begin harmonic_common}
Common Variables Used by Multi-threading Sum of 1/i
###################################################
Purpose
*******
This source code defines the common
include files, defines, and variables that are used by
the summation that defines the harmonic series
.. math::
1 + 1/2 + 1/3 + ... + 1/n
Source
******
{xrst_literal
// BEGIN COMMON C++
// END COMMON C++
}
{xrst_end harmonic_common}
*/
// BEGIN COMMON C++
# include <cppad/cppad.hpp>
# include "harmonic.hpp"
# include "team_thread.hpp"
# define MAX_NUMBER_THREADS 48
namespace {
using CppAD::thread_alloc; // fast multi-threadeding memory allocator
// Number of threads, set by previous call to harmonic_time
// (zero means one thread with no multi-threading setup)
size_t num_threads_ = 0;
// value of mega_sum, set by previous call to harmonic_time.
size_t mega_sum_;
// structure with information for one thread
typedef struct {
// index to start summation at (worker input)
// set by previous call to harmonic_setup
size_t start;
// index to end summation at (worker input)
// set by previous call to harmonic_setup
size_t stop;
// summation for this thread
// set by worker
double sum;
// false if an error occurs, true otherwise
// set by worker
bool ok;
} work_one_t;
// vector with information for all threads
// (use pointers instead of values to avoid false sharing)
work_one_t* work_all_[MAX_NUMBER_THREADS];
}
// END COMMON C++
/*
------------------------------------------------------------------------------
{xrst_begin harmonic_setup}
Set Up Multi-threading Sum of 1/i
#################################
Syntax
******
| *ok* = ``harmonic_setup`` ( *num_sum* )
Purpose
*******
This routine does the setup for splitting
the summation that defines the harmonic series
.. math::
1 + 1/2 + 1/3 + ... + 1/n
into separate parts for each thread.
Thread
******
It is assumed that this function is called by thread zero,
and all the other threads are blocked (waiting).
num_sum
*******
The argument *num_sum* has prototype
``size_t`` *num_sum*
It specifies the value of :math:`n` in the summation.
Source
******
{xrst_literal
// BEGIN SETUP C++
// END SETUP C++
}
{xrst_end harmonic_setup}
*/
// BEGIN SETUP C++
namespace {
bool harmonic_setup(size_t num_sum)
{ // sum = 1/num_sum + 1/(num_sum-1) + ... + 1
size_t num_threads = std::max(num_threads_, size_t(1));
bool ok = num_threads == thread_alloc::num_threads();
ok &= thread_alloc::thread_num() == 0;
ok &= num_sum >= num_threads;
//
for(size_t thread_num = 0; thread_num < num_threads; thread_num++)
{ // allocate separate memory for this thread to avoid false sharing
size_t min_bytes(sizeof(work_one_t)), cap_bytes;
void* v_ptr = thread_alloc::get_memory(min_bytes, cap_bytes);
work_all_[thread_num] = static_cast<work_one_t*>(v_ptr);
//
// in case this thread's worker does not get called
work_all_[thread_num]->ok = false;
// parameters that define the work for this and previous thread
if( thread_num == 0 )
work_all_[0]->start = 1;
else
{ size_t index = (num_sum * thread_num) / num_threads;
work_all_[thread_num-1]->stop = index;
work_all_[thread_num]->start = index;
}
}
work_all_[num_threads-1]->stop = num_sum + 1;
return ok;
}
}
// END SETUP C++
/*
-------------------------------------------------------------------------------
{xrst_begin harmonic_worker}
Do One Thread's Work for Sum of 1/i
###################################
Syntax
******
``harmonic_worker`` ()
Purpose
*******
This routines computes the sum
the summation that defines the harmonic series
1/ *start* + 1/( *start* +1) + ... + 1/( *end* ``-1`` )
start
*****
This is the value of the :ref:`harmonic_common-name` information
*start* = ``work_all_`` [ *thread_num* ] ``->start``
end
***
This is the value of the :ref:`harmonic_common-name` information
*end* = ``work_all_`` [ *thread_num* ] ``->end``
thread_num
**********
This is the number for the current thread; see
:ref:`thread_num<ta_thread_num-name>` .
Source
******
{xrst_literal
// BEGIN WORKER C++
// END WORKER C++
}
{xrst_end harmonic_worker}
*/
// BEGIN WORKER C++
namespace {
void harmonic_worker(void)
{ // sum = 1/(stop-1) + 1/(stop-2) + ... + 1/start
size_t thread_num = thread_alloc::thread_num();
size_t num_threads = std::max(num_threads_, size_t(1));
bool ok = thread_num < num_threads;
size_t start = work_all_[thread_num]->start;
size_t stop = work_all_[thread_num]->stop;
double sum = 0.;
ok &= stop > start;
size_t i = stop;
while( i > start )
{ i--;
sum += 1. / double(i);
}
work_all_[thread_num]->sum = sum;
work_all_[thread_num]->ok = ok;
}
}
// END WORKER C++
/*
-------------------------------------------------------------------------------
{xrst_begin harmonic_takedown}
Take Down Multi-threading Sum of 1/i
####################################
Syntax
******
*ok* = ``harmonic_takedown`` ( *sum* )
Purpose
*******
This routine does the takedown for splitting
the summation that defines the harmonic series
.. math::
s = 1 + 1/2 + 1/3 + ... + 1/n
into separate parts for each thread; see :ref:`harmonic_setup-name` .
Thread
******
It is assumed that this function is called by thread zero,
and all the other threads have completed their work and are blocked (waiting).
sum
***
This argument has prototype
``double&`` *sum*
The input value of the argument does not matter.
Upon return it is the value of the summation; i.e. :math:`s`.
Source
******
{xrst_literal
// BEGIN TAKEDOWN C++
// END TAKEDOWN C++
}
{xrst_end harmonic_takedown}
*/
// BEGIN TAKEDOWN C++
namespace {
bool harmonic_takedown(double& sum)
{ // sum = 1/num_sum + 1/(num_sum-1) + ... + 1
bool ok = true;
ok &= thread_alloc::thread_num() == 0;
size_t num_threads = std::max(num_threads_, size_t(1));
sum = 0.;
//
// go down so that free memory for other threads before memory for master
size_t thread_num = num_threads;
while(thread_num--)
{ // check that this tread was ok with the work it did
ok &= work_all_[thread_num]->ok;
//
// add this threads contribution to the sum
sum += work_all_[thread_num]->sum;
//
// delete problem specific information
void* v_ptr = static_cast<void*>( work_all_[thread_num] );
thread_alloc::return_memory( v_ptr );
//
// check that there is no longer any memory inuse by this thread
// (for general applications, the master might still be using memory)
ok &= thread_alloc::inuse(thread_num) == 0;
//
// return all memory being held for future use by this thread
thread_alloc::free_available(thread_num);
}
return ok;
}
}
// END TAKEDOWN C++
/*
------------------------------------------------------------------------------
{xrst_begin harmonic_sum}
Multi-Threaded Implementation of Summation of 1/i
#################################################
Syntax
******
*ok* = ``harmonic_sum`` ( *sum* , *num_sum* )
Purpose
*******
Multi-threaded computation of the summation that defines the harmonic series
.. math::
s = 1 + 1/2 + 1/3 + ... + 1/n
Thread
******
It is assumed that this function is called by thread zero,
and all the other threads are blocked (waiting).
ok
**
This return value has prototype
``bool`` *ok*
If this return value is false, an error occurred during ``harmonic`` .
sum
***
This argument has prototype
``double&`` *sum*
The input value of the argument does not matter.
Upon return it is the value of the summation; i.e. :math:`s`.
num_sum
*******
This argument has prototype
``size_t`` *num_sum*
It specifies the number of terms in the summation; i.e. :math:`n`.
Source
******
{xrst_literal
// BEGIN SUM C++
// END SUM C++
}
{xrst_end harmonic_sum}
*/
// BEGIN SUM C++
namespace {
bool harmonic_sum(double& sum, size_t num_sum)
{ // sum = 1/num_sum + 1/(num_sum-1) + ... + 1
bool ok = true;
ok &= thread_alloc::thread_num() == 0;
// setup the work for multi-threading
ok &= harmonic_setup(num_sum);
// now do the work for each thread
if( num_threads_ > 0 )
team_work( harmonic_worker );
else
harmonic_worker();
// combine the result for each thread and takedown the multi-threading.
ok &= harmonic_takedown(sum);
return ok;
}
}
// END SUM C++
/*
-------------------------------------------------------------------------------
{xrst_begin harmonic_time}
Timing Test of Multi-Threaded Summation of 1/i
##############################################
Syntax
******
| *ok* = ``harmonic_time`` (
| |tab| *time_out* , *test_time* , *num_threads* , *mega_sum*
| )
Purpose
*******
Runs a correctness and timing test for a multi-threaded
computation of the summation that defines the harmonic series
.. math::
1 + 1/2 + 1/3 + ... + 1/n
Thread
******
It is assumed that this function is called by thread zero in sequential
mode; i.e., not :ref:`in_parallel<ta_in_parallel-name>` .
ok
**
This return value has prototype
``bool`` *ok*
If it is true,
``harmonic_time`` passed the correctness test.
Otherwise it is false.
time_out
********
This argument has prototype
``double&`` *time_out*
The input value of the argument does not matter.
Upon return it is the number of wall clock seconds required for
to compute the summation.
test_time
*********
Is the minimum amount of wall clock time that the test should take.
The number of repeats for the test will be increased until this time
is reached.
The reported *time_out* is the total wall clock time divided by the
number of repeats.
num_threads
***********
This argument has prototype
``size_t`` *num_threads*
It specifies the number of threads that are available for this test.
If it is zero, the test is run without the multi-threading environment and
1 == ``thread_alloc::num_threads`` ()
when ``harmonic_time`` is called.
If it is non-zero, the test is run with the multi-threading and
*num_threads* = ``thread_alloc::num_threads`` ()
when ``harmonic_time`` is called.
mega_sum
********
This argument has prototype
``size_t&`` *mega_sum*
and is greater than zero.
The value :math:`n` in the summation
is equal to :math:`10^6` times *mega_sum* .
Source
******
{xrst_literal
// BEGIN TIME C++
// END TIME C++
}
{xrst_end harmonic_time}
*/
// BEGIN TIME C++
# include <cstring>
# include <limits>
# include <iostream>
# include <cstdlib>
# include <algorithm>
// Note there is no mention of parallel mode in the documentation for
// speed_test (so it is safe to use without special consideration).
# include <cppad/utility/time_test.hpp>
namespace {
// value of sum resulting from most recent call to test_once
double sum_ = 0.;
//
void test_once(void)
{ if( mega_sum_ < 1 )
{ std::cerr << "harmonic_time: mega_sum < 1" << std::endl;
exit(1);
}
size_t num_sum = mega_sum_ * 1000000;
bool ok = harmonic_sum(sum_, num_sum);
if( ! ok )
{ std::cerr << "harmonic: error" << std::endl;
exit(1);
}
return;
}
//
void test_repeat(size_t repeat)
{ size_t i;
for(i = 0; i < repeat; i++)
test_once();
return;
}
}
// This is the only routine that is accessible outside of this file
bool harmonic_time(
double& time_out, double test_time, size_t num_threads, size_t mega_sum)
{ bool ok = true;
ok &= thread_alloc::thread_num() == 0;
// arguments passed to harmonic_sum
num_threads_ = num_threads;
mega_sum_ = mega_sum;
// create team of threads
ok &= thread_alloc::in_parallel() == false;
if( num_threads > 0 )
{ team_create(num_threads);
ok &= num_threads == thread_alloc::num_threads();
}
else
{ ok &= 1 == thread_alloc::num_threads();
}
// run the test case and set the time return value
time_out = CppAD::time_test(test_repeat, test_time);
// destroy team of threads
if( num_threads > 0 )
team_destroy();
ok &= thread_alloc::in_parallel() == false;
// Correctness check
double eps1000 =
double(mega_sum_) * 1e3 * std::numeric_limits<double>::epsilon();
size_t i = mega_sum_ * 1000000;
double check = 0.;
while(i)
check += 1. / double(i--);
ok &= std::fabs(sum_ - check) <= eps1000;
return ok;
}
// END TIME C++
|