Quming Li , Zhibin Huang , Yiming Chen , Di Hu , Zhitao Dai , Min Yu , Zhou Liu
{"title":"SpecSeq++: A high parallel boundary matrix reduction to support real large-scale point clouds","authors":"Quming Li , Zhibin Huang , Yiming Chen , Di Hu , Zhitao Dai , Min Yu , Zhou Liu","doi":"10.1016/j.jpdc.2025.105036","DOIUrl":null,"url":null,"abstract":"<div><div>The boundary matrix serves as a crucial representation for computing the persistence diagrams, which is a typical topological data analysis method, and its reduction is the most central and time-consuming step. However, most of the current methods do not have a high degree of parallelism. Therefore, a fully GPU-parallelized boundary matrix reduction algorithm, denoted by SpecSeq++, is proposed. It introduces some novel methods, such as the high-dimension guided clearing theorem, the new method for pivot determination within blocks, and a novel dynamic block partition strategy to mitigate load balancing issues and the long-tail effect in intra-block parallel computation. Based on the experiments with three types of boundary matrices of different sizes and different complexes, the results show that SpecSeq++ has better performance, and in the best-case scenario, SpecSeq++ performs more than 700x better than phat-twist optimized with the dualization while its average GPU memory overhead is only twice that of the serial method. It provides strong support for the practical application of topological data analysis on real point cloud data. Codes are available at <span><span>https://github.com/BuptCIAGroup/SpecSeqPlusPlus</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"198 ","pages":"Article 105036"},"PeriodicalIF":3.4000,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Parallel and Distributed Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0743731525000036","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
The boundary matrix serves as a crucial representation for computing the persistence diagrams, which is a typical topological data analysis method, and its reduction is the most central and time-consuming step. However, most of the current methods do not have a high degree of parallelism. Therefore, a fully GPU-parallelized boundary matrix reduction algorithm, denoted by SpecSeq++, is proposed. It introduces some novel methods, such as the high-dimension guided clearing theorem, the new method for pivot determination within blocks, and a novel dynamic block partition strategy to mitigate load balancing issues and the long-tail effect in intra-block parallel computation. Based on the experiments with three types of boundary matrices of different sizes and different complexes, the results show that SpecSeq++ has better performance, and in the best-case scenario, SpecSeq++ performs more than 700x better than phat-twist optimized with the dualization while its average GPU memory overhead is only twice that of the serial method. It provides strong support for the practical application of topological data analysis on real point cloud data. Codes are available at https://github.com/BuptCIAGroup/SpecSeqPlusPlus.
期刊介绍:
This international journal is directed to researchers, engineers, educators, managers, programmers, and users of computers who have particular interests in parallel processing and/or distributed computing.
The Journal of Parallel and Distributed Computing publishes original research papers and timely review articles on the theory, design, evaluation, and use of parallel and/or distributed computing systems. The journal also features special issues on these topics; again covering the full range from the design to the use of our targeted systems.