To evaluate the impacts of locality-optimizing reordering algorithms, a baseline is required. To create the baseline a random assignment of IDs to vertices may be used to produce a representation of the graph with reduced locality [ DOI:10.1109/ISPASS57527.2023.00029, DOI:10.1109/IISWC53511.2021.00020 ]. To that end, we create the random_ordering() function in relabel.c […]
Technical Posts
7 posts
We use MASTIFF to compute the weight of Minimum Spanning Forest (MST) of MS-BioGraphs while ignoring self-edges of the graphs. – MS1 Using machine with 24 cores. MSF weight: 109,915,787,546 – MS50 Using machine with 128 cores. MSF weight: 416,318,200,808 MS-BioGraphsRelated Posts Technical Posts LaganLighter
In applications such as graph processing, it is important how threads are pinned on CPU cores as the threads that share resources (such as memory and cache) can accelerate the performance by processing consecutive blocks of input dataset, especially, when the dataset has a high-level of locality. In LaganLighter, we […]
Short URL of this post: https://blogs.qub.ac.uk/DIPSA/graphs-list-2024 Real-World Graphs Smaller Graphs Synthetic Graph Generators Technical Posts
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 methods: and for two block sizes: The source code is available on ParaGrapher repository: The OS cache of storage contents have been dropped after each evaluation (sudo sh -c 'echo 3 […]
The Bit Twiddling Hacks website collects an array of useful code fragments that implement some very specific computations very efficiently. Here we collect references to some handy code fragments for SIMD based computation. Technical Posts
Repository 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 following graph formats: Measurements In addition to execution time, we use the PAPI library to measure hardware counters such as L3 cache misses, hardware instructions, DTLB misses, and load and store memory […]