Name MS-BioGraphs – MS50 URL https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-MS50 Download Link https://doi.org/10.21227/gmd9-1534 Script for Downloading All Files https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-on-IEEE-DataPort/ Validating and Sample Code https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-Validation/ Graph Explanation Vertices represent proteins and each edge represents the sequence similarity between its two endpoints Edge Weighted Yes Directed No Number of Vertices 585,603,088 Number of Edges 124,783,559,600 Maximum […]
Mohsen Koohi Esfahani
34 posts
Name MS-BioGraphs – MSA50 URL https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-MSA50 Download Link https://doi.org/10.21227/gmd9-1534 Script for Downloading All Files https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-on-IEEE-DataPort/ Validating and Sample Code https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-Validation/ Graph Explanation Vertices represent proteins and each edge represents the sequence similarity between its two endpoints Edge Weighted Yes Directed Yes Number of Vertices 1,757,323,526 Number of Edges 125,312,536,732 Maximum […]
Name MS-BioGraphs – MSA10 URL https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-MSA10 Download Link https://doi.org/10.21227/gmd9-1534 Script for Downloading All Files https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-on-IEEE-DataPort/ Validating and Sample Code https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-Validation/ Graph Explanation Vertices represent proteins and each edge represents the sequence similarity between its two endpoints Edge Weighted Yes Directed Yes Number of Vertices 1,757,323,526 Number of Edges 25,236,632,682 Maximum […]
Name MS-BioGraphs – MS1 URL https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-MS1 Download Link https://doi.org/10.21227/gmd9-1534 Script for Downloading All Files https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-on-IEEE-DataPort/ Validating and Sample Code https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-Validation/ Graph Explanation Vertices represent proteins and each edge represents the sequence similarity between its two endpoints Edge Weighted Yes Directed No Number of Vertices 43,144,218 Number of Edges 2,660,495,200 Maximum […]
Repository https://github.com/DIPSA-QUB/MS-BioGraphs-Validation Explanation We provide a Shell script, validation.sh, and a Java program, EdgeBlockSHA.java, to verify the the correctness of the graphs. Each graph has a .ojson file whose shasum is verified by the value retreived from our server. Files such as offsets.bin, wcc.bin, n2o.bin, trans_offsets.bin, and edges_shas.txt have shasum […]
Mohsen Koohi EsfahaniSupervisors: Hans Vandierendonck and Peter Kilpatrick Thesis in PDF formatThesis on QUB Pure Portal Graph algorithms find several usages in industry, science, humanities, and technology. The fast-growing size of graph datasets in the context of the processing model of the current hardware has resulted in different bottlenecks such […]
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 […]
36th ACM International Conference on Supercomputing 2022June 27-30, 2022Acceptance Rate: 25% DOI: 10.1145/3524059.3532365Authors’ Copy (PDF Format) The Minimum Spanning Forest (MSF) problem finds usage in many different applications. While theoretical analysis shows that linear-time solutions exist, in practice, parallel MSF algorithms remain computationally demanding due to the continuously increasing size […]
2022 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS 2022)May 22-24, 2022 DOI: 10.1109/ISPASS55109.2022.00015 Authors’ Copy (PDF) While counting sort has a better complexity than comparison-based sorting algorithms, its parallelization suffers from high performance overhead and/or has a memory complexity that depends on the numbers of threads […]
27th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP 2022)April 2-6, 2022Acceptance Rate: 31% DOI: 10.1145/3503221.3508402Authors’ Copy (PDF Format) Triangle Counting (TC) is a basic graph algorithm and is widely used in different fields of science, humanities and technology. The great size of real-world graphs with […]