PDF versionDOI: 10.48550/arXiv.2404.19735 Comprehensive evaluation is one of the basis of experimental science. In High-Performance Graph Processing, a thorough evaluation of contributions becomes more achievable by supporting common input formats over different frameworks. However, each framework creates its specific format, which may not support reading large-scale real-world graph datasets. This […]
Graph Algorithms
55 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 […]
MS-BioGraph sequence similarity graph datasets are now publicly available on IEEE DataPort: https://doi.org/10.21227/gmd9-1534 . To access the files, you need to register/login to IEEE DataPort and then visit the MS-BioGraphs page. By saving the page as an HTML file such as dp.html, you may download the datasets (as an example […]
ParaGrapher source code has been integrated to LaganLighter and access to different WebGraph formats are available in LaganLighter: For further details, please refer to – LaganLighter source coder Repository: https://github.com/DIPSA-QUB/LaganLighter, particularly, the graph.c file.– ParaGrapher source code repository: https://github.com/DIPSA-QUB/ParaGrapher particularly, the src/webgraph.c and src/WG*.java files. Read more about ParaGrapher and […]
ParaGrapher source code for accessing WebGraphs have been published. The supported graph types are: ParaGrapher uses its asynchronous and parallel API to implement these graph types. The user needs to implement a callback function that is called by the API upon completion of reading a block of edges. Poplar uses […]
2023 IEEE International Conference on Big Data (BigData’23)December 15-18, 2023, Sorrento, Italia DOI: 10.1109/BigData59044.2023.10386309PDF (Authors Copy) Progress in High-Performance Computing in general, and High-Performance Graph Processing in particular, is highly dependent on the availability of publicly-accessible, relevant, and realistic data sets. To ensure continuation of this progress, we (i) investigate […]
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
I recently travelled to Marrakech, Morocco, to present my research at the 9th International Conference on Metaheuristics and Nature-Inspired Computing (META 2023). Held from November 1–4, 2023, the conference provided an incredible atmosphere for discussing how meta-heuristics can tackle complex optimisation problems. My paper, “Machine learning-based per-instance algorithm selection for […]
2023 IEEE International Symposium on Workload Characterization (IISWC’23)October 1-3, 2023, Ghent, Belgium DOI: 10.1109/IISWC59245.2023.00029PDF Version Progress in High-Performance Computing in general, and High-Performance Graph Processing in particular, is highly dependent on the availability of publicly-accessible, relevant, and realistic data sets. In this paper, we announce publication of MS-BioGraphs, a new […]
DOI: 10.48550/arXiv.2308.16744 PDF VersionarXiv Link Progress in High-Performance Computing in general, and High-Performance Graph Processing in particular, is highly dependent on the availability of publicly-accessible, relevant, and realistic data sets. To ensure continuation of this progress, we (i) investigate and optimize the process of generating large sequence similarity graphs as […]