This code is from the following conference paper:
Timothy Middelkoop, "The Impact of Multi-Core Computing on Computational Optimization," In Proceedings of the 2012 Industrial and Systems Engineering Research Conference, Orlando, FL, May 2012.
The following dataset was used: "9th DIMACS Implementation Challenge - Shortest Paths"
The source contains the following work:
- A serial distributed Bellman-Ford algorithm implementation.
- A multi-core distributed Bellman-Ford shortest path algorithm implemented using Threading Building Blocks by Intel (TBB)
- A multi-core context aware profiling probe library
- A micro-benchmark suit for multi-core and multi-level cache computation.
- A C++ OO wrapper for SQLITE
- SQL and R based analysis code for the work done in the paper.
- A small experiment management suit for running multiple test cases
- Code to pre-process and filter the problem set into binary data files.
The source requires the support of some contributed libraries found in the parent directory. Major dependencies include PAPI and TBB (Thanks!).
git clone https://github.com/MiddelkoopT/MC-MDBF-SP-Contrib ../contrib
Import projects into eclipse and build.
- build libraries in contrib (./clean.sh; ./papi.sh; ./tbb.sh )
- config.h should be a symlink to a config in config/
- copy/symlink data to parent directory
- run make
- Generate binary data (cd data; ../scripts/problem-data.py problem-B.gr )
- run: bin/bf-dist -p problem-B.gr.bin (solution hash: 6B8AAA3F50BB5C6295B59EE51DE4D555880E7628)
- run: bin/bf-dist-tbb-task -p problem-B.gr.bin (solution hash: 6B8AAA3F50BB5C6295B59EE51DE4D555880E7628)