void
madara::cid::ga_naive (Settings & settings, double duration)
{
ACE_High_Res_Timer timer;
ACE_Time_Value max_tv (0, 0);
ACE_hrtime_t elapsed (0);
ACE_hrtime_t maximum (0);
timer.reset ();
timer.start ();
max_tv.set (duration);
maximum = max_tv.sec () * 1000000000;
maximum += max_tv.usec () * 1000;
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_EVENT_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_naive:" \
" creating an exact copy of the solution vector\n"));
#endif
// create an exact copy of the solution vector
Deployment current;
current.resize (settings.solution.size ());
std::copy (settings.solution.begin (), settings.solution.end (),
current.begin ());
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_EVENT_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_naive:" \
" calculating latency for the solution so far\n"));
#endif
uint64_t orig_latency = calculate_latency (settings);
uint64_t new_latency;
while (maximum > elapsed)
{
// generate some candidates for mutating
unsigned int candidate1 = rand () % settings.solution.size ();
unsigned int candidate2 = rand () % settings.solution.size ();
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_naive:" \
" initial candidates: %u, %u\n",
candidate1, candidate2));
#endif
// loop until we have two different candidates
while (candidate1 == candidate2)
candidate1 = rand () % settings.solution.size ();
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_naive:" \
" final candidates: %u, %u\n",
candidate1, candidate2));
#endif
// attempt the swap
std::swap (current[candidate1], current[candidate2]);
new_latency = calculate_latency (
settings.network_latencies, settings.target_deployment, current);
if (new_latency < orig_latency)
{
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_EVENT_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_naive:" \
" latency improvement: %Q->%Q. Copying solution.\n",
orig_latency, new_latency));
#endif
std::copy (current.begin (), current.end (), settings.solution.begin ());
orig_latency = new_latency;
}
timer.stop ();
timer.elapsed_time (elapsed);
}
for (unsigned int i = 0; i < settings.solution.size (); ++i)
{
if (settings.solution_lookup[settings.solution[i]] != i)
settings.solution_lookup[settings.solution[i]] = i;
}
}
void madara::cid::ga_degree (Settings & settings, double duration)
{
if (settings.solution.size () < 2)
return;
ACE_High_Res_Timer timer;
ACE_Time_Value max_tv (0, 0);
ACE_hrtime_t elapsed (0);
ACE_hrtime_t maximum (0);
timer.reset ();
timer.start ();
max_tv.set (duration);
maximum = max_tv.sec () * 1000000000;
maximum += max_tv.usec () * 1000;
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_EVENT_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" entering main function\n"));
#endif
// create an exact copy of the solution vector
Deployment current;
current.resize (settings.solution.size ());
std::copy (settings.solution.begin (), settings.solution.end (),
current.begin ());
uint64_t orig_latency = calculate_latency (settings);
unsigned int num_degreed_nodes = 0;
Workflow & deployment = settings.target_deployment;
SummationsMap & averages = settings.network_summations;
SolutionMap solution_lookup;
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_EVENT_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" copying initial solution\n"));
#endif
for (unsigned int i = 0; i < current.size (); ++i)
{
solution_lookup[current[i]] = i;
}
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_EVENT_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" counting the degreed nodes in the deployment\n"));
#endif
// count the number of degreed nodes in the deployment.
for (unsigned int i = 0; i < deployment.size (); ++i)
{
if (deployment[i].size () == 0)
break;
++num_degreed_nodes;
}
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_EVENT_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" Attempting up to %f seconds worth of mutations to find better solution\n",
duration));
#endif
while (maximum > elapsed)
{
/**
* 1/5 times, choose a naive solution.
* 4/5 times, choose to swap someone from the high degreed candidates
**/
int tactic = rand () % 5;
unsigned int candidate1;
unsigned int candidate2;
if (tactic == 4)
{
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" naively choosing candidates\n"));
#endif
// go with a naive solution
candidate1 = rand () % settings.solution.size ();
candidate2 = rand () % settings.solution.size ();
if (settings.solution.size () > 0)
{
// loop until we have two different candidates
while (candidate1 == candidate2)
candidate1 = rand () % settings.solution.size ();
}
}
else
{
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" choosing degree-informed candidates\n"));
#endif
unsigned int choice = rand () % num_degreed_nodes;
// use degree and latency information to form ideal candidates
candidate1 = deployment[choice][0].first;
LatencyVector & cur_summations =
settings.network_summations[deployment[choice].size ()];
/**
* the other candidate can be from a range:
* 0-2 : top num_degreed_nodes
* 3 : top 10%
* 4 : top 25%
**/
int candidate_type = rand () % 5;
unsigned int range;
if (cur_summations.size () < 50)
{
range = cur_summations.size () / 10 + 1;
candidate2 = solution_lookup[cur_summations[rand () % range].first];
}
else if (candidate_type <= 2)
{
if (num_degreed_nodes < 5)
{
range = cur_summations.size () / 20;
}
else
{
range = num_degreed_nodes;
}
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" choosing from top %u candidates\n",
range));
#endif
candidate2 = solution_lookup[cur_summations[rand () % range].first];
}
else if (candidate_type == 3)
{
// choose candidate2 from the top 10%
range = cur_summations.size () / 10;
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" choosing from top %u candidates\n",
range));
#endif
candidate2 = solution_lookup[cur_summations[rand () % range].first];
}
else
{
// choose candidate2 from the top 25%
range = cur_summations.size () / 4;
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" choosing from top %u candidates\n",
range));
#endif
candidate2 = solution_lookup[cur_summations[rand () % range].first];
}
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" initial candidates: %u, %u\n",
candidate1, candidate2));
#endif
// loop until we have two different candidates
while (range >= 2 && candidate1 == candidate2)
candidate2 = solution_lookup[cur_summations[rand () % range].first];
}
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" final candidates: %u, %u\n",
candidate1, candidate2));
#endif
// attempt the swap
if (candidate1 != candidate2)
{
std::swap (current[candidate1], current[candidate2]);
solution_lookup[current[candidate1]] = candidate1;
solution_lookup[current[candidate2]] = candidate2;
uint64_t new_latency = calculate_latency (
settings.network_latencies, deployment, current);
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" latency: %Q->%Q\n",
orig_latency, new_latency));
#endif
if (new_latency < orig_latency)
{
#ifdef ENABLE_CID_LOGGING
MADARA_DEBUG (MADARA_LOG_DETAILED_TRACE, (LM_DEBUG,
DLINFO "madara::cid::ga_degree:" \
" updating solution to current\n",
orig_latency, new_latency));
#endif
std::copy (current.begin (), current.end (), settings.solution.begin ());
for (unsigned int j = 0; j < settings.solution.size (); ++j)
{
if (settings.solution_lookup[settings.solution[j]] != j)
settings.solution_lookup[settings.solution[j]] = j;
}
orig_latency = new_latency;
}
}
timer.stop ();
timer.elapsed_time (elapsed);
}
}