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
|
/*
* 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/>.
*
*/
#ifndef KONCLUDE_SCHEDULER_CDISTRIBUTIONMEMORYPOOLPROVIDER_H
#define KONCLUDE_SCHEDULER_CDISTRIBUTIONMEMORYPOOLPROVIDER_H
// Libraries includes
// Namespace includes
#include "SchedulerSettings.h"
#include "CDistributionMemoryPoolReleaser.h"
// Other includes
#include "Utilities/Memory/CMemoryPoolProvider.h"
#include "Utilities/Container/CSortedLinker.h"
// Logger includes
#include "Logger/CLogger.h"
namespace Konclude {
using namespace Utilities;
using namespace Utilities::Memory;
using namespace Utilities::Container;
namespace Scheduler {
/*!
*
* \class CDistributionMemoryPoolProvider
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
class CDistributionMemoryPoolProvider : public CSortedLinkerBase<CDistributionMemoryPoolProvider*,CDistributionMemoryPoolProvider,CDistributionMemoryPoolProvider>, public CMemoryPoolProvider {
// public methods
public:
//! Constructor
CDistributionMemoryPoolProvider(CMemoryPoolProvider* alternateMemoryPoolProvider, CDistributionMemoryPoolReleaser* distributionMemoryReleaser);
//! Destructor
virtual ~CDistributionMemoryPoolProvider();
virtual CMemoryPool* acquireMemoryPool(cint64 minPoolSize);
virtual CDistributionMemoryPoolProvider* releaseMemoryPool(CMemoryPool* memoryPool);
virtual CDistributionMemoryPoolProvider* appendDistributedMemoryPools(CMemoryPool* memoryPools);
virtual bool checkAppendableDistributedMemoryPools(CMemoryPool* memoryPools);
virtual double getMissingMemoryPoolRatio();
virtual cint64 getMissingMemoryPoolCount();
virtual cint64 getMemoryPoolSupplyCount();
virtual CDistributionMemoryPoolProvider* updateMissingMemoryPoolRatio();
virtual CDistributionMemoryPoolProvider* updatedRoundAcquiredMemoryPoolCounts();
static inline bool sortedLinkerDataCompare(CDistributionMemoryPoolProvider* const & beforeData1, CDistributionMemoryPoolProvider* const & data2) {
return beforeData1->getMissingMemoryPoolRatio() < data2->getMissingMemoryPoolRatio();
}
cint64 getAllocatedReleaseDifferencePoolCount();
cint64 getAllocatedReleaseDifferencePoolSize();
// protected methods
protected:
bool pickDistributedMemoryPools();
// protected variables
protected:
CMemoryPoolProvider* mAlternateMemoryPoolProvider;
CDistributionMemoryPoolReleaser* mDistributionMemoryReleaser;
CMemoryPool* mAvailablePoolLinker;
CMemoryPool* mDistributedPoolLinker;
CMemoryPool* mLastPickedDistributedPoolLinker;
cint64 mDistributedPoolCount;
cint64 mPickedPoolCount;
cint64 mAvailablePoolCount;
cint64 mAquiredPoolCount;
cint64 mLastAcquiredPoolCount;
cint64 mLastAcquiredPoolDiff;
double mLastSavedMissRatio;
double mLastNewDiffRatio;
// private methods
private:
// private variables
private:
};
}; // end namespace Scheduler
}; // end namespace Konclude
#endif // KONCLUDE_SCHEDULER_CDISTRIBUTIONMEMORYPOOLPROVIDER_H
|
