{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:10:26Z","timestamp":1759666226885,"version":"3.35.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10766-008-0085-2","type":"journal-article","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T21:07:07Z","timestamp":1222204027000},"page":"592-623","source":"Crossref","is-referenced-by-count":7,"title":["A Compile\/Run-time Environment for the Automatic Transformation of Linked List Data Structures"],"prefix":"10.1007","volume":"36","author":[{"given":"H. L. A.","family":"van der Spek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Groot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. M.","family":"Bakker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. A. G.","family":"Wijshoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,24]]},"reference":[{"key":"85_CR1","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Hu, H.: An adaptive packed-memory array. In: PODS \u201906: Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 20\u201329. ACM Press, New York, NY, USA (2006)","DOI":"10.1145\/1142351.1142355"},{"key":"85_CR2","unstructured":"Bik, A.J.C. (ed.): Compiler Support for Sparse Matrices, PhD Thesis. Leiden University, The Netherlands (1996)"},{"key":"85_CR3","doi-asserted-by":"crossref","unstructured":"Bik, A.J.C., Knijenburg, P.M.W., Wijshoff, H.A.G.: Reshaping access patterns for generating sparse codes. In: LCPC \u201994: Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, pp. 406\u2013420. Springer-Verlag, London, UK (1994)","DOI":"10.1007\/BFb0025893"},{"issue":"1","key":"85_CR4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1006\/jpdc.1995.1141","volume":"31","author":"A.J.C. Bik","year":"1995","unstructured":"Bik A.J.C., Wijshoff H.A.G.: Advanced compiler optimizations for sparse computations. J. Parallel Distrib. Comput. 31(1), 14\u201324 (1995)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"85_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/71.485501","volume":"7","author":"A.J.C. Bik","year":"1996","unstructured":"Bik A.J.C., Wijshoff H.A.G.: Automatic data structure selection and transformation for sparse matrix computations. IEEE Trans. Parallel Distrib. Syst. 7(2), 109\u2013126 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"85_CR6","doi-asserted-by":"crossref","unstructured":"Chilimbi, T.M., Davidson, B., Larus, J.R.: Cache-conscious structure definition. In: PLDI \u201999: Proceedings of the ACM SIGPLAN 1999 Conference on Programming Language Design and Implementation, pp. 13\u201324. ACM Press, New York, NY, USA (1999)","DOI":"10.1145\/301618.301635"},{"key":"85_CR7","doi-asserted-by":"crossref","unstructured":"Chong, S., Rugina, R.: Static analysis of accessed regions in recursive data structures. In: Static Analysis, 10th International Symposium, SAS 2003, pp. 463\u2013482 (2003)","DOI":"10.1007\/3-540-44898-5_26"},{"key":"85_CR8","unstructured":"Duff, I.S., Grimes, R.G., Lewis, J.G.: Users\u2019 guide for the Harwell-Boeing sparse matrix collection (Release I). Technical Report RAL 92-086, Chilton, Oxon, England (1992)"},{"issue":"2","key":"85_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/101363.101366","volume":"9","author":"S.I. Feldman","year":"1990","unstructured":"Feldman S.I., Gay D.M., Maimone M.W., Schryer N.L.: A FORTRAN to C converter. SIGPLAN Fortran Forum 9(2), 21\u201322 (1990)","journal-title":"SIGPLAN Fortran Forum"},{"key":"85_CR10","doi-asserted-by":"crossref","unstructured":"Ghiya, R.: Putting Pointer Analysis to Work, PhD Thesis. School of Computer Science, McGill University, Montreal, Canada (1998)","DOI":"10.1145\/268946.268957"},{"key":"85_CR11","doi-asserted-by":"crossref","unstructured":"Ghiya, R., Hendren, L.J.: Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In: POPL \u201996: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 1\u201315. ACM, New York, NY, USA (1996)","DOI":"10.1145\/237721.237724"},{"key":"85_CR12","doi-asserted-by":"crossref","unstructured":"Ghiya, R., Hendren, L.J., Zhu, Y.: Detecting parallelism in C programs with recursive data structures. In: CC \u201998: Proceedings of the 7th International Conference on Compiler Construction, pp. 159\u2013173. Springer-Verlag, London, UK (1998)","DOI":"10.1007\/BFb0026429"},{"key":"85_CR13","unstructured":"Golovanevsky, O., Zaks, A.: Struct-reorg: current status and future perspectives. In: Proceedings of the GCC Developers\u2019 Summit, pp. 47\u201356. http:\/\/www.gccsummit.org (2007)"},{"key":"85_CR14","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore (1989)"},{"key":"85_CR15","doi-asserted-by":"crossref","unstructured":"Groot, S., van der Spek, H.L.A., Bakker, E.M., Wijshoff, H.A.G.: The automatic transformation of linked list data structures (abstract). In: PACT \u201907: Proceedings of the 16th Intenational Conference on Parallel Architectures and Compilation Techniques. IEEE Computer Society, Washington, DC, USA (2007)","DOI":"10.1109\/PACT.2007.4336236"},{"key":"85_CR16","unstructured":"Hagog, M., Tice, C.: Cache aware data layout reorganization optimization in GCC. In: Proceedings of the GCC Developers\u2019 Summit, pp. 69\u201392. http:\/\/www.gccsummit.org (2005)"},{"key":"85_CR17","doi-asserted-by":"crossref","unstructured":"Hummel, J., Hendren, L.J., Nicolau, A.: A general data dependence test for dynamic, pointer-based data structures. In: PLDI \u201994: Proceedings of the ACM SIGPLAN 1994 conference on Programming language Design and Implementation, pp. 218\u2013229. ACM Press, New York, NY, USA (1994)","DOI":"10.1145\/178243.178262"},{"issue":"1","key":"85_CR18","first-page":"3","volume":"11","author":"Y.-S. Hwang","year":"2003","unstructured":"Hwang Y.-S., Saltz J.: Interprocedural definition-use chains of dynamic pointer-linked data structures. Sci. Program. 11(1), 3\u201337 (2003)","journal-title":"Sci. Program."},{"key":"85_CR19","doi-asserted-by":"crossref","unstructured":"Karlsson, M., Dahlgren, F., Stenstr\u00f6m, P.: A prefetching technique for irregular accesses to linked data structures. In: Proceedings of the Sixth International Symposium on High-Performance Computer Architecture, 8\u201312 January 2000, Toulouse, France, pp. 206\u2013217. IEEE Computer Society, Washington, DC, USA (2000)","DOI":"10.1109\/HPCA.2000.824351"},{"issue":"3","key":"85_CR20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1011172104768","volume":"29","author":"I. Kodukula","year":"2001","unstructured":"Kodukula I., Pingali K.: Data-centric transformations for locality enhancement. Int. J. Parallel Prog. 29(3), 319\u2013364 (2001)","journal-title":"Int. J. Parallel Prog."},{"key":"85_CR21","doi-asserted-by":"crossref","unstructured":"Langella, S., Hastings, S., Oster, S., Kurc, T., Catalyurek, U., Saltz, J.: A distributed data management middleware for data-driven application systems. In: CLUSTER \u201904: Proceedings of the 2004 IEEE International Conference on Cluster Computing, Washington, DC, USA, pp. 267\u2013276. IEEE Computer Society (2004)","DOI":"10.1109\/CLUSTR.2004.1392624"},{"key":"85_CR22","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: Automatic pool allocation for disjoint data structures. In: MSP \u201902: Proceedings of the 2002 Workshop on Memory System Performance, pp. 13\u201324. ACM, New York, NY, USA (2002)","DOI":"10.1145\/773146.773041"},{"key":"85_CR23","doi-asserted-by":"crossref","unstructured":"Lin, Y., Padua, D.: Compiler analysis of irregular memory accesses. In: PLDI \u201900: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, pp. 157\u2013168. ACM Press, New York, NY, USA (2000)","DOI":"10.1145\/349299.349322"},{"key":"85_CR24","doi-asserted-by":"crossref","unstructured":"Luk, C.-K., Mowry, T.C.: Compiler-based prefetching for recursive data structures. In: ASPLOS-VII: Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 222\u2013233. ACM Press, New York, NY, USA (1996)","DOI":"10.1145\/237090.237190"},{"key":"85_CR25","unstructured":"NIST. Matrix Market. http:\/\/math.nist.gov\/MatrixMarket (2007)"},{"issue":"12","key":"85_CR26","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1145\/7902.7904","volume":"29","author":"D.A. Padua","year":"1986","unstructured":"Padua D.A., Wolfe M.J.: Advanced compiler optimizations for supercomputers. Commun. ACM 29(12), 1184\u20131201 (1986)","journal-title":"Commun. ACM"},{"key":"85_CR27","doi-asserted-by":"crossref","unstructured":"Rubin, S., Bernstein, D., Rodeh, M.: Virtual cache line: a new technique to improve cache exploitation for recursive data structures. In: CC \u201999: Proceedings of the 8th International Conference on Compiler Construction, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS\u201999, pp. 259\u2013273. Springer-Verlag, London, UK (1999)","DOI":"10.1007\/978-3-540-49051-7_18"},{"issue":"2","key":"85_CR28","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/1057387.1057388","volume":"27","author":"R. Rugina","year":"2005","unstructured":"Rugina R., Rinard M.C.: Symbolic bounds analysis of pointers, array indices, and accessed memory regions. ACM Trans. Program. Lang. Syst. 27(2), 185\u2013235 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"85_CR29","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1024597010150","volume":"31","author":"R. Silvius","year":"2003","unstructured":"Silvius R., Rauchwerger L., Hoeflinger J.: Hybrid analysis: static & dynamic memory reference analysis. Int. J. Parallel Prog. 31(4), 251\u2013283 (2003)","journal-title":"Int. J. Parallel Prog."},{"issue":"5","key":"85_CR30","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/12.88484","volume":"40","author":"J.H. Saltz","year":"1991","unstructured":"Saltz J.H., Mirchandaney R., Crowley K.: Run-time parallelization and scheduling of loops. IEEE Trans. Comput. 40(5), 603\u2013612 (1991)","journal-title":"IEEE Trans. Comput."},{"key":"85_CR31","doi-asserted-by":"crossref","unstructured":"Weng, L., Agrawal, G., Catalyurek, U., Kurc, T., Narayanan, S., Saltz, J.: An approach for automatic data virtualization. In: HPDC \u201904: Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing (HPDC \u201904) pp. 24\u201333. IEEE Computer Society, Washington, DC, USA (2004)","DOI":"10.1109\/HPDC.2004.1323476"},{"issue":"3","key":"85_CR32","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/99.537097","volume":"3","author":"H.A.G. Wijshoff","year":"1996","unstructured":"Wijshoff, H.A.G.: Programming without bothering about data structures? IEEE Comput. Sci. Eng. IEEE Trans. Comput. (3), 67\u201368 (1996)","journal-title":"IEEE Comput. Sci. Eng"},{"key":"85_CR33","doi-asserted-by":"crossref","unstructured":"Yang, C.-L., Lebeck, A.R.: Push vs. pull: data movement for linked data structures. In: ICS \u201900: Proceedings of the 14th International Conference on Supercomputing, pp. 176\u2013186. ACM Press, New York, NY, USA (2000)","DOI":"10.1145\/335231.335248"},{"key":"85_CR34","unstructured":"Zhao, L., Wijshoff, H.A.G.: A case study in automatic data structure selection for optimizing sparse matrix computations. In: Proceedings of the IEEE International Workshop on Advanced Compiler Technology for High Performance and Embedded Systems (IWACT), July 2001, Bucharest, Romania, pp. 22\u201355. Editura MATRIX ROM (2001)"},{"key":"85_CR35","doi-asserted-by":"crossref","unstructured":"Zhong, Y., Orlovich, M., Shen, X., Ding, C.: Array regrouping and structure splitting using whole-program reference affinity. In: PLDI \u201904: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation, pp. 255\u2013266. ACM Press, New York, NY, USA (2004)","DOI":"10.1145\/996841.996872"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-008-0085-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T01:57:13Z","timestamp":1738375033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-008-0085-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,24]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["85"],"URL":"https:\/\/doi.org\/10.1007\/s10766-008-0085-2","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2008,9,24]]}}}