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
|
// $Id$
#include "Util_Thread.h"
ACE_RCSID(MT_Cubit, Util_Thread, "$Id$")
Util_Thread::Util_Thread (Task_State *ts,
ACE_Thread_Manager *thr_mgr)
: ACE_Task<ACE_MT_SYNCH> (thr_mgr),
done_ (0),
number_of_computations_ (0),
ts_ (ts)
{
}
int
Util_Thread::svc (void)
{
ACE_DEBUG ((LM_DEBUG,
"(%t) Utilization Thread created, "
"waiting for threads to finish binding\n"));
// this barrier synchronizes the utilization thread with
// the client threads
// i.e., the Util_thread should wait until all the
// clients have finished binding, and only then
// start measuring the utilization.
this->ts_->barrier_->wait ();
ACE_DEBUG ((LM_DEBUG,
"(%t) Threads have bound, "
"utilization test started\n"));
this->run_computations ();
return 0;
}
double
Util_Thread::get_number_of_computations (void)
{
return this->number_of_computations_;
}
// Perform repeated prime factor computations on an arbitrary number.
// And you thought your life was boring... :-)
int
Util_Thread::run_computations (void)
{
while (this->done_ == 0)
{
// See if this number is prime. 2 and CUBIT_ARBIT_NUMBER / 2 are
// the recommended values for min_factor and max_factor, as
// explained in ACE.h (is_prime).
ACE::is_prime (CUBIT_ARBIT_NUMBER,
2,
CUBIT_ARBIT_NUMBER / 2);
this->number_of_computations_ ++;
}
return 0;
}
|
