compute_comm_affinity

added test kl_bsp_cost

more tests for max_comm_datastructure

update

update node affinity

added test for affinity

update test

update

affinity tests

affinity tests

update

update

small performance optimization

more test, pre move data update

pre_move_comm_data

new unit test

update test

update tests

update

update

update lambda container, bsp_cost function

cost function correction

max_comm_datastructures fix

fix kl_bsp_cost test

update

update

update

update

more tests

update

update comm update

update

update

update

update

update

update

added more tests, cmpute working

update comm affinity implemenation

comm_affinity optimizations

enable tests

update test

debug output

update

update update

update

unit tests passing

cleaning

update datastructure

update

update numa

added mt test

Author: tonibohnlein

include/osp/auxiliary/io/hdag_graph_file_reader.hpp

@@ -29,6 +29,7 @@ limitations under the License.
 #include "osp/concepts/computational_dag_concept.hpp"
 #include "osp/graph_algorithms/directed_graph_util.hpp"
 #include "osp/auxiliary/io/filepath_checker.hpp"
+#include "osp/concepts/constructable_computational_dag_concept.hpp"
 
 namespace osp {
 namespace file_reader {

include/osp/bsp/scheduler/LocalSearch/KernighanLin_v2/comm_cost_modules/kl_bsp_comm_cost.hpp

@@ -32,7 +32,8 @@ struct kl_hyper_total_comm_cost_function {
     using kl_gain_update_info = kl_update_info<VertexType>;
 
     constexpr static unsigned window_range = 2 * window_size + 1;
-  
+    constexpr static bool is_max_comm_cost_function = false;
+
     kl_active_schedule<Graph_t, cost_t, MemoryConstraint_t> *active_schedule;
 
     compatible_processor_range<Graph_t> *proc_range;
@@ -43,7 +44,7 @@ struct kl_hyper_total_comm_cost_function {
     cost_t comm_multiplier = 1; 
     cost_t max_comm_weight = 0;
 
-    lambda_vector_container node_lambda_map;
+    lambda_vector_container<VertexType> node_lambda_map;
 
     inline cost_t get_comm_multiplier() { return comm_multiplier; }
     inline cost_t get_max_comm_weight() { return max_comm_weight; }
@@ -60,6 +61,12 @@ struct kl_hyper_total_comm_cost_function {
         node_lambda_map.initialize(graph->num_vertices(), instance->numberOfProcessors());      
     }
 
+    struct empty_struct {};
+
+    using pre_move_comm_data_t = empty_struct;
+
+    inline empty_struct get_pre_move_comm_data(const kl_move& ) { return empty_struct(); }
+
     cost_t compute_schedule_cost() {
         cost_t work_costs = 0;
         for (unsigned step = 0; step < active_schedule->num_steps(); step++) {

include/osp/bsp/scheduler/LocalSearch/KernighanLin_v2/comm_cost_modules/kl_hyper_total_comm_cost.hpp

@@ -29,6 +29,8 @@ struct kl_total_comm_cost_function {
     using kl_move = kl_move_struct<cost_t, VertexType>;
     using kl_gain_update_info = kl_update_info<VertexType>;
 
+    constexpr static bool is_max_comm_cost_function = false;
+
     constexpr static unsigned window_range = 2 * window_size + 1;
     constexpr static bool use_node_communication_costs = use_node_communication_costs_arg || not has_edge_weights_v<Graph_t>;
 
@@ -58,6 +60,10 @@ struct kl_total_comm_cost_function {
         comm_multiplier = 1.0 / instance->numberOfProcessors();        
     }
 
+    struct empty_struct {};
+    using pre_move_comm_data_t = empty_struct;
+    inline empty_struct get_pre_move_comm_data(const kl_move& ) { return empty_struct(); }
+
     cost_t compute_schedule_cost_test() {
         return compute_schedule_cost();
     }