1 #include "multituner.h"
3 #include "searchtuner.h"
14 Problem::Problem(const char *_problem) :
19 uint len = strlen(_problem);
20 problem = (char *) ourmalloc(len + 1);
21 memcpy(problem, _problem, len + 1);
28 void TunerRecord::setTime(Problem *problem, long long time) {
29 timetaken.put(problem, time);
32 long long TunerRecord::getTime(Problem *problem) {
33 if (timetaken.contains(problem))
34 return timetaken.get(problem);
38 TunerRecord *TunerRecord::changeTuner(SearchTuner *_newtuner) {
39 TunerRecord *tr = new TunerRecord(_newtuner);
40 for (uint i = 0; i < problems.getSize(); i++) {
41 tr->problems.push(problems.get(i));
46 MultiTuner::MultiTuner(uint _budget, uint _rounds, uint _timeout) :
47 budget(_budget), rounds(_rounds), timeout(_timeout), execnum(0) {
50 MultiTuner::~MultiTuner() {
51 for (uint i = 0; i < problems.getSize(); i++)
52 ourfree(problems.get(i));
53 for (uint i = 0; i < allTuners.getSize(); i++)
54 delete allTuners.get(i);
57 void MultiTuner::addProblem(const char *filename) {
58 Problem *p = new Problem(filename);
59 p->problemnumber = problems.getSize();
63 void MultiTuner::printData() {
64 model_print("*********** DATA DUMP ***********\n");
65 for (uint i = 0; i < allTuners.getSize(); i++) {
66 TunerRecord *tuner = allTuners.get(i);
67 SearchTuner *stun = tuner->getTuner();
68 model_print("Tuner %u\n", i);
70 model_print("----------------------------------\n\n\n");
71 for (uint j = 0; j < tuner->problems.getSize(); j++) {
72 Problem *problem = tuner->problems.get(j);
73 model_print("Problem %s\n", problem->getProblem());
74 model_print("Time = %lld\n", tuner->getTime(problem));
79 void MultiTuner::findBestThreeTuners() {
80 if (allTuners.getSize() < 3) {
84 TunerRecord *bestTuners[3];
85 double score = DBL_MAX;
86 for (uint i = 0; i < allTuners.getSize() - 2; i++) {
87 for (uint j = i + 1; j < allTuners.getSize() - 1; j++) {
88 for (uint k = j + 1; k < allTuners.getSize(); k++) {
89 TunerRecord *tuner1 = allTuners.get(i);
90 TunerRecord *tuner2 = allTuners.get(j);
91 TunerRecord *tuner3 = allTuners.get(k);
92 double mintimes[problems.getSize()];
93 for (uint l = 0; l < problems.getSize(); l++) {
94 Problem *problem = problems.get(l);
95 mintimes[l] = pow(min(tuner1->getTime(problem), tuner2->getTime(problem), tuner3->getTime(problem)), (double)1 / problems.getSize());
98 for (uint l = 0; l < problems.getSize(); l++) {
99 result *= mintimes[l];
101 if (result < score) {
103 bestTuners[0] = tuner1;
104 bestTuners[1] = tuner2;
105 bestTuners[2] = tuner3;
110 model_print("Best 3 tuners:\n");
111 for (uint i = 0; i < 3; i++) {
112 TunerRecord *tuner = bestTuners[i];
113 SearchTuner *stun = tuner->getTuner();
115 snprintf(buffer, sizeof(buffer), "best%u.tuner", i);
116 stun->serialize(buffer);
117 model_print("Tuner %u\n", tuner->tunernumber);
119 for (uint j = 0; j < tuner->problems.getSize(); j++) {
120 Problem *problem = tuner->problems.get(j);
121 model_print("Problem %s\n", problem->getProblem());
122 model_print("Time = %lld\n", tuner->getTime(problem));
124 model_print("----------------------------------\n\n\n");
128 void MultiTuner::addTuner(SearchTuner *tuner) {
129 TunerRecord *t = new TunerRecord(tuner);
131 t->tunernumber = allTuners.getSize();
136 void MultiTuner::readData(uint numRuns) {
137 for (uint i = 0; i < numRuns; i++) {
141 snprintf(buffer, sizeof(buffer), "tunernum%u", i);
142 myfile.open (buffer, ios::in);
143 myfile >> tunernumber;
145 if (allTuners.getSize() <= tunernumber)
146 allTuners.setSize(tunernumber + 1);
147 if (allTuners.get(tunernumber) == NULL) {
148 snprintf(buffer, sizeof(buffer), "tuner%u", i);
149 allTuners.set(tunernumber, new TunerRecord(new SearchTuner(buffer), tunernumber));
151 //Add any new used records
152 snprintf(buffer, sizeof(buffer), "tuner%uused", i);
153 TunerRecord *tuner = allTuners.get(tunernumber);
154 tuner->getTuner()->addUsed(buffer);
156 char problemname[512];
158 snprintf(buffer, sizeof(buffer), "problem%u", i);
159 myfile.open(buffer, ios::in);
160 myfile.getline(problemname, sizeof(problemname));
161 myfile >> problemnumber;
163 if (problems.getSize() <= problemnumber)
164 problems.setSize(problemnumber + 1);
165 if (problems.get(problemnumber) == NULL)
166 problems.set(problemnumber, new Problem(problemname));
167 Problem *problem = problems.get(problemnumber);
168 long long metric = -1;
169 int sat = IS_INDETER;
170 //Read data in from results file
171 snprintf(buffer, sizeof(buffer), "result%u", i);
173 myfile.open (buffer, ios::in);
176 if (myfile.is_open()) {
181 if (problem->result == UNSETVALUE && sat != IS_INDETER) {
182 problem->result = sat;
183 } else if (problem->result != sat && sat != IS_INDETER) {
184 model_print("******** Result has changed ********\n");
188 if (tuner->getTime(problem) == -1)
189 tuner->problems.push(problem);
190 tuner->setTime(problem, metric);
197 long long MultiTuner::evaluate(Problem *problem, TunerRecord *tuner) {
200 snprintf(buffer, sizeof(buffer), "problem%u", execnum);
203 myfile.open (buffer, ios::out);
206 if (myfile.is_open()) {
207 myfile << problem->getProblem() << endl;
208 myfile << problem->problemnumber << endl;
214 snprintf(buffer, sizeof(buffer), "tunernum%u", execnum);
217 myfile.open (buffer, ios::out);
220 if (myfile.is_open()) {
221 myfile << tuner->tunernumber << endl;
226 //Write out the tuner
227 snprintf(buffer, sizeof(buffer), "tuner%u", execnum);
228 tuner->getTuner()->serialize(buffer);
231 uint timeinsecs = problem->besttime / NANOSEC;
232 uint adaptive = (timeinsecs > 30) ? timeinsecs * 5 : 150;
233 uint maxtime = (adaptive < timeout) ? adaptive : timeout;
236 snprintf(buffer, sizeof(buffer), "./run.sh deserializerun %s %u tuner%u result%u > log%u", problem->getProblem(), maxtime, execnum, execnum, execnum);
237 int status = system(buffer);
239 long long metric = -1;
240 int sat = IS_INDETER;
243 //Read data in from results file
244 snprintf(buffer, sizeof(buffer), "result%u", execnum);
247 myfile.open (buffer, ios::in);
250 if (myfile.is_open()) {
255 updateTimeout(problem, metric);
256 snprintf(buffer, sizeof(buffer), "tuner%uused", execnum);
257 tuner->getTuner()->addUsed(buffer);
259 //Increment execution count
262 if (problem->result == UNSETVALUE && sat != IS_INDETER) {
263 problem->result = sat;
264 } else if (problem->result != sat && sat != IS_INDETER) {
265 model_print("******** Result has changed ********\n");
267 if (sat == IS_INDETER && metric != -1) {//The case when we have a timeout
273 void MultiTuner::updateTimeout(Problem *problem, long long metric) {
274 if (metric < problem->besttime) {
275 problem->besttime = metric;
279 void MultiTuner::tuneComp() {
280 Vector<TunerRecord *> *tunerV = new Vector<TunerRecord *>(&tuners);
281 for (uint b = 0; b < budget; b++) {
282 model_print("Round %u of %u\n", b, budget);
283 uint tSize = tunerV->getSize();
284 for (uint i = 0; i < tSize; i++) {
285 SearchTuner *tmpTuner = mutateTuner(tunerV->get(i)->getTuner(), b);
286 TunerRecord *tmp = new TunerRecord(tmpTuner);
287 tmp->tunernumber = allTuners.getSize();
288 model_print("Mutated tuner %u to generate tuner %u\n", tunerV->get(i)->tunernumber, tmp->tunernumber);
293 Hashtable<TunerRecord *, int, uint64_t> scores;
294 for (uint i = 0; i < problems.getSize(); i++) {
295 Problem *problem = problems.get(i);
296 Vector<TunerRecord *> places;
297 for (uint j = 0; j < tunerV->getSize(); j++) {
298 TunerRecord *tuner = tunerV->get(j);
299 long long metric = tuner->getTime(problem);
301 metric = evaluate(problem, tuner);
302 if (tuner->getTime(problem) == -1) {
303 tuner->problems.push(problem);
305 model_print("%u.Problem<%s>\tTuner<%p, %d>\tMetric<%lld>\n", i, problem->problem,tuner, tuner->tunernumber, metric);
306 model_print("*****************************\n");
308 tuner->setTime(problem, metric);
310 tuner->setTime(problem, -2);
314 for (; k < places.getSize(); k++) {
315 if (metric < places.get(k)->getTime(problem))
318 model_print("place[%u]=Tuner<%p,%d>\n", k, tuner, tuner->tunernumber);
319 places.insertAt(k, tuner);
323 for (uint k = 0; k < places.getSize() && points; k++) {
324 TunerRecord *tuner = places.get(k);
326 if (scores.contains(tuner))
327 currScore = scores.get(tuner);
329 model_print("Problem<%s>\tTuner<%p,%d>\tmetric<%d>\n", problem->problem, tuner, tuner->tunernumber, currScore);
330 model_print("**************************\n");
331 scores.put(tuner, currScore);
335 Vector<TunerRecord *> ranking;
336 for (uint i = 0; i < tunerV->getSize(); i++) {
337 TunerRecord *tuner = tunerV->get(i);
339 if (scores.contains(tuner))
340 score = scores.get(tuner);
342 for (; j < ranking.getSize(); j++) {
343 TunerRecord *t = ranking.get(j);
345 if (scores.contains(t))
346 tscore = scores.get(t);
350 model_print("ranking[%u]=tuner<%p,%u>(Score=%d)\n", j, tuner, tuner->tunernumber, score);
351 model_print("************************\n");
352 ranking.insertAt(j, tuner);
354 model_print("tunerSize=%u\trankingSize=%u\ttunerVSize=%u\n", tuners.getSize(), ranking.getSize(), tunerV->getSize());
355 for (uint i = tuners.getSize(); i < ranking.getSize(); i++) {
356 TunerRecord *tuner = ranking.get(i);
357 model_print("Removing tuner %u\n", tuner->tunernumber);
358 for (uint j = 0; j < tunerV->getSize(); j++) {
359 if (tunerV->get(j) == tuner)
367 void MultiTuner::mapProblemsToTuners(Vector<TunerRecord *> *tunerV) {
368 for (uint i = 0; i < problems.getSize(); i++) {
369 Problem *problem = problems.get(i);
370 TunerRecord *bestTuner = NULL;
371 long long bestscore = 0;
372 for (uint j = 0; j < tunerV->getSize(); j++) {
373 TunerRecord *tuner = tunerV->get(j);
374 long long metric = tuner->getTime(problem);
376 metric = evaluate(problem, tuner);
378 tuner->setTime(problem, metric);
380 tuner->setTime(problem, -2);
382 if ((bestTuner == NULL && metric >= 0) ||
383 (metric < bestscore && metric >= 0)) {
388 if (bestTuner != NULL)
389 bestTuner->problems.push(problem);
393 void clearVector(Vector<TunerRecord *> *tunerV) {
394 for (uint j = 0; j < tunerV->getSize(); j++) {
395 TunerRecord *tuner = tunerV->get(j);
396 tuner->problems.clear();
400 void MultiTuner::tuneK() {
401 Vector<TunerRecord *> *tunerV = new Vector<TunerRecord *>(&tuners);
402 for (uint i = 0; i < rounds; i++) {
404 mapProblemsToTuners(tunerV);
405 improveTuners(tunerV);
407 model_print("Best tuners\n");
408 for (uint j = 0; j < tunerV->getSize(); j++) {
409 TunerRecord *tuner = tunerV->get(j);
411 sprintf(buffer, "tuner%u.conf", j);
412 tuner->getTuner()->serialize(buffer);
413 tuner->getTuner()->print();
418 void MultiTuner::improveTuners(Vector<TunerRecord *> *tunerV) {
419 for (uint j = 0; j < tunerV->getSize(); j++) {
420 TunerRecord *tuner = tunerV->get(j);
421 TunerRecord *newtuner = tune(tuner);
422 tunerV->set(j, newtuner);
426 double MultiTuner::evaluateAll(TunerRecord *tuner) {
428 for (uint i = 0; i < tuner->problems.getSize(); i++) {
429 Problem *problem = tuner->problems.get(i);
430 long long metric = tuner->getTime(problem);
432 metric = evaluate(problem, tuner);
434 tuner->setTime(problem, metric);
436 tuner->setTime(problem, -2);
439 double score = metric;
444 return pow(product, 1 / ((double)tuner->problems.getSize()));
447 SearchTuner *MultiTuner::mutateTuner(SearchTuner *oldTuner, uint k) {
448 SearchTuner *newTuner = oldTuner->copyUsed();
449 uint numSettings = oldTuner->getSize();
450 uint settingsToMutate = (uint)(AUTOTUNERFACTOR * (((double)numSettings) * (budget - k)) / (budget));
451 if (settingsToMutate < 1)
452 settingsToMutate = 1;
453 model_print("Mutating %u settings\n", settingsToMutate);
454 while (settingsToMutate-- != 0) {
455 newTuner->randomMutate();
460 TunerRecord *MultiTuner::tune(TunerRecord *tuner) {
461 TunerRecord *bestTuner = NULL;
462 double bestScore = DBL_MAX;
464 TunerRecord *oldTuner = tuner;
465 double base_temperature = evaluateAll(oldTuner);
466 double oldScore = base_temperature;
468 for (uint i = 0; i < budget; i++) {
469 SearchTuner *tmpTuner = mutateTuner(oldTuner->getTuner(), i);
470 TunerRecord *newTuner = oldTuner->changeTuner(tmpTuner);
471 newTuner->tunernumber = allTuners.getSize();
472 allTuners.push(newTuner);
473 double newScore = evaluateAll(newTuner);
474 newTuner->tuner->printUsed();
475 model_print("Received score %f\n", newScore);
476 double scoreDiff = newScore - oldScore; //smaller is better
477 if (newScore < bestScore) {
478 bestScore = newScore;
479 bestTuner = newTuner;
486 double currTemp = base_temperature * (((double)budget - i) / budget);
487 acceptanceP = exp(-scoreDiff / currTemp);
489 double ran = ((double)random()) / RAND_MAX;
490 if (ran <= acceptanceP) {