{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T07:59:25Z","timestamp":1776931165078,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":88,"publisher":"ACM","funder":[{"name":"Barcelona Zettascale Laboratory, with support from the Spanish Ministry for Digital Transformation and Public Services, within the framework of the Recovery and Resilience Facility and the European Union � NextGenerationEU","award":["REGAGE22e00058408992"],"award-info":[{"award-number":["REGAGE22e00058408992"]}]},{"name":"Spanish Ministry of Science and Innovation (MICIU), the State Research Agency (AEI), and FEDER, European Union","award":["ST4HPC (PID2023-147979NB-C21)"],"award-info":[{"award-number":["ST4HPC (PID2023-147979NB-C21)"]}]},{"name":"EuroHPC initiative, in part by the Spanish Government under Grants PCI2021-121964, TEXTAROSSA","award":["956831"],"award-info":[{"award-number":["956831"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,10,18]]},"DOI":"10.1145\/3725843.3756080","type":"proceedings-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T17:19:56Z","timestamp":1760721596000},"page":"1549-1564","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Boosting Task Scheduling Data Locality with Low-latency, HW-accelerated Label Propagation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9461-9183","authenticated-orcid":false,"given":"Lucas","family":"Morais","sequence":"first","affiliation":[{"name":"Computer Sciences - Programming Models, Barcelona Supercomputing Center, Barcelona, Catalonia, Spain; Computer Architecture Department, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Catalonia, Spain and Emerging Accelerators Team, HPE Labs, Milpitas, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7427-9118","authenticated-orcid":false,"given":"Juan Miguel de Haro","family":"Ruiz","sequence":"additional","affiliation":[{"name":"Computer Sciences - Programming Models, Barcelona Supercomputing Center, Barcelona, Catalonia, Spain and Computer Architecture Department, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Catalonia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5746-4154","authenticated-orcid":false,"given":"Alfredo","family":"Goldman","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Statistics, University of S\u00e3o Paulo, S\u00e3o Paulo, S\u00e3o Paulo, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4869-5190","authenticated-orcid":false,"given":"Guido","family":"Araujo","sequence":"additional","affiliation":[{"name":"Institute of Computing, University of Campinas, Campinas, S\u00e3o Paulo, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4501-8672","authenticated-orcid":false,"given":"Giacomo","family":"Pedretti","sequence":"additional","affiliation":[{"name":"Emerging Accelerators Team, HPE Labs, Milpitas, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5091-3674","authenticated-orcid":false,"given":"Jim","family":"Ignowski","sequence":"additional","affiliation":[{"name":"Emerging Accelerators Team, HPE Labs, Fort Collins, Colorado, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5963-2165","authenticated-orcid":false,"given":"Michael","family":"Frank","sequence":"additional","affiliation":[{"name":"Independent Researcher, Sunnyvale, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0417-3430","authenticated-orcid":false,"given":"Xavier","family":"Martorell","sequence":"additional","affiliation":[{"name":"Computer Sciences - Programming Models, Barcelona Supercomputing Center, Barcelona, Catalonia, Spain and Computer Architecture Department, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Catalonia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6064-7883","authenticated-orcid":false,"given":"Daniel","family":"Jim\u00e9nez-Gonz\u00e1lez","sequence":"additional","affiliation":[{"name":"Computer Sciences - Programming Models, Barcelona Supercomputing Center, Barcelona, Catalonia, Spain and Computer Architecture Department, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Catalonia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0536-5183","authenticated-orcid":false,"given":"Carlos","family":"\u00c1lvarez","sequence":"additional","affiliation":[{"name":"Computer Sciences - Programming Models, Barcelona Supercomputing Center, Barcelona, Catalonia, Spain and Computer Architecture Department, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Catalonia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378454"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442538"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Rodrigo Aldecoa and Ignacio Marin. 2011. Deciphering network community structure by surprise. PloS one 6 9 (2011) e24195.","DOI":"10.1371\/journal.pone.0024195"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688523"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"Daniel Aloise Sonia Cafieri Gilles Caporossi Pierre Hansen Sylvain Perron and Leo Liberti. 2010. Column generation algorithms for exact modularity maximization in networks. Physical Review E\u2014Statistical Nonlinear and Soft Matter Physics 82 4 (2010) 046112.","DOI":"10.1103\/PhysRevE.82.046112"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Daniel Aloise Amit Deshpande Pierre Hansen and Preyas Popat. 2009. NP-hardness of Euclidean sum-of-squares clustering. Machine learning 75 (2009) 245\u2013248.","DOI":"10.1007\/s10994-009-5103-0"},{"key":"e_1_3_3_2_8_2","unstructured":"David \u00c1lvarez and Vicen\u00e7 Beltran. 2022. Accelerating Task-based Iterative Applications. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2208.06332 (2022)."},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"David \u00c1lvarez and Vicen\u00e7 Beltran. 2023. Optimizing iterative data-flow scientific applications using directed cyclic graphs. IEEE access 11 (2023) 51971\u201351984.","DOI":"10.1109\/ACCESS.2023.3269902"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10762-2_22"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Samin Aref Mahdi Mostajabdaveh and Hriday Chheda. 2024. Bayan algorithm: Detecting communities in networks through exact and approximate optimization of modularity. Physical Review E 110 4 (2024) 044315.","DOI":"10.1103\/PhysRevE.110.044315"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277678"},{"key":"e_1_3_3_2_13_2","volume-title":"The Rocket Chip Generator","author":"Asanovi\u0107 Krste","year":"2016","unstructured":"Krste Asanovi\u0107, Rimas Avizienis, Jonathan Bachrach, Scott Beamer, David Biancolin, Christopher Celio, Henry Cook, Daniel Dabbelt, John Hauser, Adam Izraelevitz, Sagar Karandikar, Ben Keller, Donggyu Kim, John Koenig, Yunsup Lee, Eric Love, Martin Maas, Albert Magyar, Howard Mao, Miquel Moreto, Albert Ou, David\u00a0A. Patterson, Brian Richards, Colin Schmidt, Stephen Twigg, Huy Vo, and Andrew Waterman. 2016. The Rocket Chip Generator. Technical Report UCB\/EECS-2016-17. http:\/\/www2.eecs.berkeley.edu\/Pubs\/TechRpts\/2016\/EECS-2016-17.html"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Vincent\u00a0D Blondel Jean-Loup Guillaume Renaud Lambiotte and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 2008 10 (2008) P10008.","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0D Blumofe Christopher\u00a0F Joerg Bradley\u00a0C Kuszmaul Charles\u00a0E Leiserson Keith\u00a0H Randall and Yuli Zhou. 1995. Cilk: An efficient multithreaded runtime system. ACM SigPlan Notices 30 8 (1995) 207\u2013216.","DOI":"10.1145\/209937.209958"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0D Blumofe and Charles\u00a0E Leiserson. 1999. Scheduling multithreaded computations by work stealing. Journal of the ACM (JACM) 46 5 (1999) 720\u2013748.","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Rouhollah\u00a0Javadpour Boroujeni and Seyfollah Soleimani. 2022. The role of influential nodes and their influence domain in community detection: An approximate method for maximizing modularity. Expert Systems with Applications 202 (2022) 117452.","DOI":"10.1016\/j.eswa.2022.117452"},{"key":"e_1_3_3_2_18_2","unstructured":"Ulrik Brandes Daniel Delling Marco Gaertler Robert G\u00f6rke Martin Hoefer Zoran Nikoloski and Dorothea Wagner. 2006. Maximizing modularity is hard. arXiv preprint physics\/0608255 (2006)."},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"crossref","unstructured":"Aaron Clauset Mark\u00a0EJ Newman and Cristopher Moore. 2004. Finding community structure in very large networks. Physical Review E\u2014Statistical Nonlinear and Soft Matter Physics 70 6 (2004) 066111.","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"Gennaro Cordasco and Luisa Gargano. 2012. Label propagation algorithm: a semi-synchronous approach. International Journal of Social Network Mining 1 1 (2012) 3\u201326.","DOI":"10.1504\/IJSNM.2012.045103"},{"key":"e_1_3_3_2_22_2","unstructured":"Gabor Csardi and Tamas Nepusz. 2006. The igraph software package for complex network research. InterJournal Complex Systems (2006) 1695. https:\/\/igraph.org"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Bhaskar DasGupta and Devendra Desai. 2013. On the complexity of Newman\u2019s community finding approach for biological and social networks. J. Comput. System Sci. 79 1 (2013) 50\u201367.","DOI":"10.1016\/j.jcss.2012.04.003"},{"key":"e_1_3_3_2_24_2","unstructured":"Juan\u00a0Miguel De\u00a0Haro Jaume Bosch Antonio Filgueras Miquel Vidal Daniel Jim\u00e9nez-Gonz\u00e1lez Carlos \u00c1lvarez Xavier Martorell Eduard Ayguad\u00e9 and Jes\u00fas Labarta. 2021. OmpSs@ FPGA framework for high performance FPGA computing. IEEE Trans. Comput. 70 12 (2021) 2029\u20132042."},{"key":"e_1_3_3_2_25_2","volume-title":"moodycamel::ConcurrentQueue\u2014 A fast multi-producer, multi-consumer lock-free concurrent queue for C++11","author":"Desautels Cameron","year":"2024","unstructured":"Cameron Desautels. 2024. moodycamel::ConcurrentQueue\u2014 A fast multi-producer, multi-consumer lock-free concurrent queue for C++11. https:\/\/github.com\/cameron314\/concurrentqueue Accessed: 2025-02-22."},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2018.8573486"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Jordi Duch and Alex Arenas. 2005. Community detection in complex networks using extremal optimization. Physical Review E\u2014Statistical Nonlinear and Soft Matter Physics 72 2 (2005) 027104.","DOI":"10.1103\/PhysRevE.72.027104"},{"key":"e_1_3_3_2_29_2","unstructured":"Tobias Fleck Andrea Kappes and Dorothea Wagner. 2013. Graph clustering with surprise: Complexity and exact solutions. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1310.6019 (2013)."},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"crossref","unstructured":"Daniel Gamermann and Jos\u00e9\u00a0Ant\u00f4nio Pellizzaro. 2022. An algorithm for network community structure determination by surprise. Physica A: Statistical Mechanics and its Applications 595 (2022) 127063.","DOI":"10.1016\/j.physa.2022.127063"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Teofilo Gonzalez and Sartaj Sahni. 1976. Open shop scheduling to minimize finish time. Journal of the ACM (JACM) 23 4 (1976) 665\u2013679.","DOI":"10.1145\/321978.321985"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Benjamin\u00a0H Good Yves-Alexandre De\u00a0Montjoye and Aaron Clauset. 2010. Performance of modularity maximization in practical contexts. Physical Review E\u2014Statistical Nonlinear and Soft Matter Physics 81 4 (2010) 046106.","DOI":"10.1103\/PhysRevE.81.046106"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"crossref","unstructured":"Robert G\u00f6rke Marco Gaertler Florian H\u00fcbner and Dorothea Wagner. 2010. Computational aspects of lucidity-driven graph clustering.Journal of Graph Algorithms and Applications 14 2 (2010) 165\u2013197.","DOI":"10.7155\/jgaa.00203"},{"key":"e_1_3_3_2_34_2","first-page":"287","volume-title":"Annals of discrete mathematics","author":"Graham Ronald\u00a0Lewis","year":"1979","unstructured":"Ronald\u00a0Lewis Graham, Eugene\u00a0Leighton Lawler, Jan\u00a0Karel Lenstra, and AHG\u00a0Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. In Annals of discrete mathematics. Vol.\u00a05. Elsevier, 287\u2013326."},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"crossref","unstructured":"Andr\u00e1s Gy\u00e1rf\u00e1s and Jen\u00f6 Lehel. 1988. On-line and first fit colorings of graphs. Journal of Graph theory 12 2 (1988) 217\u2013227.","DOI":"10.1002\/jgt.3190120212"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926348"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"crossref","unstructured":"Jing-Jang Hwang Yuan-Chieh Chow Frank\u00a0D Anger and Chung-Yee Lee. 1989. Scheduling precedence graphs in systems with interprocessor communication times. siam journal on computing 18 2 (1989) 244\u2013257.","DOI":"10.1137\/0218016"},{"key":"e_1_3_3_2_38_2","unstructured":"Samia Ijaz Ehsan\u00a0Ullah Munir Waqas Anwar and Wasif Nasir. 2013. Efficient scheduling strategy for task graphs in heterogeneous computing environment.Int. Arab J. Inf. Technol. 10 5 (2013) 486\u2013492."},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783708"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830777"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"crossref","unstructured":"Mark\u00a0C Jeffrey Suvinay Subramanian Cong Yan Joel Emer and Daniel Sanchez. 2016. Unlocking ordered parallelism with the Swarm architecture. IEEE Micro 36 3 (2016) 105\u2013117.","DOI":"10.1109\/MM.2016.12"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"crossref","unstructured":"Bogumi\u0142 Kami\u0144ski Val\u00e9rie Poulin Pawe\u0142 Pra\u0142at Przemys\u0142aw Szufel and Fran\u00e7ois Th\u00e9berge. 2019. Clustering via hypergraph modularity. PloS one 14 11 (2019) e0224307.","DOI":"10.1371\/journal.pone.0224307"},{"key":"e_1_3_3_2_43_2","doi-asserted-by":"crossref","unstructured":"Ravi Kannan Santosh Vempala and Adrian Vetta. 2004. On clusterings: Good bad and spectral. Journal of the ACM (JACM) 51 3 (2004) 497\u2013515.","DOI":"10.1145\/990308.990313"},{"key":"e_1_3_3_2_44_2","first-page":"144","volume-title":"International Conference on Optimization and Applications","author":"Kel\u2019manov Alexander","year":"2018","unstructured":"Alexander Kel\u2019manov, Vladimir Khandeev, and Artem Pyatkin. 2018. NP-hardness of some max-min clustering problems. In International Conference on Optimization and Applications. Springer, 144\u2013154."},{"key":"e_1_3_3_2_45_2","doi-asserted-by":"crossref","unstructured":"Minhaj\u00a0Ahmad Khan. 2012. Scheduling for heterogeneous systems using constrained critical paths. Parallel Comput. 38 4-5 (2012) 175\u2013193.","DOI":"10.1016\/j.parco.2012.01.001"},{"key":"e_1_3_3_2_46_2","doi-asserted-by":"crossref","unstructured":"Sanjeev Kumar Christopher\u00a0J Hughes and Anthony Nguyen. 2007. Carbon: architectural support for fine-grained parallelism on chip multiprocessors. ACM SIGARCH Computer Architecture News 35 2 (2007) 162\u2013173.","DOI":"10.1145\/1273440.1250683"},{"key":"e_1_3_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC50609.2020.00039"},{"key":"e_1_3_3_2_48_2","doi-asserted-by":"crossref","unstructured":"Juyong Lee Steven\u00a0P Gross and Jooyoung Lee. 2012. Modularity optimization by conformational space annealing. Physical Review E\u2014Statistical Nonlinear and Soft Matter Physics 85 5 (2012) 056702.","DOI":"10.1103\/PhysRevE.85.056702"},{"key":"e_1_3_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630048"},{"key":"e_1_3_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48096-0_17"},{"key":"e_1_3_3_2_51_2","doi-asserted-by":"crossref","unstructured":"Keqin Li. 2012. Scheduling precedence constrained tasks with reduced processor energy on multiprocessor computers. IEEE Trans. Comput. 61 12 (2012) 1668\u20131681.","DOI":"10.1109\/TC.2012.120"},{"key":"e_1_3_3_2_52_2","doi-asserted-by":"crossref","unstructured":"John\u00a0DC Little. 1961. A proof for the queuing formula: L= \u03bb W. Operations research 9 3 (1961) 383\u2013387.","DOI":"10.1287\/opre.9.3.383"},{"key":"e_1_3_3_2_53_2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/CEC.2017.7969345","volume-title":"2017 IEEE Congress on Evolutionary Computation (CEC)","author":"Liu Wenfeng","year":"2017","unstructured":"Wenfeng Liu, Shanfeng Wang, Maoguo Gong, and Mingyang Zhang. 2017. An improved multiobjective evolutionary approach for community detection in multilayer networks. In 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE, 443\u2013449."},{"key":"e_1_3_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"e_1_3_3_2_55_2","doi-asserted-by":"crossref","unstructured":"Lucas Morais Carlos \u00c1lvarez Daniel Jim\u00e9nez-Gonz\u00e1lez Juan\u00a0Miguel de Haro Guido Araujo Michael Frank Alfredo Goldman and Xavier Martorell. 2023. Enabling HW-based task scheduling in large multicore architectures. IEEE Trans. Comput. (2023).","DOI":"10.1109\/TC.2023.3323781"},{"key":"e_1_3_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358271"},{"key":"e_1_3_3_2_57_2","doi-asserted-by":"crossref","unstructured":"Ananya Muddukrishna Peter\u00a0A Jonsson and Mats Brorsson. 2015. Locality-Aware Task Scheduling and Data Distribution for OpenMP Programs on NUMA Systems and Manycore Processors. Scientific Programming 2015 1 (2015) 981759.","DOI":"10.1155\/2015\/981759"},{"key":"e_1_3_3_2_58_2","doi-asserted-by":"crossref","unstructured":"Mark\u00a0EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E 69 2 (2004) 026113.","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_3_2_59_2","unstructured":"Andrew Ng Michael Jordan and Yair Weiss. 2001. On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems 14 (2001)."},{"key":"e_1_3_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_3_2_61_2","doi-asserted-by":"crossref","unstructured":"Poornima Nookala Kyle Chard and Ioan Raicu. 2024. X-OpenMP\u2014eXtreme fine-grained tasking using lock-less work stealing. Future Generation Computer Systems 159 (2024) 444\u2013458.","DOI":"10.1016\/j.future.2024.05.019"},{"key":"e_1_3_3_2_62_2","volume-title":"PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation","author":"O\u2019Neill Melissa\u00a0E.","year":"2014","unstructured":"Melissa\u00a0E. O\u2019Neill. 2014. PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation. Technical Report HMC-CS-2014-0905. Harvey Mudd College, Claremont, CA."},{"key":"e_1_3_3_2_63_2","doi-asserted-by":"crossref","unstructured":"Pascal Pons and Matthieu Latapy. 2006. Computing communities in large networks using random walks. Journal of graph algorithms and applications 10 2 (2006) 191\u2013218.","DOI":"10.7155\/jgaa.00124"},{"key":"e_1_3_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508432"},{"key":"e_1_3_3_2_65_2","doi-asserted-by":"crossref","unstructured":"Usha\u00a0Nandini Raghavan R\u00e9ka Albert and Soundar Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Physical Review E\u2014Statistical Nonlinear and Soft Matter Physics 76 3 (2007) 036106.","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_3_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755616"},{"key":"e_1_3_3_2_67_2","doi-asserted-by":"crossref","unstructured":"Peter\u00a0J Rousseeuw. 1987. Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. Journal of computational and applied mathematics 20 (1987) 53\u201365.","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_3_2_68_2","doi-asserted-by":"crossref","unstructured":"Jianbo Shi and Jitendra Malik. 2000. Normalized cuts and image segmentation. IEEE Transactions on pattern analysis and machine intelligence 22 8 (2000) 888\u2013905.","DOI":"10.1109\/34.868688"},{"key":"e_1_3_3_2_69_2","first-page":"530","volume-title":"International Conference on Current Trends in Theory and Practice of Computer Science","author":"\u0160\u00edma Ji\u0159\u00ed","year":"2006","unstructured":"Ji\u0159\u00ed \u0160\u00edma and Satu\u00a0Elisa Schaeffer. 2006. On the NP-completeness of some graph cluster measures. In International Conference on Current Trends in Theory and Practice of Computer Science. Springer, 530\u2013537."},{"key":"e_1_3_3_2_70_2","doi-asserted-by":"crossref","unstructured":"Issey Sukeda Atsushi Miyauchi and Akiko Takeda. 2023. A study on modularity density maximization: Column generation acceleration and computational complexity analysis. European Journal of Operational Research 309 2 (2023) 516\u2013528.","DOI":"10.1016\/j.ejor.2023.01.061"},{"key":"e_1_3_3_2_71_2","doi-asserted-by":"crossref","unstructured":"Xubin Tan Jaume Bosch Carlos \u00c1lvarez Daniel Jim\u00e9nez-Gonz\u00e1lez Eduard Ayguad\u00e9 and Mateo Valero. 2019. A hardware runtime for task-based programming models. IEEE Transactions on Parallel and Distributed Systems 30 9 (2019) 1932\u20131946.","DOI":"10.1109\/TPDS.2019.2907493"},{"key":"e_1_3_3_2_72_2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/ISPASS.2016.7482097","volume-title":"2016 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)","author":"Tan Xubin","year":"2016","unstructured":"Xubin Tan, Jaume Bosch, Daniel Jim\u00e9nez-Gonz\u00e1lez, Carlos \u00c1lvarez-Mart\u00ednez, Eduard Ayguad\u00e9, and Mateo Valero. 2016. Performance analysis of a hardware accelerator of dependence management for task-based dataflow programming models. In 2016 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS). IEEE, 225\u2013234."},{"key":"e_1_3_3_2_73_2","doi-asserted-by":"crossref","unstructured":"Camila\u00a0PS Tautenhain and Mari\u00e1\u00a0CV Nascimento. 2020. An ensemble based on a bi-objective evolutionary spectral algorithm for graph clustering. Expert Systems with Applications 141 (2020) 112911.","DOI":"10.1016\/j.eswa.2019.112911"},{"key":"e_1_3_3_2_74_2","unstructured":"Label Propagation\u00a0HW Team. 2025. Task-LP Repository. https:\/\/gitlab.com\/label-prop-hw\/task-lp.git. Accessed: 2025-02-22."},{"key":"e_1_3_3_2_75_2","doi-asserted-by":"crossref","unstructured":"Qiao Tian Jingmei Li Di Xue Weifei Wu Jiaxiang Wang Lei Chen and Juzhen Wang. 2020. A hybrid task scheduling algorithm based on task clustering. Mobile Networks and Applications 25 (2020) 1518\u20131527.","DOI":"10.1007\/s11036-019-01356-x"},{"key":"e_1_3_3_2_76_2","doi-asserted-by":"crossref","unstructured":"Haluk Topcuoglu Salim Hariri and Min-You Wu. 2002. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE transactions on parallel and distributed systems 13 3 (2002) 260\u2013274.","DOI":"10.1109\/71.993206"},{"key":"e_1_3_3_2_77_2","volume-title":"AMD Granite Ridge and Strix Point Zen 5 Die-sizes and Transistor Counts Confirmed","year":"2024","unstructured":"TP. 2024. AMD Granite Ridge and Strix Point Zen 5 Die-sizes and Transistor Counts Confirmed. https:\/\/www.techpowerup.com\/324562\/amd-granite-ridge-and-strix-point-zen-5-die-sizes-and-transistor-counts-confirmed Accessed: February 21, 2025."},{"key":"e_1_3_3_2_78_2","doi-asserted-by":"crossref","unstructured":"Vincent\u00a0A Traag and Lovro \u0160ubelj. 2023. Large network community detection by fast label propagation. Scientific Reports 13 1 (2023) 2701.","DOI":"10.1038\/s41598-023-29610-z"},{"key":"e_1_3_3_2_79_2","unstructured":"Anton Tsitsulin John Palowitch Bryan Perozzi and Emmanuel M\u00fcller. 2023. Graph clustering with graph neural networks. Journal of Machine Learning Research 24 127 (2023) 1\u201321."},{"key":"e_1_3_3_2_80_2","doi-asserted-by":"crossref","unstructured":"Ulrike Von\u00a0Luxburg. 2007. A tutorial on spectral clustering. Statistics and computing 17 (2007) 395\u2013416.","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_3_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242805"},{"key":"e_1_3_3_2_82_2","doi-asserted-by":"crossref","unstructured":"Guohua Wu Jin Liu Manhao Ma and Dishan Qiu. 2013. A two-phase scheduling method with the consideration of task clustering for earth observing satellites. Computers & Operations Research 40 7 (2013) 1884\u20131894.","DOI":"10.1016\/j.cor.2013.02.009"},{"key":"e_1_3_3_2_83_2","doi-asserted-by":"crossref","unstructured":"Gang Xu Sophia Tsoka and Lazaros\u00a0G Papageorgiou. 2007. Finding community structures in complex networks using mixed integer optimisation. The European Physical Journal B 60 (2007) 231\u2013239.","DOI":"10.1140\/epjb\/e2007-00331-0"},{"key":"e_1_3_3_2_84_2","doi-asserted-by":"crossref","unstructured":"Zhao Yang Ren\u00e9 Algesheimer and Claudio\u00a0J Tessone. 2016. A comparative analysis of community detection algorithms on artificial networks. Scientific reports 6 1 (2016) 30750.","DOI":"10.1038\/srep30750"},{"key":"e_1_3_3_2_85_2","doi-asserted-by":"crossref","unstructured":"Fahimeh Yazdanpanah Carlos \u00c1lvarez Daniel Jim\u00e9nez-Gonz\u00e1lez Rosa\u00a0M Badia and Mateo Valero. 2015. Picos: A hardware runtime architecture support for OmpSs. Future Generation Computer Systems 53 (2015) 130\u2013139.","DOI":"10.1016\/j.future.2014.12.010"},{"key":"e_1_3_3_2_86_2","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356160"},{"key":"e_1_3_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3659962"},{"key":"e_1_3_3_2_88_2","doi-asserted-by":"publisher","DOI":"10.1145\/3368826.3377909"},{"key":"e_1_3_3_2_89_2","unstructured":"Xiaojin Zhu and Zoubin Ghahramani. 2002. Learning from labeled and unlabeled data with label propagation. ProQuest number: information to all users (2002)."}],"event":{"name":"MICRO 2025: 58th IEEE\/ACM International Symposium on Microarchitecture","location":"Seoul Korea","acronym":"MICRO 2025","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 58th IEEE\/ACM International Symposium on Microarchitecture"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725843.3756080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T21:46:50Z","timestamp":1769464010000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725843.3756080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"references-count":88,"alternative-id":["10.1145\/3725843.3756080","10.1145\/3725843"],"URL":"https:\/\/doi.org\/10.1145\/3725843.3756080","relation":{},"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"2025-10-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}