This repository contains the shared-memory CPU-based soure code of the LaganLighter project: https://blogs.qub.ac.uk/DIPSA/LaganLighter .
- SAPCo Sort:
alg1_sapco_sort - Thrifty Label Propagation Connected Components:
alg2_thrifty - MASTIFF: Structure-Aware Mimum Spanning Tree/Forest:
alg3_mastiff - iHTL: in-Hub Temporal Locality in SpMV (Sparse-Matrix Vector Multiplication) based Graph Processing: to be added
- LOTUS: Locality Optimizing Trinagle Counting: to be added
git clone https://github.com/MohsenKoohi/LaganLighter.git --recursive
git pull --recurse-submodulesor- You may set recursive submodule update globally using
git config --global submodule.recurse trueand thengit pullfetches all updates.
- The
libnuma,openmp, andpapiare required. - A
gccwith a version greater than 9 are required. - For using ParaGrapher,
JDKwith a version greater than 15 is required. unzip,bc, andwget.
- Make sure the requried libraries are accessible through
$LD_LIBRARY_PATH. - Run
make alg...(e.g.make alg1_sapco_sort). This builds the executible file and runs it for the test graph. - For identifying input graph and other options, please refer to LaganLighter Documents, Loading Graphs.
Please refer to LaganLighter Documentation
LaganLighter supports reading graphs in text format and in compressed WebGraph format, using ParaGrapher library, particularly:
PARAGRAPHER_CSX_WG_400_AP,PARAGRAPHER_CSX_WG_404_AP, andPARAGRAPHER_CSX_WG_800_AP.
Please refer to Graph Loading Documentation.
Please refer to Launcher Script Documentaion.
If you receive wrong results or you are suspicious about parts of the code, please contact us.
Licensed under the GNU v3 General Public License, as published by the Free Software Foundation. You must not use this Software except in compliance with the terms of the License. Unless required by applicable law or agreed upon in writing, this Software is distributed on an "as is" basis, without any warranty; without even the implied warranty of merchantability or fitness for a particular purpose, neither express nor implied. For details see terms of the License (see attached file: LICENSE).