1 #include "multituner.h"
3 #include "searchtuner.h"
13 Problem::Problem(const char *_problem) : result(UNSETVALUE) {
14 uint len = strlen(_problem);
15 problem = (char *) ourmalloc(len + 1);
16 memcpy(problem, _problem, len + 1);
23 void TunerRecord::setTime(Problem *problem, long long time) {
24 timetaken.put(problem, time);
27 long long TunerRecord::getTime(Problem *problem) {
28 if (timetaken.contains(problem))
29 return timetaken.get(problem);
33 TunerRecord *TunerRecord::changeTuner(SearchTuner *_newtuner) {
34 TunerRecord *tr = new TunerRecord(_newtuner);
35 for (uint i = 0; i < problems.getSize(); i++) {
36 tr->problems.push(problems.get(i));
41 MultiTuner::MultiTuner(uint _budget, uint _rounds, uint _timeout) :
42 budget(_budget), rounds(_rounds), timeout(_timeout), execnum(0) {
45 MultiTuner::~MultiTuner() {
46 for (uint i = 0; i < problems.getSize(); i++)
47 ourfree(problems.get(i));
48 for (uint i = 0; i < allTuners.getSize(); i++)
49 delete allTuners.get(i);
52 void MultiTuner::addProblem(const char *filename) {
53 problems.push(new Problem(filename));
56 void MultiTuner::printData() {
57 model_print("*********** DATA DUMP ***********\n");
58 for (uint i = 0; i < allTuners.getSize(); i++) {
59 TunerRecord *tuner = allTuners.get(i);
60 SearchTuner *stun = tuner->getTuner();
61 model_print("Tuner %u\n", i);
63 model_print("----------------------------------\n\n\n");
64 for (uint j = 0; j < tuner->problems.getSize(); j++) {
65 Problem *problem = tuner->problems.get(j);
66 model_print("Problem %s\n", problem->getProblem());
67 model_print("Time = %lld\n", tuner->getTime(problem));
72 void MultiTuner::addTuner(SearchTuner *tuner) {
73 TunerRecord *t = new TunerRecord(tuner);
78 long long MultiTuner::evaluate(Problem *problem, TunerRecord *tuner) {
81 snprintf(buffer, sizeof(buffer), "problem%u", execnum);
84 myfile.open (buffer, ios::out);
87 if (myfile.is_open()) {
88 myfile << problem->getProblem() << endl;
94 snprintf(buffer, sizeof(buffer), "tuner%u", execnum);
95 tuner->getTuner()->serialize(buffer);
98 snprintf(buffer, sizeof(buffer), "./run.sh deserializerun %s %u tuner%u result%u > log%u", problem->getProblem(), timeout, execnum, execnum, execnum);
99 int status = system(buffer);
101 long long metric = -1;
102 int sat = IS_INDETER;
105 //Read data in from results file
106 snprintf(buffer, sizeof(buffer), "result%u", execnum);
109 myfile.open (buffer, ios::in);
112 if (myfile.is_open()) {
118 snprintf(buffer, sizeof(buffer), "tuner%uused", execnum);
119 tuner->getTuner()->addUsed(buffer);
121 //Increment execution count
124 if (problem->result == UNSETVALUE && sat != IS_INDETER) {
125 problem->result = sat;
126 } else if (problem->result != sat && sat != IS_INDETER) {
127 model_print("******** Result has changed ********\n");
132 void MultiTuner::tuneComp() {
133 Vector<TunerRecord *> *tunerV = new Vector<TunerRecord *>(&tuners);
134 for (uint b = 0; b < budget; b++) {
135 uint tSize = tunerV->getSize();
136 for (uint i = 0; i < tSize; i++) {
137 SearchTuner *tmpTuner = mutateTuner(tunerV->get(i)->getTuner(), b);
138 TunerRecord *tmp = new TunerRecord(tmpTuner);
143 Hashtable<TunerRecord *, int, uint64_t> scores;
144 for (uint i = 0; i < problems.getSize(); i++) {
145 Problem *problem = problems.get(i);
146 Vector<TunerRecord *> places;
147 for (uint j = 0; j < tunerV->getSize(); j++) {
148 TunerRecord *tuner = tunerV->get(j);
149 long long metric = tuner->getTime(problem);
151 metric = evaluate(problem, tuner);
153 tuner->setTime(problem, metric);
157 for (; k < places.getSize(); k++) {
158 if (metric < places.get(k)->getTime(problem))
161 places.insertAt(k, tuner);
165 for (uint k = 0; k < places.getSize() && points; k++) {
166 TunerRecord *tuner = places.get(k);
169 if (scores.contains(tuner))
170 currScore = scores.get(tuner);
172 scores.put(tuner, currScore);
175 Vector<TunerRecord *> ranking;
176 for (uint i = 0; i < tunerV->getSize(); i++) {
177 TunerRecord *tuner = tunerV->get(i);
179 if (scores.contains(tuner))
180 score = scores.get(tuner);
182 for (; j < ranking.getSize(); j++) {
183 TunerRecord *t = ranking.get(j);
185 if (scores.contains(t))
186 tscore = scores.get(t);
190 ranking.insertAt(j, tuner);
192 for (uint i = tuners.getSize(); i < ranking.getSize(); i++) {
193 TunerRecord *tuner = ranking.get(i);
194 for (uint j = 0; j < tunerV->getSize(); j++) {
195 if (tunerV->get(j) == tuner)
203 void MultiTuner::mapProblemsToTuners(Vector<TunerRecord *> *tunerV) {
204 for (uint i = 0; i < problems.getSize(); i++) {
205 Problem *problem = problems.get(i);
206 TunerRecord *bestTuner = NULL;
207 long long bestscore = 0;
208 for (uint j = 0; j < tunerV->getSize(); j++) {
209 TunerRecord *tuner = tunerV->get(j);
210 long long metric = tuner->getTime(problem);
212 metric = evaluate(problem, tuner);
214 tuner->setTime(problem, metric);
216 if ((bestTuner == NULL && metric != -1) ||
217 (metric < bestscore && metric != -1)) {
222 if (bestTuner != NULL)
223 bestTuner->problems.push(problem);
227 void clearVector(Vector<TunerRecord *> *tunerV) {
228 for (uint j = 0; j < tunerV->getSize(); j++) {
229 TunerRecord *tuner = tunerV->get(j);
230 tuner->problems.clear();
234 void MultiTuner::tuneK() {
235 Vector<TunerRecord *> *tunerV = new Vector<TunerRecord *>(&tuners);
236 for (uint i = 0; i < rounds; i++) {
238 mapProblemsToTuners(tunerV);
239 improveTuners(tunerV);
241 model_print("Best tuners\n");
242 for (uint j = 0; j < tunerV->getSize(); j++) {
243 TunerRecord *tuner = tunerV->get(j);
245 sprintf(buffer, "tuner%u.conf", j);
246 tuner->getTuner()->serialize(buffer);
247 tuner->getTuner()->print();
252 void MultiTuner::improveTuners(Vector<TunerRecord *> *tunerV) {
253 for (uint j = 0; j < tunerV->getSize(); j++) {
254 TunerRecord *tuner = tunerV->get(j);
255 TunerRecord *newtuner = tune(tuner);
256 tunerV->set(j, newtuner);
260 double MultiTuner::evaluateAll(TunerRecord *tuner) {
262 for (uint i = 0; i < tuner->problems.getSize(); i++) {
263 Problem *problem = tuner->problems.get(i);
264 long long metric = tuner->getTime(problem);
266 metric = evaluate(problem, tuner);
268 tuner->setTime(problem, metric);
271 double score = metric;
274 return pow(product, 1 / ((double)tuner->problems.getSize()));
277 SearchTuner *MultiTuner::mutateTuner(SearchTuner *oldTuner, uint k) {
278 SearchTuner *newTuner = oldTuner->copyUsed();
279 uint numSettings = oldTuner->getSize();
280 uint settingsToMutate = (uint)(AUTOTUNERFACTOR * (((double)numSettings) * (budget - k)) / (budget));
281 if (settingsToMutate < 1)
282 settingsToMutate = 1;
283 model_print("Mutating %u settings\n", settingsToMutate);
284 while (settingsToMutate-- != 0) {
285 newTuner->randomMutate();
290 TunerRecord *MultiTuner::tune(TunerRecord *tuner) {
291 TunerRecord *bestTuner = NULL;
292 double bestScore = DBL_MAX;
294 TunerRecord *oldTuner = tuner;
295 double base_temperature = evaluateAll(oldTuner);
296 double oldScore = base_temperature;
298 for (uint i = 0; i < budget; i++) {
299 SearchTuner *tmpTuner = mutateTuner(oldTuner->getTuner(), i);
300 TunerRecord *newTuner = oldTuner->changeTuner(tmpTuner);
301 allTuners.push(newTuner);
302 double newScore = evaluateAll(newTuner);
303 newTuner->tuner->printUsed();
304 model_print("Received score %f\n", newScore);
305 double scoreDiff = newScore - oldScore; //smaller is better
306 if (newScore < bestScore) {
307 bestScore = newScore;
308 bestTuner = newTuner;
315 double currTemp = base_temperature * (((double)budget - i) / budget);
316 acceptanceP = exp(-scoreDiff / currTemp);
318 double ran = ((double)random()) / RAND_MAX;
319 if (ran <= acceptanceP) {