#include <string.h>
#include <iostream>
#include <fstream>
+#include <limits>
#define UNSETVALUE -1
-Problem::Problem(const char *_problem) : problemnumber(-1), result(UNSETVALUE) {
+Problem::Problem(const char *_problem) :
+ problemnumber(-1),
+ result(UNSETVALUE),
+ besttime(LLONG_MAX)
+{
uint len = strlen(_problem);
problem = (char *) ourmalloc(len + 1);
memcpy(problem, _problem, len + 1);
}
}
+void MultiTuner::findBestThreeTuners() {
+ if (allTuners.getSize() < 3) {
+ printData();
+ return;
+ }
+ TunerRecord *bestTuners[3];
+ double score = DBL_MAX;
+ for (uint i = 0; i < allTuners.getSize() - 2; i++) {
+ for (uint j = i + 1; j < allTuners.getSize() - 1; j++) {
+ for (uint k = j + 1; k < allTuners.getSize(); k++) {
+ TunerRecord *tuner1 = allTuners.get(i);
+ TunerRecord *tuner2 = allTuners.get(j);
+ TunerRecord *tuner3 = allTuners.get(k);
+ double mintimes[problems.getSize()];
+ for (uint l = 0; l < problems.getSize(); l++) {
+ Problem *problem = problems.get(l);
+ mintimes[l] = pow(min(tuner1->getTime(problem), tuner2->getTime(problem), tuner3->getTime(problem)), (double)1 / problems.getSize());
+ }
+ double result = 1;
+ for (uint l = 0; l < problems.getSize(); l++) {
+ result *= mintimes[l];
+ }
+ if (result < score) {
+ score = result;
+ bestTuners[0] = tuner1;
+ bestTuners[1] = tuner2;
+ bestTuners[2] = tuner3;
+ }
+ }
+ }
+ }
+ model_print("Best 3 tuners:\n");
+ for (uint i = 0; i < 3; i++) {
+ TunerRecord *tuner = bestTuners[i];
+ SearchTuner *stun = tuner->getTuner();
+ char buffer[512];
+ snprintf(buffer, sizeof(buffer), "best%u.tuner", i);
+ stun->serialize(buffer);
+ model_print("Tuner %u\n", tuner->tunernumber);
+ stun->print();
+ for (uint j = 0; j < tuner->problems.getSize(); j++) {
+ Problem *problem = tuner->problems.get(j);
+ model_print("Problem %s\n", problem->getProblem());
+ model_print("Time = %lld\n", tuner->getTime(problem));
+ }
+ model_print("----------------------------------\n\n\n");
+ }
+}
+
void MultiTuner::addTuner(SearchTuner *tuner) {
TunerRecord *t = new TunerRecord(tuner);
tuners.push(t);
allTuners.setSize(tunernumber + 1);
if (allTuners.get(tunernumber) == NULL) {
snprintf(buffer, sizeof(buffer), "tuner%u", i);
- allTuners.set(tunernumber, new TunerRecord(new SearchTuner(buffer)));
+ allTuners.set(tunernumber, new TunerRecord(new SearchTuner(buffer), tunernumber));
}
//Add any new used records
snprintf(buffer, sizeof(buffer), "tuner%uused", i);
snprintf(buffer, sizeof(buffer), "tuner%u", execnum);
tuner->getTuner()->serialize(buffer);
+ //compute timeout
+ uint timeinsecs = problem->besttime / NANOSEC;
+ uint adaptive = (timeinsecs > 30) ? timeinsecs * 5 : 150;
+ uint maxtime = (adaptive < timeout) ? adaptive : timeout;
+
//Do run
- snprintf(buffer, sizeof(buffer), "./run.sh deserializerun %s %u tuner%u result%u > log%u", problem->getProblem(), timeout, execnum, execnum, execnum);
+ snprintf(buffer, sizeof(buffer), "./run.sh deserializerun %s %u tuner%u result%u > log%u", problem->getProblem(), maxtime, execnum, execnum, execnum);
int status = system(buffer);
long long metric = -1;
myfile >> sat;
myfile.close();
}
-
+ updateTimeout(problem, metric);
snprintf(buffer, sizeof(buffer), "tuner%uused", execnum);
tuner->getTuner()->addUsed(buffer);
}
} else if (problem->result != sat && sat != IS_INDETER) {
model_print("******** Result has changed ********\n");
}
+ if (sat == IS_INDETER && metric != -1) {//The case when we have a timeout
+ metric = -1;
+ }
return metric;
}
+void MultiTuner::updateTimeout(Problem *problem, long long metric) {
+ if (metric < problem->besttime) {
+ problem->besttime = metric;
+ }
+}
+
void MultiTuner::tuneComp() {
Vector<TunerRecord *> *tunerV = new Vector<TunerRecord *>(&tuners);
for (uint b = 0; b < budget; b++) {
if (tuner->getTime(problem) == -1) {
tuner->problems.push(problem);
}
- DEBUG("%u.Problem<%s>\tTuner<%p>\tMetric<%lld>\n", i, problem->problem,tuner, metric);
- DEBUG("*****************************\n");
+ model_print("%u.Problem<%s>\tTuner<%p, %d>\tMetric<%lld>\n", i, problem->problem,tuner, tuner->tunernumber, metric);
+ model_print("*****************************\n");
if (metric != -1)
tuner->setTime(problem, metric);
+ else
+ tuner->setTime(problem, -2);
}
- if (metric != -1) {
+ if (metric >= 0) {
uint k = 0;
for (; k < places.getSize(); k++) {
if (metric < places.get(k)->getTime(problem))
break;
}
- DEBUG("place[%u]=Tuner<%p>\n", k, tuner);
+ model_print("place[%u]=Tuner<%p,%d>\n", k, tuner, tuner->tunernumber);
places.insertAt(k, tuner);
}
}
if (scores.contains(tuner))
currScore = scores.get(tuner);
currScore += points;
- DEBUG("Problem<%s>\tTuner<%p>\tmetric<%d>\n", problem->problem, tuner, currScore);
- DEBUG("**************************\n");
+ model_print("Problem<%s>\tTuner<%p,%d>\tmetric<%d>\n", problem->problem, tuner, tuner->tunernumber, currScore);
+ model_print("**************************\n");
scores.put(tuner, currScore);
points = points / 3;
}
if (score > tscore)
break;
}
- DEBUG("ranking[%u]=tuner<%p>(Score=%d)\n", j, tuner, score);
- DEBUG("************************\n");
+ model_print("ranking[%u]=tuner<%p,%u>(Score=%d)\n", j, tuner, tuner->tunernumber, score);
+ model_print("************************\n");
ranking.insertAt(j, tuner);
}
- DEBUG("tunerSize=%u\trankingSize=%u\ttunerVSize=%u\n", tuners.getSize(), ranking.getSize(), tunerV->getSize());
+ model_print("tunerSize=%u\trankingSize=%u\ttunerVSize=%u\n", tuners.getSize(), ranking.getSize(), tunerV->getSize());
for (uint i = tuners.getSize(); i < ranking.getSize(); i++) {
TunerRecord *tuner = ranking.get(i);
model_print("Removing tuner %u\n", tuner->tunernumber);
metric = evaluate(problem, tuner);
if (metric != -1)
tuner->setTime(problem, metric);
+ else
+ tuner->setTime(problem, -2);
}
- if ((bestTuner == NULL && metric != -1) ||
- (metric < bestscore && metric != -1)) {
+ if ((bestTuner == NULL && metric >= 0) ||
+ (metric < bestscore && metric >= 0)) {
bestTuner = tuner;
bestscore = metric;
}
metric = evaluate(problem, tuner);
if (metric != -1)
tuner->setTime(problem, metric);
+ else
+ tuner->setTime(problem, -2);
}
double score = metric;
+ if (metric < 0)
+ score = timeout;
product *= score;
}
return pow(product, 1 / ((double)tuner->problems.getSize()));
projects / satune.git / blobdiff