/** * @depends testgetInsidersCombinations */ public function testtreeSearchApproach() { $placements = array(array('A:1', 'A:2'), array('B:2', 'B:3'), array('C:1', 'C:3'), array('D:1', 'D:2'), array('E:2', 'E:3'), array('F:2', 'F:3'), array('G:1', 'G:3'), array('H:1', 'H:3')); $scenario = Scenario::buildScenarioByPlacements($placements); $maxVM = 3; $resp = Approximation::treeSearchApproach($scenario, $maxVM); $this->assertEquals(80, $resp, "# of approximation !match."); }
$saida_2d = "VMs PMs Sem Com Sum Sub Prod Real\n"; $saida_2d = "VMs PMs Com Tree\n"; $saida_delta = ''; $flag = null; foreach ($scenarios as $key => $value) { printf("%s - VM(%s) - PM(%s) ", date(DATE_RFC2822), $value['nvms'], $value['npms']); $max = 5; //$sem = QuantidadeDeResultados::calcularSemRegras($value); $com = Approximation::calcularComRegras($value); echo "\ncom({$com}) \n"; //$sum = QuantidadeDeResultados::calcularComRegrasMaxVMSum($value,3); //$sub = QuantidadeDeResultados::calcularComRegrasMaxVMSub($value,3); //$prod= QuantidadeDeResultados::calcularComRegrasMaxVMProd($value,3); //$real_r = Combinations::GenerateAllCombinations(array_values($value['placements'])); //$real = count(Combinations::FilterCombinationsByMaxVm($real_r,3)); $tre = Approximation::treeSearchApproach($value, $max); //echo " - Real($real) \n"; $delta = 5; //100*($sum/$real); echo "\ncom({$com}) tree({$tre}) \n"; //Quebra a linha quando muda de VM. Necessario para o funcionamento do GnuPlot PM3D if (!is_null($flag) && $flag != $value['nvms']) { $saida_tre .= "\n"; $saida_sem .= "\n"; $saida_com .= "\n"; $saida_sum .= "\n"; $saida_sub .= "\n"; $saida_prod .= "\n"; $saida_real .= "\n"; $saida_delta .= "\n"; }
$scenario = array_pop(json_decode(file('others/' . $_GET['file'])[0], true)); } else { $scenarios = Scenario::geraScenarios($apr, array($nvm), array($npm)); $scenario = array_pop($scenarios); } $json = Scenario::toDataTableJSON($scenario); //$memcache = memcache_connect('localhost', 11211); //$accordion = isset($_GET['cache']) ? false : memcache_get($memcache, 'accordion'); //$accordion = false; //if ($accordion == false) { //echo "<script>alert('Not Cached');</script>"; $accordion = new Accordion(); $sem = Approximation::calcularSemRegras($scenario); $com = Approximation::calcularComRegras($scenario); $last = Approximation::calcularComRegrasMaxVMSub($scenario, $max); $tree = Approximation::treeSearchApproach($scenario, $max); $test1 = 0; //Approximation::calcularComRegrasMaxVMOutIn($scenario, $max); $test_c_a = 0; //Approximation::calculateAvgCombSplitterApproach($scenario, $max); $test_c_s = 0; //Approximation::calculateSumCombSplitterApproach($scenario, $max); $test_s_p = 0; //Approximation::calculateProdSequencialSplitterApproach($scenario, $max); $test_s_s = 0; //Approximation::calculateSumSequencialSplitterApproach($scenario, $max); //$filtered = Combinations::GenerateAllCombinationsMaxVM($scenario['placements'], $max); $real = 0; //count($filtered); $title = sprintf($fmt_accordion_title, $max, $scenario['nvms'], $scenario['npms'], $sem, $com, $real, $tree, $last, $test1, $test_c_a, $test_c_s, $test_s_p, $test_s_s); //$body = sprintf($fmt_accordion_body, ViewHelper::printState($filtered));