{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:31:21Z","timestamp":1740180681046,"version":"3.37.3"},"reference-count":19,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T00:00:00Z","timestamp":1606435200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Big Data"],"abstract":"One of the challenges of high granularity calorimeters, such as that to be built to cover the endcap region in the CMS Phase-2 Upgrade for HL-LHC, is that the large number of channels causes a surge in the computing load when clustering numerous digitized energy deposits (hits) in the reconstruction stage. In this article, we propose a fast and fully parallelizable density-based clustering algorithm, optimized for high-occupancy scenarios, where the number of clusters is much larger than the average number of hits in a cluster. The algorithm uses a grid spatial index for fast querying of neighbors and its timing scales linearly with the number of hits within the range considered. We also show a comparison of the performance on CPU and GPU implementations, demonstrating the power of algorithmic parallelization in the coming era of heterogeneous computing in high-energy physics.<\/jats:p>","DOI":"10.3389\/fdata.2020.591315","type":"journal-article","created":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T06:29:27Z","timestamp":1606458567000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["CLUE: A Fast Parallel Clustering Algorithm for High Granularity Calorimeters in High-Energy Physics"],"prefix":"10.3389","volume":"3","author":[{"given":"Marco","family":"Rovere","sequence":"first","affiliation":[]},{"given":"Ziheng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Di Pilato","sequence":"additional","affiliation":[]},{"given":"Felice","family":"Pantaleo","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Seez","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2020,11,27]]},"reference":[{"key":"B1","doi-asserted-by":"crossref","DOI":"10.1145\/304182.304187","article-title":"Optics: ordering points to identify the clustering structure","author":"Ankerst","year":"1999"},{"key":"B2","doi-asserted-by":"crossref","first-page":"599","DOI":"10.2172\/1767028","volume-title":"High-luminosity large hadron collider (HL-LHC): technical design report V. 0.1","author":"Apollinari","year":"2017"},{"key":"B3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/356789.356797","article-title":"Data structures for range searching","volume":"11","author":"Bentley","year":"1979","journal-title":"ACM Comput. Surv."},{"key":"B4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Commun. ACM."},{"key":"B5","unstructured":"Calorimetry for lepton collider experiments-calice results and activities2012"},{"key":"B6","first-page":"8532605","article-title":"Offline reconstruction algorithms for the CMS high granularity calorimeter for HL-LHC","author":"Chen","year":"2017"},{"year":"2017","key":"B7","article-title":"The phase-2 upgrade of the CMS endcap calorimeter"},{"key":"B8","first-page":"226","article-title":"A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise","author":"Ester","year":"1996"},{"key":"B9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/971697.602266","article-title":"R-trees","volume":"14","author":"Guttman","year":"1984","journal-title":"SIGMOD Rec."},{"key":"B10","first-page":"744","volume-title":"Data mining: concepts and techniques","author":"Han","year":"2012"},{"key":"B11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1038\/scientificamerican0666-42","article-title":"Molecular model-building by computer","volume":"214","author":"Levinthal","year":"1966","journal-title":"Sci. Am."},{"key":"B12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/tit.1982.1056489","article-title":"Least squares quantization in pcm","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Trans. Inf. Theor."},{"key":"B13","doi-asserted-by":"crossref","DOI":"10.1007\/b107408","volume-title":"Data mining and knowledge discovery handbook","author":"Maimon","year":"2005"},{"volume-title":"Nvidia cuda c programming guide","year":"2010","key":"B14"},{"key":"B15","first-page":"2825","article-title":"Scikit-learn: machine learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."},{"volume-title":"Intel threading building blocks: outfitting C++ for multi-core processor parallelism","year":"2007","author":"Reinders","key":"B16"},{"volume-title":"Spatial databases: with application to GIS","year":"2001","author":"Rigaux","key":"B17"},{"key":"B18","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"B19","first-page":"631","article-title":"Alpaka\u2013an abstraction library for parallel kernel acceleration","author":"Zenker","year":"2016"}],"container-title":["Frontiers in Big Data"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fdata.2020.591315\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T02:38:38Z","timestamp":1669775918000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fdata.2020.591315\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,27]]},"references-count":19,"alternative-id":["10.3389\/fdata.2020.591315"],"URL":"https:\/\/doi.org\/10.3389\/fdata.2020.591315","relation":{},"ISSN":["2624-909X"],"issn-type":[{"type":"electronic","value":"2624-909X"}],"subject":[],"published":{"date-parts":[[2020,11,27]]}}}