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
|
/*
* 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 "CDistributionMemoryPoolProvider.h"
namespace Konclude {
namespace Scheduler {
CDistributionMemoryPoolProvider::CDistributionMemoryPoolProvider(CMemoryPoolProvider* alternateMemoryPoolProvider, CDistributionMemoryPoolReleaser* distributionMemoryReleaser) : CSortedLinkerBase<CDistributionMemoryPoolProvider*,CDistributionMemoryPoolProvider,CDistributionMemoryPoolProvider>(this,nullptr) {
mLastPickedDistributedPoolLinker = nullptr;
mDistributedPoolLinker = nullptr;
mAvailablePoolLinker = nullptr;
mAlternateMemoryPoolProvider = alternateMemoryPoolProvider;
mDistributionMemoryReleaser = distributionMemoryReleaser;
mDistributedPoolCount = 0;
mPickedPoolCount = 0;
mAvailablePoolCount = 0;
mAquiredPoolCount = 0;
mLastAcquiredPoolCount = 0;
mLastAcquiredPoolDiff = 0;
mLastSavedMissRatio = 0.;
mLastNewDiffRatio = 0.6;
}
CDistributionMemoryPoolProvider::~CDistributionMemoryPoolProvider() {
}
CDistributionMemoryPoolProvider* CDistributionMemoryPoolProvider::updateMissingMemoryPoolRatio() {
mLastSavedMissRatio = (double)getMemoryPoolSupplyCount()/(double)mLastAcquiredPoolCount;
return this;
}
double CDistributionMemoryPoolProvider::getMissingMemoryPoolRatio() {
return mLastSavedMissRatio;
}
cint64 CDistributionMemoryPoolProvider::getMissingMemoryPoolCount() {
return mLastAcquiredPoolDiff - getMemoryPoolSupplyCount();
}
cint64 CDistributionMemoryPoolProvider::getMemoryPoolSupplyCount() {
return mDistributedPoolCount-mPickedPoolCount+mAvailablePoolCount;
}
CDistributionMemoryPoolProvider* CDistributionMemoryPoolProvider::updatedRoundAcquiredMemoryPoolCounts() {
cint64 roundAcquiredPoolDiff = mAquiredPoolCount - mLastAcquiredPoolCount;
mLastAcquiredPoolCount = mAquiredPoolCount;
mLastAcquiredPoolDiff = roundAcquiredPoolDiff * (1. - mLastNewDiffRatio) + mLastAcquiredPoolDiff * mLastNewDiffRatio;
updateMissingMemoryPoolRatio();
return this;
}
CDistributionMemoryPoolProvider* CDistributionMemoryPoolProvider::appendDistributedMemoryPools(CMemoryPool* memoryPools) {
while (memoryPools) {
CMemoryPool* tmpMemoryPool = memoryPools;
memoryPools = memoryPools->getNext();
if (mDistributedPoolLinker != tmpMemoryPool) {
mDistributedPoolLinker = tmpMemoryPool->setNext(mDistributedPoolLinker);
} else {
// write access to mLastPickedDistributedPoolLinker is safe only in this case
mDistributedPoolLinker = tmpMemoryPool->clearNext();
mLastPickedDistributedPoolLinker = nullptr;
}
++mDistributedPoolCount;
}
return this;
}
bool CDistributionMemoryPoolProvider::checkAppendableDistributedMemoryPools(CMemoryPool* memoryPools) {
CMemoryPool* memoryPoolIt = memoryPools;
while (memoryPoolIt) {
if (memoryPoolIt == mLastPickedDistributedPoolLinker) {
return false;
}
memoryPoolIt = memoryPoolIt->getNextMemoryPool();
}
return true;
}
bool CDistributionMemoryPoolProvider::pickDistributedMemoryPools() {
CMemoryPool* tmpMemoryPoolLinker = mDistributedPoolLinker;
if (tmpMemoryPoolLinker && mLastPickedDistributedPoolLinker != tmpMemoryPoolLinker) {
CMemoryPool* nextTmpMemoryPoolLinker = tmpMemoryPoolLinker;
while (nextTmpMemoryPoolLinker && mLastPickedDistributedPoolLinker != nextTmpMemoryPoolLinker) {
CMemoryPool* addTmpMemoryPoolLinker = nextTmpMemoryPoolLinker;
nextTmpMemoryPoolLinker = nextTmpMemoryPoolLinker->getNext();
mAvailablePoolLinker = addTmpMemoryPoolLinker->setNext(mAvailablePoolLinker);
++mPickedPoolCount;
++mAvailablePoolCount;
}
mLastPickedDistributedPoolLinker = tmpMemoryPoolLinker;
return true;
}
return false;
}
CMemoryPool* CDistributionMemoryPoolProvider::acquireMemoryPool(cint64 minPoolSize) {
CMemoryPool* tmpMemoryPool = nullptr;
++mAquiredPoolCount;
pickDistributedMemoryPools();
if (mAvailablePoolLinker) {
if (mAvailablePoolLinker->getMemoryBlockSize() > minPoolSize) {
tmpMemoryPool = mAvailablePoolLinker;
mAvailablePoolLinker = mAvailablePoolLinker->getNext();
--mAvailablePoolCount;
}
}
if (!tmpMemoryPool) {
tmpMemoryPool = mAlternateMemoryPoolProvider->acquireMemoryPool(minPoolSize);
}
if (tmpMemoryPool) {
tmpMemoryPool->clearNext();
}
return tmpMemoryPool;
}
CDistributionMemoryPoolProvider* CDistributionMemoryPoolProvider::releaseMemoryPool(CMemoryPool* memoryPool) {
if (mDistributionMemoryReleaser) {
mDistributionMemoryReleaser->distributeMemoryPools(memoryPool);
} else {
mAlternateMemoryPoolProvider->releaseMemoryPool(memoryPool);
}
return this;
}
cint64 CDistributionMemoryPoolProvider::getAllocatedReleaseDifferencePoolCount() {
return 0;
}
cint64 CDistributionMemoryPoolProvider::getAllocatedReleaseDifferencePoolSize() {
return 0;
}
}; // end namespace Scheduler
}; // end namespace Konclude
|
