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();
114 model_print("Tuner %u\n", tuner->tunernumber);
116 for (uint j = 0; j < tuner->problems.getSize(); j++) {
117 Problem *problem = tuner->problems.get(j);
118 model_print("Problem %s\n", problem->getProblem());
119 model_print("Time = %lld\n", tuner->getTime(problem));
121 model_print("----------------------------------\n\n\n");
125 void MultiTuner::addTuner(SearchTuner *tuner) {
126 TunerRecord *t = new TunerRecord(tuner);
128 t->tunernumber = allTuners.getSize();
133 void MultiTuner::readData(uint numRuns) {
134 for (uint i = 0; i < numRuns; i++) {
138 snprintf(buffer, sizeof(buffer), "tunernum%u", i);
139 myfile.open (buffer, ios::in);
140 myfile >> tunernumber;
142 if (allTuners.getSize() <= tunernumber)
143 allTuners.setSize(tunernumber + 1);
144 if (allTuners.get(tunernumber) == NULL) {
145 snprintf(buffer, sizeof(buffer), "tuner%u", i);
146 allTuners.set(tunernumber, new TunerRecord(new SearchTuner(buffer)));
148 //Add any new used records
149 snprintf(buffer, sizeof(buffer), "tuner%uused", i);
150 TunerRecord *tuner = allTuners.get(tunernumber);
151 tuner->getTuner()->addUsed(buffer);
153 char problemname[512];
155 snprintf(buffer, sizeof(buffer), "problem%u", i);
156 myfile.open(buffer, ios::in);
157 myfile.getline(problemname, sizeof(problemname));
158 myfile >> problemnumber;
160 if (problems.getSize() <= problemnumber)
161 problems.setSize(problemnumber + 1);
162 if (problems.get(problemnumber) == NULL)
163 problems.set(problemnumber, new Problem(problemname));
164 Problem *problem = problems.get(problemnumber);
165 long long metric = -1;
166 int sat = IS_INDETER;
167 //Read data in from results file
168 snprintf(buffer, sizeof(buffer), "result%u", i);
170 myfile.open (buffer, ios::in);
173 if (myfile.is_open()) {
178 if (problem->result == UNSETVALUE && sat != IS_INDETER) {
179 problem->result = sat;
180 } else if (problem->result != sat && sat != IS_INDETER) {
181 model_print("******** Result has changed ********\n");
185 if (tuner->getTime(problem) == -1)
186 tuner->problems.push(problem);
187 tuner->setTime(problem, metric);
194 long long MultiTuner::evaluate(Problem *problem, TunerRecord *tuner) {
197 snprintf(buffer, sizeof(buffer), "problem%u", execnum);
200 myfile.open (buffer, ios::out);
203 if (myfile.is_open()) {
204 myfile << problem->getProblem() << endl;
205 myfile << problem->problemnumber << endl;
211 snprintf(buffer, sizeof(buffer), "tunernum%u", execnum);
214 myfile.open (buffer, ios::out);
217 if (myfile.is_open()) {
218 myfile << tuner->tunernumber << endl;
223 //Write out the tuner
224 snprintf(buffer, sizeof(buffer), "tuner%u", execnum);
225 tuner->getTuner()->serialize(buffer);
228 uint timeinsecs = problem->besttime / NANOSEC;
229 uint adaptive = (timeinsecs > 30) ? timeinsecs * 5 : 150;
230 uint maxtime = (adaptive < timeout) ? adaptive : timeout;
233 snprintf(buffer, sizeof(buffer), "./run.sh deserializerun %s %u tuner%u result%u > log%u", problem->getProblem(), maxtime, execnum, execnum, execnum);
234 int status = system(buffer);
236 long long metric = -1;
237 int sat = IS_INDETER;
240 //Read data in from results file
241 snprintf(buffer, sizeof(buffer), "result%u", execnum);
244 myfile.open (buffer, ios::in);
247 if (myfile.is_open()) {
252 updateTimeout(problem, metric);
253 snprintf(buffer, sizeof(buffer), "tuner%uused", execnum);
254 tuner->getTuner()->addUsed(buffer);
256 //Increment execution count
259 if (problem->result == UNSETVALUE && sat != IS_INDETER) {
260 problem->result = sat;
261 } else if (problem->result != sat && sat != IS_INDETER) {
262 model_print("******** Result has changed ********\n");
264 if (sat == IS_INDETER && metric != -1) {//The case when we have a timeout
270 void MultiTuner::updateTimeout(Problem *problem, long long metric) {
271 if (metric < problem->besttime) {
272 problem->besttime = metric;
276 void MultiTuner::tuneComp() {
277 Vector<TunerRecord *> *tunerV = new Vector<TunerRecord *>(&tuners);
278 for (uint b = 0; b < budget; b++) {
279 model_print("Round %u of %u\n", b, budget);
280 uint tSize = tunerV->getSize();
281 for (uint i = 0; i < tSize; i++) {
282 SearchTuner *tmpTuner = mutateTuner(tunerV->get(i)->getTuner(), b);
283 TunerRecord *tmp = new TunerRecord(tmpTuner);
284 tmp->tunernumber = allTuners.getSize();
285 model_print("Mutated tuner %u to generate tuner %u\n", tunerV->get(i)->tunernumber, tmp->tunernumber);
290 Hashtable<TunerRecord *, int, uint64_t> scores;
291 for (uint i = 0; i < problems.getSize(); i++) {
292 Problem *problem = problems.get(i);
293 Vector<TunerRecord *> places;
294 for (uint j = 0; j < tunerV->getSize(); j++) {
295 TunerRecord *tuner = tunerV->get(j);
296 long long metric = tuner->getTime(problem);
298 metric = evaluate(problem, tuner);
299 if (tuner->getTime(problem) == -1) {
300 tuner->problems.push(problem);
302 LOG("%u.Problem<%s>\tTuner<%p, %d>\tMetric<%lld>\n", i, problem->problem,tuner, tuner->tunernumber, metric);
303 LOG("*****************************\n");
305 tuner->setTime(problem, metric);
309 for (; k < places.getSize(); k++) {
310 if (metric < places.get(k)->getTime(problem))
313 LOG("place[%u]=Tuner<%p,%d>\n", k, tuner, tuner->tunernumber);
314 places.insertAt(k, tuner);
318 for (uint k = 0; k < places.getSize() && points; k++) {
319 TunerRecord *tuner = places.get(k);
321 if (scores.contains(tuner))
322 currScore = scores.get(tuner);
324 LOG("Problem<%s>\tTuner<%p,%d>\tmetric<%d>\n", problem->problem, tuner, tuner->tunernumber, currScore);
325 LOG("**************************\n");
326 scores.put(tuner, currScore);
330 Vector<TunerRecord *> ranking;
331 for (uint i = 0; i < tunerV->getSize(); i++) {
332 TunerRecord *tuner = tunerV->get(i);
334 if (scores.contains(tuner))
335 score = scores.get(tuner);
337 for (; j < ranking.getSize(); j++) {
338 TunerRecord *t = ranking.get(j);
340 if (scores.contains(t))
341 tscore = scores.get(t);
345 LOG("ranking[%u]=tuner<%p,%u>(Score=%d)\n", j, tuner, tuner->tunernumber, score);
346 LOG("************************\n");
347 ranking.insertAt(j, tuner);
349 LOG("tunerSize=%u\trankingSize=%u\ttunerVSize=%u\n", tuners.getSize(), ranking.getSize(), tunerV->getSize());
350 for (uint i = tuners.getSize(); i < ranking.getSize(); i++) {
351 TunerRecord *tuner = ranking.get(i);
352 LOG("Removing tuner %u\n", tuner->tunernumber);
353 for (uint j = 0; j < tunerV->getSize(); j++) {
354 if (tunerV->get(j) == tuner)
362 void MultiTuner::mapProblemsToTuners(Vector<TunerRecord *> *tunerV) {
363 for (uint i = 0; i < problems.getSize(); i++) {
364 Problem *problem = problems.get(i);
365 TunerRecord *bestTuner = NULL;
366 long long bestscore = 0;
367 for (uint j = 0; j < tunerV->getSize(); j++) {
368 TunerRecord *tuner = tunerV->get(j);
369 long long metric = tuner->getTime(problem);
371 metric = evaluate(problem, tuner);
373 tuner->setTime(problem, metric);
375 if ((bestTuner == NULL && metric != -1) ||
376 (metric < bestscore && metric != -1)) {
381 if (bestTuner != NULL)
382 bestTuner->problems.push(problem);
386 void clearVector(Vector<TunerRecord *> *tunerV) {
387 for (uint j = 0; j < tunerV->getSize(); j++) {
388 TunerRecord *tuner = tunerV->get(j);
389 tuner->problems.clear();
393 void MultiTuner::tuneK() {
394 Vector<TunerRecord *> *tunerV = new Vector<TunerRecord *>(&tuners);
395 for (uint i = 0; i < rounds; i++) {
397 mapProblemsToTuners(tunerV);
398 improveTuners(tunerV);
400 model_print("Best tuners\n");
401 for (uint j = 0; j < tunerV->getSize(); j++) {
402 TunerRecord *tuner = tunerV->get(j);
404 sprintf(buffer, "tuner%u.conf", j);
405 tuner->getTuner()->serialize(buffer);
406 tuner->getTuner()->print();
411 void MultiTuner::improveTuners(Vector<TunerRecord *> *tunerV) {
412 for (uint j = 0; j < tunerV->getSize(); j++) {
413 TunerRecord *tuner = tunerV->get(j);
414 TunerRecord *newtuner = tune(tuner);
415 tunerV->set(j, newtuner);
419 double MultiTuner::evaluateAll(TunerRecord *tuner) {
421 for (uint i = 0; i < tuner->problems.getSize(); i++) {
422 Problem *problem = tuner->problems.get(i);
423 long long metric = tuner->getTime(problem);
425 metric = evaluate(problem, tuner);
427 tuner->setTime(problem, metric);
430 double score = metric;
433 return pow(product, 1 / ((double)tuner->problems.getSize()));
436 SearchTuner *MultiTuner::mutateTuner(SearchTuner *oldTuner, uint k) {
437 SearchTuner *newTuner = oldTuner->copyUsed();
438 uint numSettings = oldTuner->getSize();
439 uint settingsToMutate = (uint)(AUTOTUNERFACTOR * (((double)numSettings) * (budget - k)) / (budget));
440 if (settingsToMutate < 1)
441 settingsToMutate = 1;
442 model_print("Mutating %u settings\n", settingsToMutate);
443 while (settingsToMutate-- != 0) {
444 newTuner->randomMutate();
449 TunerRecord *MultiTuner::tune(TunerRecord *tuner) {
450 TunerRecord *bestTuner = NULL;
451 double bestScore = DBL_MAX;
453 TunerRecord *oldTuner = tuner;
454 double base_temperature = evaluateAll(oldTuner);
455 double oldScore = base_temperature;
457 for (uint i = 0; i < budget; i++) {
458 SearchTuner *tmpTuner = mutateTuner(oldTuner->getTuner(), i);
459 TunerRecord *newTuner = oldTuner->changeTuner(tmpTuner);
460 newTuner->tunernumber = allTuners.getSize();
461 allTuners.push(newTuner);
462 double newScore = evaluateAll(newTuner);
463 newTuner->tuner->printUsed();
464 model_print("Received score %f\n", newScore);
465 double scoreDiff = newScore - oldScore; //smaller is better
466 if (newScore < bestScore) {
467 bestScore = newScore;
468 bestTuner = newTuner;
475 double currTemp = base_temperature * (((double)budget - i) / budget);
476 acceptanceP = exp(-scoreDiff / currTemp);
478 double ran = ((double)random()) / RAND_MAX;
479 if (ran <= acceptanceP) {