{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:43:52Z","timestamp":1782999832071,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T00:00:00Z","timestamp":1783209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3797905.3807858","type":"proceedings-article","created":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T11:50:37Z","timestamp":1782993037000},"page":"106-118","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Continuation-Preserving Tiling for Pointer-Chasing Optimization in Structured Mutual Recursion"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6564-9490","authenticated-orcid":false,"given":"Avinash","family":"Kumar","sequence":"first","affiliation":[{"name":"IIT Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7035-7844","authenticated-orcid":false,"given":"Virendra","family":"Singh","sequence":"additional","affiliation":[{"name":"IIT Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6180-9084","authenticated-orcid":false,"given":"Supratim","family":"Biswas","sequence":"additional","affiliation":[{"name":"IIT Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,5]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Sam Ainsworth and Timothy M. Jones \u201cSoftware prefetching for indirect memory accesses \u201d In Proceedings of the 2017 International Symposium on Code Generation and Optimization (CGO \u201917). IEEE Press pp. 305\u2013317.","DOI":"10.1109\/CGO.2017.7863749"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Sam Ainsworth and Timothy M. Jones \u201cSoftware Prefetching for Indirect Memory Accesses: A Microarchitectural Perspective \u201d ACM Trans. Comput. Syst. 36 3 Article 8 (August 2018).","DOI":"10.1145\/3319393"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"crossref","unstructured":"Heiner Litz Grant Ayers and Parthasarathy Ranganathan \u201cCRISP: critical slice prefetching \u201d In ASPLOS 2022.","DOI":"10.1145\/3503222.3507745"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Grant Ayers Heiner Litz Christos Kozyrakis and Parthasarathy Ranganathan \u201cClassifying Memory Access Patterns for Prefetching \u201d In Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) 2020.","DOI":"10.1145\/3373376.3378498"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"Leslie Lamport \u201cThe parallel execution of DO loops \u201d Commun. ACM 17 2 (Feb. 1974) 1974 83\u201393.","DOI":"10.1145\/360827.360844"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"U. Banerjee S. C. Chen D. Kuck and R. Towle \u201cTime and Parallel Processor Bounds for Fortran-Like Loops \u201d IEEE Trans. on Computers C-28 (9): 660\u2013670 (September 1979).","DOI":"10.1109\/TC.1979.1675434"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"crossref","unstructured":"F. Irigoin and R. Triolet \u201cSupernode partitioning \u201d In Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL \u201988) 1988 319\u2013329.","DOI":"10.1145\/73560.73588"},{"key":"e_1_3_3_1_9_2","unstructured":"Jack Dongarra and Robert Schreiber. 1990. Automatic Blocking of Nested Loops. NASA Technical Report."},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Michael Wolfe \u201cLoop skewing: the wavefront method revisited \u201d Int. J. Parallel Program. 15 4 (Oct. 1986) 279\u2013293.","DOI":"10.1007\/BF01407876"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"M. Wolfe \u201cMore iteration space tiling \u201d In Proceedings of the 1989 ACM\/IEEE conference on Supercomputing (Supercomputing \u201989) 1989 655\u2013664.","DOI":"10.1145\/76263.76337"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Michael E. Wolf and Monica S. Lam \u201cA data locality optimizing algorithm \u201d In Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation (PLDI \u201991) 1991 pp. 30 \u2013 44.","DOI":"10.1145\/113445.113449"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"Monica D. Lam Edward E. Rothberg and Michael E. Wolf \u201cThe cache performance and optimizations of blocked algorithms \u201d In Proceedings of the fourth international conference on Architectural support for programming languages and operating systems (ASPLOS IV) 1991 pp. 63 \u2013 74.","DOI":"10.1145\/106972.106981"},{"key":"e_1_3_3_1_14_2","unstructured":"Ken Kennedy and John R. Allen. 2002. Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann Publishers Inc. San Francisco CA USA."},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Paul Feautrier \u201cSome Efficient Solutions to the Affine Scheduling Problem: I. One-dimensional Time \u201d Int. J. Parallel Program. 21 5 (Oct. 1992) 1992 313\u2013348.","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Paul Feautrier \u201cSome efficient solutions to the affine scheduling problem. Part II. Multidimensional time \u201d International Journal of Parallel Programming 21 6 (01 Dec 1992) 1992 389\u2013420.","DOI":"10.1007\/BF01379404"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"crossref","unstructured":"Uday Bondhugula Albert Hartono J. Ramanujam and P. Sadayappan \u201cA Practical Automatic Polyhedral Parallelizer and Locality Optimizer \u201d In Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) 2008 101\u2013113.","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_3_3_1_18_2","unstructured":"Utpal Banerjee \u201cUnimodular Transformations of Double Loops \u201d In Languages and Compilers for Parallel Computing 1991."},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"J. P. Singh C. Holt T. Totsuka A. Gupta and J. Hennessy \u201cLoad balancing and data locality in adaptive hierarchical n-body methods: Barnes-hut fast multipole and radiosity \u201d J. Parallel Distrib. Comput. 27(2):118\u2013141 1995.","DOI":"10.1006\/jpdc.1995.1077"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"M. Amor F. Arguello J. Lopez O. G. Plata and E. L. Zapata \u201cA data parallel formulation of the barnes-hut method for n -body simulations \u201d In Proceedings of the 5th International Workshop on Applied Parallel Computing New Paradigms for HPC in Industry and Academia pages 342\u2013349 2001.","DOI":"10.1007\/3-540-70734-4_40"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"crossref","unstructured":"V. K. Pingali S. A. McKee W. C. Hseih and J. B. Carter \u201cComputation regrouping: restructuring programs for temporal data cache locality \u201d In Proceedings of the 16th international conference on Supercomputing pages 252\u2013261 2002.","DOI":"10.1145\/514191.514227"},{"key":"e_1_3_3_1_22_2","unstructured":"Youngjoon Jo and Milind Kulkarni \u201cEnhancing Locality for Recursive Traversals of Recursive Structures \u201d In Proceedings of the 2011 ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA) 2011."},{"key":"e_1_3_3_1_23_2","unstructured":"Youngjoon Jo and Milind Kulkarni \u201cAutomatically Enhancing Locality for Tree Traversals with Traversal Splicing \u201d In Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA) 2012."},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"crossref","unstructured":"Youngjoon Jo Michael Goldfarb and Milind Kulkarni \u201cAutomatic Vectorization of Tree Traversals \u201d In Proceedings of the 22nd ACM international conference on Parallel architectures and compilation techniques (PACT\u201913) 2013 363\u2013374.","DOI":"10.1109\/PACT.2013.6618825"},{"key":"e_1_3_3_1_25_2","unstructured":"Noel Pouchet Fabrice Rastello Robert J. Harrison and P. Sadayappan \u201cA Domain-specific Compiler for a Parallel Multiresolution Adaptive Numerical Simulation Environment \u201d In Proceedings of the International Conference for High Performance Computing Networking Storage and Analysis (SC) 2016."},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"crossref","unstructured":"Samyam Rajbhandari Jinsung Kim Sriram Krishnamoorthy Louis-Noel Pouchet Fabrice Rastello Robert J. Harrison and P. Sadayappan \u201cOn Fusing Recursive Traversals of K-d Trees \u201d In Proceedings of the 25th International Conference on Compiler Construction (CC) 2016.","DOI":"10.1145\/2892208.2892228"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Laith Sakka Kirshanthan Sundararajah and Milind Kulkarni \u201cTreeFuser: A Framework for Analyzing and Fusing General Recursive Tree Traversals \u201d Proc. ACM Program. Lang. 1 OOPSLA Article 76 (Oct. 2017) 30 pages.","DOI":"10.1145\/3133900"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"crossref","unstructured":"Kirshanthan Sundararajah Laith Sakka and Milind Kulkarni \u201cLocality Transformations for Nested Recursive Iteration Spaces \u201d SIGPLAN Not. 52 4 (April 2017) 281\u2013295.","DOI":"10.1145\/3093336.3037720"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"crossref","unstructured":"Eleanor Davies and Sara Kalvala \u201cPostcondition-preserving fusion of postorder tree transformations \u201d In Proceedings of the 29th International Conference on Compiler Construction (CC) 2020.","DOI":"10.1145\/3377555.3377884"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"crossref","unstructured":"Laith Sakka Kirshanthan Sundararajah Ryan R. Newton and Milind Kulkarni \u201cSound fine-grained traversal fusion for heterogeneous trees \u201d In Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) 2019 830\u2013844.","DOI":"10.1145\/3314221.3314626"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"crossref","unstructured":"Vidush Singhal Laith Sakka Kirshanthan Sundararajah Ryan Newton and Milind Kulkarni \u201cOrchard: Heterogeneous Parallelism and Fine-grained Fusion for Complex Tree Traversals \u201d ACM Trans. Archit. Code Optim. 21 2 Article 41 (June 2024) 25 pages.","DOI":"10.1145\/3652605"},{"key":"e_1_3_3_1_32_2","unstructured":"K. Pingali M. Kulkarni D. Nguyen M. Burtscher M. Mendez-Lojo D. Prountzos X. Sui and Z. Zhong. Amorphous data-parallelism in irregular algorithms. Technical Report TR-09-05 Department of Computer Science The University of Texas at Austin February 2009."},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"crossref","unstructured":"Dmitry Petrashko Ondrej Lhotak and Martin Odersky \u201cMiniphases: compilation using modular and efficient tree transformations \u201d In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) 2017 201\u2013216.","DOI":"10.1145\/3062341.3062346"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"crossref","unstructured":"M. Pharr C. Kolb R. Gershbein and P. Hanrahan \u201cRendering complex scenes with memory-coherent ray tracing \u201d In Proceedings of the 24th annual conference on Computer graphics and interactive techniques pages 101\u2013108 1997.","DOI":"10.1145\/258734.258791"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"crossref","unstructured":"Jianqiao Liu Nikhil Hegde and Milind Kulkarni \u201cHybrid CPU-GPU scheduling and execution of tree traversals \u201d In Proceedings of the 2016 International Conference on Supercomputing (ICS \u201916) pp. 1\u201312 2016.","DOI":"10.1145\/2925426.2926261"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"crossref","unstructured":"Jianqiao Liu Michael Robson Thomas Quinn and Milind Kulkarni \u201cEfficient GPU tree walks for effective distributed n-body simulations \u201d In Proceedings of the ACM International Conference on Supercomputing (ICS \u201919) pp. 24\u201334 2019.","DOI":"10.1145\/3330345.3330348"},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"crossref","unstructured":"Kirshanthan Sundararajah and Milind Kulkarni \u201cComposable sound transformations of nested recursion and loops \u201d In Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) 2019 902\u2013917.","DOI":"10.1145\/3314221.3314592"},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"crossref","unstructured":"Kirshanthan Sundararajah Charitha Saumya and Milind Kulkarni \u201cUniRec: a unimodular-like framework for nested recursions and loops \u201d Proc. ACM Program. Lang. 6 OOPSLA2 Article 170 (October 2022) 27 pages.","DOI":"10.1145\/3563333"},{"key":"e_1_3_3_1_39_2","doi-asserted-by":"crossref","unstructured":"Yusheng Weijiang Shruthi Balakrishna Jianqiao Liu and Milind Kulkarni \u201cTree dependence analysis \u201d In Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) 2015 314\u2013325.","DOI":"10.1145\/2737924.2737972"},{"key":"e_1_3_3_1_40_2","doi-asserted-by":"crossref","unstructured":"Yanjun Wang Jinwei Liu Dalin Zhang and Xiaokang Qiu \u201cReasoning about recursive tree traversals \u201d In Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) 2021 47\u201361.","DOI":"10.1145\/3437801.3441617"},{"key":"e_1_3_3_1_41_2","unstructured":"Albert Cohen and Jean-Francois Collard \u201cInstance-Wise Reaching Definition Analysis for Recursive Programs using Context-Free Transductions \u201d In PACT\u201998. 1998."},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"crossref","unstructured":"Pierre Amiranoff Albert Cohen and Paul Feautrier \u201cBeyond iteration vectors: instancewise relational abstract domains \u201d In Proceedings of the 13th international conference on Static Analysis (SAS\u201906) 2006 pp. 161\u2013180.","DOI":"10.1007\/11823230_11"},{"key":"e_1_3_3_1_43_2","doi-asserted-by":"crossref","unstructured":"C. Lattner and V. Adve \u201cLLVM: a compilation framework for lifelong program analysis & transformation \u201d International Symposium on Code Generation and Optimization (CGO) 2004 pp. 75\u201386.","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_3_1_44_2","doi-asserted-by":"crossref","unstructured":"J. L. Bentley \u201cMultidimensional binary search trees used for associative searching \u201d Commun. ACM 18:509\u2013517 September 1975.","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_3_1_45_2","doi-asserted-by":"crossref","unstructured":"M. Greenspan and M. Yurick \u201cApproximate kd-tree search for efficient ICP \u201d In Fourth International Conference on 3-D Digital Imaging and Modeling pages 442\u2013448 2003.","DOI":"10.1109\/IM.2003.1240280"},{"key":"e_1_3_3_1_46_2","doi-asserted-by":"crossref","unstructured":"V. Rokhlin \u201cRapid solution of integral equations of classical potential theory \u201d Journal of Computational Physics vol. 60 no. 2 pp. 187\u2013207 1985.","DOI":"10.1016\/0021-9991(85)90002-6"},{"key":"e_1_3_3_1_47_2","doi-asserted-by":"crossref","unstructured":"T. Foley and J. Sugerman \u201cKd-tree acceleration structures for a gpu raytracer \u201d in Proceedings of the ACM SIGGRAPH\/EUROGRAPHICS conference on Graphics hardware ser. HWWS\u201905 2005 pp. 15\u201322.","DOI":"10.1145\/1071866.1071869"},{"key":"e_1_3_3_1_48_2","unstructured":"P. N. Yianilos \u201cData structures and algorithms for nearest neighbor search in general metric spaces \u201d in SODA vol. 93 no. 194 1993 pp. 311\u2013321."},{"key":"e_1_3_3_1_49_2","doi-asserted-by":"crossref","unstructured":"J. Han J. Pei and Y. Yin \u201cMining frequent patterns without candidate generation \u201d in ACM Sigmod Record vol. 29 no. 2. ACM 2000 pp. 1\u201312.","DOI":"10.1145\/335191.335372"},{"key":"e_1_3_3_1_50_2","unstructured":"K. Alsabti S. Ranka and V. Singh \u201cAn efficient k-means clustering algorithm \u201d 1997."},{"key":"e_1_3_3_1_51_2","doi-asserted-by":"crossref","unstructured":"J. Barnes and P. Hut \u201cA hierarchical o(nlogn) force-calculation algorithm \u201d Nature 324(4):446\u2013449 December 1986.","DOI":"10.1038\/324446a0"},{"key":"e_1_3_3_1_52_2","unstructured":"A. G. Gray and A. W. Moore \u201cN-Body Problems in Statistical Learning \u201d In T. K. Leen T. G. Dietterich and V. Tresp editors Advances in Neural Information Processing Systems (NIPS) 13 (Dec 2000) 2001."},{"key":"e_1_3_3_1_53_2","doi-asserted-by":"crossref","unstructured":"K. Toru L. Gunho A. Hiroki A. Setsuo and P. Kunsoo \u201cLinear-time longest-common-prefix computation in suffix arrays and its applications \u201d in Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching A. Amir Ed. Springer-Verlag London UK 07 2001 pp. 181\u2013192.","DOI":"10.1007\/3-540-48194-X_17"},{"key":"e_1_3_3_1_54_2","doi-asserted-by":"crossref","unstructured":"N. Hegde J. Liu K. Sundararajah and M. Kulkarni \u201cTreelogy: A benchmark suite for tree traversals \u201d 2017 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) 2017 pp. 227\u2013238.","DOI":"10.1109\/ISPASS.2017.7975294"},{"key":"e_1_3_3_1_55_2","unstructured":"Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2009. Introduction to Algorithms Third Edition (3rd. ed.). The MIT Press."},{"key":"e_1_3_3_1_56_2","doi-asserted-by":"crossref","unstructured":"D. D. Sleator and R. E. Tarjan \u201cSelf Adjusting Heaps \u201d SIAM J. Comput. 15(1):52\u201369 Feb. 1986.","DOI":"10.1137\/0215004"}],"event":{"name":"ICS '26: 2026 International Conference on Supercomputing","location":"Belfast United Kingdom","acronym":"ICS '26","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 40th ACM International Conference on Supercomputing"],"original-title":[],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T12:52:56Z","timestamp":1782996776000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3797905.3807858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,5]]},"references-count":55,"alternative-id":["10.1145\/3797905.3807858","10.1145\/3797905"],"URL":"https:\/\/doi.org\/10.1145\/3797905.3807858","relation":{},"subject":[],"published":{"date-parts":[[2026,7,5]]},"assertion":[{"value":"2026-07-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}