30th International European Conference on Parallel and Distributed Computing (Euro-Par 2024) DOI: 10.1007/978-3-031-69583-4_7PDF Version Abstract The Maximum Weighted Clique(MWC) problem remains challenging due to its unfavourable time complexity.In this paper, we analyze the execution of exact search-based MWC algorithms and show that high-accuracy weighted cliques can be discovered in the […]
high performance computing
42 posts
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 […]
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 […]
Congratulations to Brian Dandurand who has received notification that his Individual Fellowship proposal entitled “Scaling Parallelism and Convexity Hurdles in Bi-Level Machine Learning” has been proposed for funding. More details will follow in due time.
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 […]
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 […]
Name MS-BioGraphs – MS URL https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-MS 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 1,757,323,526 Number of Edges 2,488,069,027,875 Maximum […]