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 […]
Monthly archives: August 2024
3 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 […]