paco_libgraph_comScheduling.cc

Go to the documentation of this file.

#include "paco_libgraph_comScheduling.h"

#undef INFO_INTERNAL

paco_comScheduling_libgraph::paco_comScheduling_libgraph()
{
  _beta=0;
  _k=0;
  _g = NULL;
  _client_nodes = NULL;
  _server_nodes = NULL;
}


paco_comScheduling_libgraph::~paco_comScheduling_libgraph()
{
  if (_g) delete _g;
  if (_client_nodes) delete[] _client_nodes;
  if (_server_nodes) delete[] _server_nodes;
}


void 
paco_comScheduling_libgraph::set_beta(unsigned int beta)
{
  if (_beta == beta) return;

  _beta = beta;
  // beta change -> clear all schedule memory
  clearAllSchedules();
}

void 
paco_comScheduling_libgraph::set_k(unsigned int k)
{
  if (_k == k) return;

  _k = k;
  // k change -> clear all schedule memory
  clearAllSchedules();
}

unsigned int
paco_comScheduling_libgraph::get_beta()
{
  return _beta;
}

unsigned int
paco_comScheduling_libgraph::get_k()
{
  return _k;
}

void 
paco_comScheduling_libgraph::initializeBigraph(PaCO::PacoTopology_t* srctopo, PaCO::PacoTopology_t* dsttopo)
{
#ifdef INFO_INTERNAL
  std::cerr<<__FUNCTION__<<" with beta:"<<_libgraph_beta<<" k:"<<_libgraph_k<<endl;
#endif

  // Removing old instances
  if (_g) delete _g;
  if (_client_nodes) delete[] _client_nodes;
  if (_server_nodes) delete[] _server_nodes;

  // Creating new instances
  _g = new bigraph();

  // Setting up the parametter of the graph
  if ((_beta==0)||(_k==0)) {
    std::cerr<< "ERROR: libgraph not initialized -- Specifiy k & beta !!"<<endl;
  }
    
  _g->set_beta(_beta);
  _g->set_k(_k);

  _client_nodes = new node*[srctopo->total];
  _server_nodes = new node*[dsttopo->total];
        
  for (unsigned i = 0; i < srctopo->total; i++)
    {
      _client_nodes[i] = _g->add_node(true);
    }
  for (unsigned i = 0; i < dsttopo->total; i++)
    {
      _server_nodes[i] = _g->add_node(false);
    }
}

paco_comSchedule* 
paco_comScheduling_libgraph::computeScheduling(unsigned rank, 
                      PaCO::PacoTopology_t* srctopo, PaCO::PacoTopology_t* dsttopo,
                      unsigned **com_matrix, void** info_vector[])
{
  // 1. setup a new bigraph
  initializeBigraph(srctopo, dsttopo);

  // 2. fill the bigraph
  for (unsigned i = 0; i < srctopo->total; i++)
    {
      if (i!= rank)
   for (unsigned j = 0; j < dsttopo->total; j++)
     {
       _g->add_edge(_client_nodes[i], _server_nodes[j], com_matrix[i][j]);
#ifdef INFO_INTERNAL
       std::cerr << "edge: "<<_client_nodes[i] << " -> "<<_server_nodes[j] << " : "<< com_matrix[i][j]<<endl;
#endif
     }
      else
   for (unsigned j = 0; j < dsttopo->total; j++)
     {
       _g->add_edge(_client_nodes[i],_server_nodes[j], com_matrix[i][j], info_vector[j]);
#ifdef INFO_INTERNAL
       std::cerr << "edge: "<<_client_nodes[i] << " -> "<<_server_nodes[j] << " : "<< com_matrix[i][j]<<" ("<<info_vector[j]<<")\n";
#endif
     }
    }
 
  _g->remove_empty_nodes();
  
  paco_comSchedule_libgraph* schedule_info = new paco_comSchedule_libgraph(new kbps_approximation(_g));

  schedule_info->get_kbps()->compute_poly2();
  schedule_info->get_kbps()->serialize();
  schedule_info->build_idx();
  
  return schedule_info;
}