1cdeee2dd53973156799a56c5d8a97e427e31343
[satune.git] / src / Tuner / multituner.cc
1 #include "multituner.h"
2 #include "csolver.h"
3 #include "searchtuner.h"
4 #include <math.h>
5 #include <stdlib.h>
6 #include <float.h>
7 #include <string.h>
8 #include <iostream>
9 #include <fstream>
10
11 #define UNSETVALUE -1
12
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);
17 }
18
19 Problem::~Problem() {
20         ourfree(problem);
21 }
22
23 void TunerRecord::setTime(Problem *problem, long long time) {
24         timetaken.put(problem, time);
25 }
26
27 long long TunerRecord::getTime(Problem *problem) {
28         if (timetaken.contains(problem))
29                 return timetaken.get(problem);
30         else return -1;
31 }
32
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));
37         }
38         return tr;
39 }
40
41 MultiTuner::MultiTuner(uint _budget, uint _rounds, uint _timeout) :
42         budget(_budget), rounds(_rounds), timeout(_timeout), execnum(0) {
43 }
44
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);
50 }
51
52 void MultiTuner::addProblem(const char *filename) {
53         problems.push(new Problem(filename));
54 }
55
56 void MultiTuner::addTuner(SearchTuner *tuner) {
57         TunerRecord *t = new TunerRecord(tuner);
58         tuners.push(t);
59         allTuners.push(t);
60 }
61
62 long long MultiTuner::evaluate(Problem *problem, TunerRecord *tuner) {
63         char buffer[512];
64         //Write out the tuner
65         snprintf(buffer, sizeof(buffer), "tuner%u", execnum);
66         tuner->getTuner()->serialize(buffer);
67
68         //Do run
69         snprintf(buffer, sizeof(buffer), "./run.sh deserializerun %s %u tuner%u result%u > log%u", problem->getProblem(), timeout, execnum, execnum, execnum);
70         int status = system(buffer);
71
72         long long metric = -1;
73         int sat = IS_INDETER;
74
75         if (status == 0) {
76                 //Read data in from results file
77                 snprintf(buffer, sizeof(buffer), "result%u", execnum);
78
79                 ifstream myfile;
80                 myfile.open (buffer, ios::in);
81
82
83                 if (myfile.is_open()) {
84                         myfile >> metric;
85                         myfile >> sat;
86                         myfile.close();
87                 }
88
89                 snprintf(buffer, sizeof(buffer), "tuner%uused", execnum);
90                 tuner->getTuner()->addUsed(buffer);
91         }
92         //Increment execution count
93         execnum++;
94
95         if (problem->result == UNSETVALUE && sat != IS_INDETER) {
96                 problem->result = sat;
97         } else if (problem->result != sat && sat != IS_INDETER) {
98                 model_print("******** Result has changed ********\n");
99         }
100         return metric;
101 }
102
103 void MultiTuner::tuneComp() {
104         Vector<TunerRecord *> *tunerV = new Vector<TunerRecord *>(&tuners);
105         for (uint b = 0; b < budget; b++) {
106                 uint tSize = tunerV->getSize();
107                 for (uint i = 0; i < tSize; i++) {
108                         SearchTuner *tmpTuner = mutateTuner(tunerV->get(i)->getTuner(), b);
109                         tunerV->push(new TunerRecord(tmpTuner));
110                 }
111
112                 Hashtable<TunerRecord *, int, uint64_t> scores;
113                 for (uint i = 0; i < problems.getSize(); i++) {
114                         Problem *problem = problems.get(i);
115                         Vector<TunerRecord *> places;
116                         for (uint j = 0; j < tunerV->getSize(); j++) {
117                                 TunerRecord *tuner = tunerV->get(j);
118                                 long long metric = tuner->getTime(problem);
119                                 if (metric == -1) {
120                                         metric = evaluate(problem, tuner);
121                                         if (metric != -1)
122                                                 tuner->setTime(problem, metric);
123                                 }
124                                 if (metric != -1) {
125                                         uint k = 0;
126                                         for (; k < places.getSize(); k++) {
127                                                 if (metric < places.get(k)->getTime(problem))
128                                                         break;
129                                         }
130                                         places.insertAt(k, tuner);
131                                 }
132                         }
133                         int points = 9;
134                         for (uint k = 0; k < places.getSize() && points; k++) {
135                                 TunerRecord *tuner = places.get(k);
136                                 points = points / 3;
137                                 int currScore = 0;
138                                 if (scores.contains(tuner))
139                                         currScore = scores.get(tuner);
140                                 currScore += points;
141                                 scores.put(tuner, currScore);
142                         }
143                 }
144                 Vector<TunerRecord *> ranking;
145                 for (uint i = 0; i < tunerV->getSize(); i++) {
146                         TunerRecord *tuner = tunerV->get(i);
147                         int score = 0;
148                         if (scores.contains(tuner))
149                                 score = scores.get(tuner);
150                         uint j = 0;
151                         for (; j < ranking.getSize(); j++) {
152                                 TunerRecord *t = ranking.get(j);
153                                 int tscore = 0;
154                                 if (scores.contains(t))
155                                         tscore = scores.get(t);
156                                 if (score > tscore)
157                                         break;
158                         }
159                         ranking.insertAt(j, tuner);
160                 }
161                 for (uint i = tuners.getSize(); i < ranking.getSize(); i++) {
162                         TunerRecord *tuner = ranking.get(i);
163                         for (uint j = 0; j < tunerV->getSize(); j++) {
164                                 if (tunerV->get(j) == tuner)
165                                         tunerV->removeAt(j);
166                         }
167                 }
168         }
169 }
170
171 void MultiTuner::mapProblemsToTuners(Vector<TunerRecord *> *tunerV) {
172         for (uint i = 0; i < problems.getSize(); i++) {
173                 Problem *problem = problems.get(i);
174                 TunerRecord *bestTuner = NULL;
175                 long long bestscore = 0;
176                 for (uint j = 0; j < tunerV->getSize(); j++) {
177                         TunerRecord *tuner = tunerV->get(j);
178                         long long metric = tuner->getTime(problem);
179                         if (metric == -1) {
180                                 metric = evaluate(problem, tuner);
181                                 if (metric != -1)
182                                         tuner->setTime(problem, metric);
183                         }
184                         if ((bestTuner == NULL && metric != -1) ||
185                                         (metric < bestscore && metric != -1)) {
186                                 bestTuner = tuner;
187                                 bestscore = metric;
188                         }
189                 }
190                 if (bestTuner != NULL)
191                         bestTuner->problems.push(problem);
192         }
193 }
194
195 void clearVector(Vector<TunerRecord *> *tunerV) {
196         for (uint j = 0; j < tunerV->getSize(); j++) {
197                 TunerRecord *tuner = tunerV->get(j);
198                 tuner->problems.clear();
199         }
200 }
201
202 void MultiTuner::tuneK() {
203         Vector<TunerRecord *> *tunerV = new Vector<TunerRecord *>(&tuners);
204         for (uint i = 0; i < rounds; i++) {
205                 clearVector(tunerV);
206                 mapProblemsToTuners(tunerV);
207                 improveTuners(tunerV);
208         }
209         model_print("Best tuners\n");
210         for (uint j = 0; j < tunerV->getSize(); j++) {
211                 TunerRecord *tuner = tunerV->get(j);
212                 char buffer[256];
213                 sprintf(buffer, "tuner%u.conf", j);
214                 tuner->getTuner()->serialize(buffer);
215                 tuner->getTuner()->print();
216         }
217         delete tunerV;
218 }
219
220 void MultiTuner::improveTuners(Vector<TunerRecord *> *tunerV) {
221         for (uint j = 0; j < tunerV->getSize(); j++) {
222                 TunerRecord *tuner = tunerV->get(j);
223                 TunerRecord *newtuner = tune(tuner);
224                 tunerV->set(j, newtuner);
225         }
226 }
227
228 double MultiTuner::evaluateAll(TunerRecord *tuner) {
229         double product = 1;
230         for (uint i = 0; i < tuner->problems.getSize(); i++) {
231                 Problem *problem = tuner->problems.get(i);
232                 long long metric = tuner->getTime(problem);
233                 if (metric == -1) {
234                         metric = evaluate(problem, tuner);
235                         if (metric != -1)
236                                 tuner->setTime(problem, metric);
237                 }
238
239                 double score = metric;
240                 product *= score;
241         }
242         return pow(product, 1 / ((double)tuner->problems.getSize()));
243 }
244
245 SearchTuner *MultiTuner::mutateTuner(SearchTuner *oldTuner, uint k) {
246         SearchTuner *newTuner = oldTuner->copyUsed();
247         uint numSettings = oldTuner->getSize();
248         uint settingsToMutate = (uint)(AUTOTUNERFACTOR * (((double)numSettings) * (budget - k)) / (budget));
249         if (settingsToMutate < 1)
250                 settingsToMutate = 1;
251         model_print("Mutating %u settings\n", settingsToMutate);
252         while (settingsToMutate-- != 0) {
253                 newTuner->randomMutate();
254         }
255         return newTuner;
256 }
257
258 TunerRecord *MultiTuner::tune(TunerRecord *tuner) {
259         TunerRecord *bestTuner = NULL;
260         double bestScore = DBL_MAX;
261
262         TunerRecord *oldTuner = tuner;
263         double base_temperature = evaluateAll(oldTuner);
264         double oldScore = base_temperature;
265
266         for (uint i = 0; i < budget; i++) {
267                 SearchTuner *tmpTuner = mutateTuner(oldTuner->getTuner(), i);
268                 TunerRecord *newTuner = oldTuner->changeTuner(tmpTuner);
269                 allTuners.push(newTuner);
270                 double newScore = evaluateAll(newTuner);
271                 newTuner->tuner->printUsed();
272                 model_print("Received score %f\n", newScore);
273                 double scoreDiff = newScore - oldScore; //smaller is better
274                 if (newScore < bestScore) {
275                         bestScore = newScore;
276                         bestTuner = newTuner;
277                 }
278
279                 double acceptanceP;
280                 if (scoreDiff < 0) {
281                         acceptanceP = 1;
282                 } else {
283                         double currTemp = base_temperature * (((double)budget - i) / budget);
284                         acceptanceP = exp(-scoreDiff / currTemp);
285                 }
286                 double ran = ((double)random()) / RAND_MAX;
287                 if (ran <= acceptanceP) {
288                         oldScore = newScore;
289                         oldTuner = newTuner;
290                 }
291         }
292
293         return bestTuner;
294 }
295