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
|
/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify
* it under the terms of version 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* Konclude is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU (Lesser) General Public License for more details.
*
* You should have received a copy of the GNU (Lesser) General Public
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "CConcurrentThroughputTestTaskTester.h"
namespace Konclude {
namespace Test {
CConcurrentThroughputTestTaskTester::CConcurrentThroughputTestTaskTester() {
mHandleAlg = new CThroughputTestTaskHandleAlgorithm();
}
CConcurrentThroughputTestTaskTester::~CConcurrentThroughputTestTaskTester() {
}
void CConcurrentThroughputTestTaskTester::generateTestingStructure(cint64 maxBranchDepth, cint64 branchingFactor) {
mMaxBranchDepth = maxBranchDepth;
mBranchingFactor = branchingFactor;
mThreadTestCount = 1;
mThreadMaxTestCount = 8;
mScaleReferenceTime = 0;
mLastEventProcessed = 0;
mLastTaskProcessed = 0;
mTotalTestTasks = qPow(mBranchingFactor,mMaxBranchDepth+1);
mProcessUnit = new CSingleThreadTaskProcessorUnit(mHandleAlg);
mProcessUnit->startProcessing();
mCompletorUnit = new CTaskProcessorCompletorThread(mHandleAlg);
mSchedulerUnit = new CTaskProcessorSchedulerThread(mHandleAlg,mCompletorUnit);
mCompletorUnit->installScheduler(mSchedulerUnit);
mSchedulerUnit->installScheduler(mSchedulerUnit);
mCompletorUnit->startProcessing();
mSchedulerUnit->startProcessing();
}
void CConcurrentThroughputTestTaskTester::startTesting() {
CThroughputTestTask* rootTask = CObjectMemoryPoolAllocator<CThroughputTestTask>::allocateAndConstructWithMemroyPool();
rootTask->initTestTask(mMaxBranchDepth,mBranchingFactor);
rootTask->addCallbackLinker(this);
mMeasurementTimer.start();
CTaskEventCommunicator::postSendTaskScheduleEvent(mProcessUnit->getEventHandler(),rootTask,nullptr);
}
void CConcurrentThroughputTestTaskTester::stopTesting() {
}
void CConcurrentThroughputTestTaskTester::destroyTestingStructure() {
mProcessUnit->stopProcessing();
mProcessUnit->stopThread();
delete mProcessUnit;
}
cint64 CConcurrentThroughputTestTaskTester::getTaskProcessedCount() {
cint64 totalProcessedCount = mProcessUnit->getTaskProcessingStatistics()->getStatisticTasksProcessedCount();
return totalProcessedCount;
}
void CConcurrentThroughputTestTaskTester::doCallback() {
cint64 elapsedTime = mMeasurementTimer.elapsed();
if (mThreadTestCount == 1) {
mScaleReferenceTime = elapsedTime;
}
if (mScaleReferenceTime == 0) {
mScaleReferenceTime = 1;
}
cint64 eventProcessedCount = 0;
cint64 taskProcessedCount = 0;
if (mThreadTestCount == 1) {
eventProcessedCount += mProcessUnit->getTaskProcessingStatistics()->getStatisticEventsProcessedCount();
taskProcessedCount += mProcessUnit->getTaskProcessingStatistics()->getStatisticTasksProcessedCount();
} else {
eventProcessedCount += mSchedulerUnit->getTaskProcessingStatistics()->getStatisticEventsProcessedCount();
eventProcessedCount += mCompletorUnit->getTaskProcessingStatistics()->getStatisticEventsProcessedCount();
taskProcessedCount += mSchedulerUnit->getTaskProcessingStatistics()->getStatisticTasksProcessedCount();
taskProcessedCount += mCompletorUnit->getTaskProcessingStatistics()->getStatisticTasksProcessedCount();
foreach (CTaskProcessorThread* taskProcUnit, mProcessorUnitList) {
eventProcessedCount += taskProcUnit->getTaskProcessingStatistics()->getStatisticEventsProcessedCount();
taskProcessedCount += taskProcUnit->getTaskProcessingStatistics()->getStatisticTasksProcessedCount();
}
cint64 tmpEventProcessedCount = eventProcessedCount;
eventProcessedCount = tmpEventProcessedCount - mLastEventProcessed;
mLastEventProcessed = tmpEventProcessedCount;
cint64 tmpTaskProcessedCount = taskProcessedCount;
taskProcessedCount = tmpTaskProcessedCount - mLastTaskProcessed;
mLastTaskProcessed = tmpTaskProcessedCount;
}
cout<<mThreadTestCount<<" Threads: \t"<<taskProcessedCount<<" processed Test-Tasks, \t"<<eventProcessedCount<<" processed Events, \t"<<elapsedTime<<" ms, \t"<<(double)mScaleReferenceTime/(double)elapsedTime<<" x\n";
mMeasurementTimer.restart();
if (++mThreadTestCount <= mThreadMaxTestCount) {
if (mThreadTestCount != 2) {
// add task processor
CTaskProcessorThread* taskProcessor = new CTaskProcessorThread(mHandleAlg,mCompletorUnit);
mProcessorUnitList.append(taskProcessor);
taskProcessor->installScheduler(mSchedulerUnit);
taskProcessor->startProcessing();
}
CThroughputTestTask* rootTask = CObjectMemoryPoolAllocator<CThroughputTestTask>::allocateAndConstructWithMemroyPool();
rootTask->initTestTask(mMaxBranchDepth,mBranchingFactor);
rootTask->addCallbackLinker(this);
CTaskEventCommunicator::postSendTaskScheduleEvent(mSchedulerUnit->getEventHandler(),rootTask,nullptr);
}
}
}; // end namespace Test
}; // end namespace Konclude
|
