- Random Vertex Relabelling in LaganLighter
To evaluate the impacts of locality-optimizing reordering algorithms, a baseline is required. To create the baseline a random… Read more: Random Vertex Relabelling in LaganLighter - Minimum Spanning Forest of MS-BioGraphsWe use MASTIFF to compute the weight of Minimum Spanning Forest (MST) of MS-BioGraphs while ignoring self-edges of… Read more: Minimum Spanning Forest of MS-BioGraphs
- Topology-Based Thread Affinity Setting (Thread Pinning) in OpenMPIn applications such as graph processing, it is important how threads are pinned on CPU cores as the… Read more: Topology-Based Thread Affinity Setting (Thread Pinning) in OpenMP
- An (Incomplete) List of Publicly Available Graph Datasets/GeneratorsShort URL of this post: https://blogs.qub.ac.uk/DIPSA/graphs-list-2024 Real-World Graphs Smaller Graphs Synthetic Graph Generators Technical Posts
- An Evaluation of Bandwidth of Different Storage Types (HDD vs. SSD vs. LustreFS) for Different Block Sizes and Different Parallel Read Methods (mmap vs pread vs read)Short URL of this post: https://blogs.qub.ac.uk/DIPSA/HDD-vs-SSD-vs-LustreFS-2024 We evaluate read bandwidth of three storage types: and for three parallel… Read more: An Evaluation of Bandwidth of Different Storage Types (HDD vs. SSD vs. LustreFS) for Different Block Sizes and Different Parallel Read Methods (mmap vs pread vs read)
- SIMD Bit Twiddling HacksThe Bit Twiddling Hacks website collects an array of useful code fragments that implement some very specific computations… Read more: SIMD Bit Twiddling Hacks
- LaganLighter Source CodeRepository https://github.com/DIPSA-QUB/LaganLighter Documentation https://github.com/DIPS-QUB/LaganLighter/tree/main/docs Algorithms in This Repo Cloning git clone https://github.com/MohsenKoohi/LaganLighter.git –recursive Graph Types LaganLighter supports the… Read more: LaganLighter Source Code
