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
|
// **********************************************************************
//
// Copyright (c) 2003-2005 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
#include <Ice/Ice.h>
#include <IceUtil/Time.h>
#include <IceUtil/Thread.h>
#include <PerfI.h>
#include <algorithm>
#include <math.h>
using namespace std;
PingI::PingI(int nExpectedTicks, int nPublishers) :
_nPublishers(nPublishers),
_nStartedPublishers(0),
_nStoppedPublishers(0),
_nExpectedTicks(nExpectedTicks * _nPublishers),
_nReceived(0),
_payloadSize(1)
{
_results.reserve(nExpectedTicks * _nPublishers);
}
void
PingI::tick(Ice::Long time, Perf::AEnum e , int, const Perf::AStruct& s, const Ice::Current& current)
{
Lock sync(*this);
if(time > 0)
{
add(time);
}
else if(time == 0)
{
_payloadSize += sizeof(e);
_payloadSize += sizeof(Ice::Int);
//
// This needs to be kept up to date with the definition of the
// structure in the slice.
//
_payloadSize += sizeof(s.e);
_payloadSize += sizeof(s.d);
_payloadSize += s.s.size();
started();
}
else if(time < 0)
{
if(stopped())
{
current.adapter->getCommunicator()->shutdown();
}
}
}
void
PingI::tickVoid(Ice::Long time, const Ice::Current& current)
{
Lock sync(*this);
if(time > 0)
{
add(time);
}
else if(time == 0)
{
started();
}
else if(time == -1)
{
if(stopped())
{
current.adapter->getCommunicator()->shutdown();
}
}
else if(time < 0)
{
cerr << "time < 0: " << time << endl;
}
}
void
PingI::started()
{
if(++_nStartedPublishers == _nPublishers)
{
_startTime = IceUtil::Time::now();
}
}
bool
PingI::stopped()
{
//
// It is *very* important to record the stop time be recorded once the
// first publisher has stopped. The stop time is used to calculate the
// throughput values. We are looking for a throughput value that
// reflects the service's ability to process events when fully loaded.
// If we keep counting after the first stopped publisher we may end up
// including data that skews the results, possibly for better, possibly
// for worse.
//
if(_nStoppedPublishers == 0)
{
_stopTime = IceUtil::Time::now();
}
if(_nStartedPublishers < _nPublishers)
{
cerr << "Some publishers are already finished while others aren't even started" << endl;
cerr << _nPublishers << " " << _nStartedPublishers << " " << _nStoppedPublishers << endl;
cerr << _startTime - _stopTime << " " << _results.size() << " " << _nReceived << endl;
}
if(++_nStoppedPublishers == _nPublishers)
{
calc();
return true;
}
else
{
return false;
}
}
void
PingI::add(Ice::Long time)
{
++_nReceived;
//
// Do *NOT* add record more events after the first publisher has
// stopped.
//
if(_nStartedPublishers == _nPublishers && _nStoppedPublishers == 0)
{
#ifdef WIN32
LARGE_INTEGER t;
QueryPerformanceCounter(&t);
Ice::Long interval = t.QuadPart - time;
QueryPerformanceFrequency(&t);
interval /= t.QuadPart; // Frequency is counts per second.
interval *= 1000000; // Convert to microseconds.
_results.push_back(interval);
#else
IceUtil::Time t = IceUtil::Time::microSeconds(time);
IceUtil::Time interval = IceUtil::Time::now() - t;
_results.push_back(static_cast<Ice::Long>(interval.toMicroSeconds()));
#endif
}
}
void
PingI::calc()
{
double originalSize = _results.size();
//
// Only keep the N/2 best results
//
sort(_results.begin(), _results.end());
_results.resize(_results.size() / 2);
double total = 0.0;
{
for(vector<Ice::Long>::const_iterator p = _results.begin(); p != _results.end(); ++p)
{
total += (*p);
}
}
double newSize = _results.size();
double mean = total / newSize;
double deviation;
double x = 0.0;
{
for(vector<Ice::Long>::const_iterator p = _results.begin(); p != _results.end(); ++p)
{
x += (*p - mean) * (*p - mean);
}
}
deviation = sqrt(x / (_results.size() - 1));
//
// If the expected number of results falls below a the 90% threshold,
// we should display a warning. There isn't much else that can be done
// fairly. What data there is should still be accurate --if not
// statistically sound-- because it is based on what actually occurred,
// not expected parameters.
//
if(originalSize < (_nExpectedTicks * 0.90))
{
cerr << "WARNING: Less than 90% of the expected ticks were used for the test. " <<
_nExpectedTicks << " events were expected, but only " << originalSize << " were received.\n" << endl;
cerr << "The results are based on a smaller sample size and comparisons with other tests\n"
"may not be fair." << endl;
}
cout << "{ 'latency' : " << mean / 1000 << ", 'deviation' : " << deviation << ", 'throughput' : " <<
((double)(originalSize * _payloadSize) / (1024^2)) / (_stopTime - _startTime).toMilliSecondsDouble() * 1000.0 <<
", 'repetitions': " << originalSize << ", 'payload': " << _payloadSize << "}" << endl;
_results.clear();
_nStartedPublishers = 0;
_nStoppedPublishers = 0;
}
|
