{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:11:12Z","timestamp":1780344672161,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,5,11]],"date-time":"2014-05-11T00:00:00Z","timestamp":1399766400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Engineering with Computers"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s00366-014-0363-0","type":"journal-article","created":{"date-parts":[[2014,5,10]],"date-time":"2014-05-10T01:49:44Z","timestamp":1399686584000},"page":"535-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Improved cache utilization and preconditioner efficiency through use of a space-filling curve mesh element- and vertex-reordering technique"],"prefix":"10.1007","volume":"30","author":[{"given":"Shankar P.","family":"Sastry","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emre","family":"Kultursay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suzanne M.","family":"Shontz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahmut T.","family":"Kandemir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,5,11]]},"reference":[{"key":"363_CR1","unstructured":"Shewchuk J (2002) What is a good linear element? Interpolation, conditioning, and quality measures. In: Proceedings of the 11th international meshing roundtable, pp 115\u2013126"},{"key":"363_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0871-6","volume-title":"Space-filling curves","author":"H Sagan","year":"1994","unstructured":"Sagan H (1994) Space-filling curves. Springer, New York"},{"key":"363_CR3","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1007\/s10543-010-0283-3","volume":"50","author":"S Shontz","year":"2010","unstructured":"Shontz S, Vavasis S (2010) Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes. BIT Numer Math 50:863\u2013884","journal-title":"BIT Numer Math"},{"key":"363_CR4","doi-asserted-by":"crossref","unstructured":"Park J, Shontz S, Drapaca C (2012) A combined level set\/mesh warping algorithm for tracking brain and cerebrospinal fluid evolution in hydrocephalic patients. In: Zhang Y (ed) Image-based modeling and mesh generation. Lecture notes in computational vision and biomechanics, vol 3. Springer, London, pp 107\u2013141","DOI":"10.1007\/978-94-007-4255-0_7"},{"key":"363_CR5","doi-asserted-by":"crossref","unstructured":"Park J, Shontz SM, Drapaca CS (2012) Automatic boundary evolution tracking via a combined level set method and mesh warping technique: Application to hydrocephalus. In: Proceedings of the mesh processing in medical image analysis 2012\u2014MICCAI 2012 international workshop, MeshMed 2012, pp 122\u2013133","DOI":"10.1007\/978-3-642-33463-4_13"},{"key":"363_CR6","doi-asserted-by":"crossref","unstructured":"Antaki J, Blelloch G, Ghattas O, Malcevic I, Miller G, Walkington N (2000) A parallel dynamic-mesh Lagrangian method for simulation of flows with dynamic interfaces. In: Proceedings of the 2000 supercomputing conference","DOI":"10.1109\/SC.2000.10045"},{"key":"363_CR7","doi-asserted-by":"crossref","unstructured":"Adams M, Demmel JW (2000) Parallel multigrid solvers for 3D unstructured element problems in large deformation elasticity and plasticity. Int J Numer Methods Eng 48(8):1241\u20131262","DOI":"10.1002\/(SICI)1097-0207(20000720)48:8<1241::AID-NME946>3.0.CO;2-R"},{"issue":"3","key":"363_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0045-7949(92)90037-Z","volume":"42","author":"H Adeli","year":"1992","unstructured":"Adeli H, Kamal O (1992) Concurrent analysis of large structures-I: algorithms. Comput Struct 42(3):413\u2013424","journal-title":"Comput Struct"},{"issue":"3","key":"363_CR9","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0045-7949(92)90038-2","volume":"42","author":"H Adeli","year":"1992","unstructured":"Adeli H, Kamal O (1992) Concurrent analysis of large structures-II: applications. Comput Struct 42(3):425\u2013432","journal-title":"Comput Struct"},{"issue":"5","key":"363_CR10","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0045-7949(99)00181-9","volume":"76","author":"M Rezende","year":"2000","unstructured":"Rezende M, Paiva J (2000) A parallel algorithm for stiffness matrix assembling in a shared memory environment. Comput Struct 76(5):593\u2013602","journal-title":"Comput. Struct."},{"issue":"6","key":"363_CR11","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1016\/0045-7949(89)90287-3","volume":"31","author":"L Chien","year":"1989","unstructured":"Chien L, Sun C (1989) Parallel processing techniques for finite element analysis of nonlinear large truss structures. Comput Struct 31(6):1023\u20131029","journal-title":"Comput Struct"},{"key":"363_CR12","doi-asserted-by":"crossref","unstructured":"Cuthill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of 24th national conference, ACM Press, pp 157\u2013172","DOI":"10.1145\/800195.805928"},{"key":"363_CR13","doi-asserted-by":"crossref","unstructured":"Heber G, Biswas R, Gao G, Guang, Gao R (2000) Self-avoiding walks over adaptive unstructured grids. Concurrency: Pract Exp 12:85\u2013109","DOI":"10.1002\/(SICI)1096-9128(200002\/03)12:2\/3<85::AID-CPE471>3.0.CO;2-8"},{"key":"363_CR14","first-page":"107","volume":"18","author":"M Zhou","year":"2010","unstructured":"Zhou M, Sahni O, Shephard M, Carothers C, Jansen K (2010) Adjacency-based data reordering algorithm for acceleration of finite element computations. Sci Prog 18:107\u2013123","journal-title":"Sci Prog"},{"issue":"7","key":"363_CR15","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/TPDS.2006.88","volume":"17","author":"H Han","year":"2006","unstructured":"Han H, Tseng C (2006) Exploiting locality for irregular scientific codes. IEEE Trans Parallel Distrib Syst 17(7):606\u2013618","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"363_CR16","doi-asserted-by":"crossref","unstructured":"Strout M, Hovland P (2004) Metrics and models for reordering transformations. In: Proceedings of the second ACM SIGPLAN workshop on memory system performance (MSP), pp 23\u201334","DOI":"10.1145\/1065895.1065899"},{"issue":"3","key":"363_CR17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/S00361445003820","volume":"44","author":"L Oliker","year":"2002","unstructured":"Oliker L, Li X, Husbands P, Biswas R (2002) Effects of ordering strategies and programming paradigms on sparse matrix computations. SIAM Rev 44(3):373\u2013393","journal-title":"SIAM Rev"},{"key":"363_CR18","unstructured":"Oliker L, Li X, Heber G, Biswas R (2000) Parallel conjugate gradient: effects of ordering strategies, programming paradigms, and architectural platforms. \u00a0IEEE Trans Parallel Distrib Syst"},{"key":"363_CR19","doi-asserted-by":"crossref","unstructured":"Shontz S, Knupp P (2008) The effect of vertex reordering on 2D local mesh optimization efficiency. In: Proceedings of the 17th international meshing roundtable, pp 107\u2013124","DOI":"10.1007\/978-3-540-87921-3_7"},{"key":"363_CR20","unstructured":"Park J, Knupp P, Shontz S (2010) Static vertex reordering schemes for local mesh quality improvement. Technical report, Sandia National Laboratories"},{"key":"363_CR21","doi-asserted-by":"crossref","unstructured":"Chatterjee S, Jain V, Lebeck A, Mundhra S, Thottethodi M (1999) Nonlinear array layouts for hierarchical memory systems. In: Proceedings of the 1999 ACM international conference on supercomputing, pp 444\u2013453","DOI":"10.1145\/305138.305231"},{"issue":"1","key":"363_CR22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/2151237X.2012.641828","volume":"16","author":"T Vo","year":"2012","unstructured":"Vo T, Silva T, Scheidegger F, Pascucci V (2012) Simple and efficient mesh layout with space-filling curves. J Graph Tools 16(1):25\u201339","journal-title":"J Graph Tools"},{"key":"363_CR23","doi-asserted-by":"crossref","unstructured":"Behrens J, Zimmermann J (2000) Parallelizing an unstructured grid generator with a space-filling curve approach. In: EURO-PAR 2000. Springer, London, pp 815\u2013823","DOI":"10.1007\/3-540-44520-X_112"},{"key":"363_CR24","doi-asserted-by":"crossref","unstructured":"Alauzet F, Loseille A (2009) On the use of space filling curves for parallel anisotropic mesh adaptation. In: Proceedings of the 18th international meshing roundtable, pp 337\u2013357","DOI":"10.1007\/978-3-642-04319-2_20"},{"key":"363_CR25","unstructured":"Yzelman A, Bisseling R (2012) A cache-oblivious sparse matrixvector multiplication scheme based on the hilbert curve. In: Progress in industrial mathematics at ECMI 2010, vol 17 of mathematics in industry. Springer, Berlin, Heidelberg, pp 627\u2013633"},{"issue":"3","key":"363_CR26","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1011119519789","volume":"29","author":"J Mellor-Crummey","year":"2001","unstructured":"Mellor-Crummey J, Whalley D, Kennedy K (2001) Improving memory hierarchy performance for irregular applications using data and computation reorderings. Int J Parallel Prog 29(3):217\u2013247","journal-title":"Int J Parallel Prog"},{"key":"363_CR27","doi-asserted-by":"crossref","unstructured":"Gerhold T, Neumann J (2008) The parallel mesh deformation of the DLR TAU-code. In: New results in numerical and experimental fluid mechanics VI, vol 96 of notes on numerical fluid mechanics and multidisciplinary design. Springer, Berlin, Heidelberg, pp 162\u2013169","DOI":"10.1007\/978-3-540-74460-3_20"},{"key":"363_CR28","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.2514\/2.1442","volume":"39","author":"HM Tsai","year":"2001","unstructured":"Tsai HM, Wong ASF, Cai J, Zhu Y, Liu F (2001) Unsteady flow calculations with a parallel multiblock moving mesh algorithm. AIAA J 39:1021\u20131029","journal-title":"AIAA J"},{"key":"363_CR29","volume-title":"Computer solution of large sparse positive definite systems","author":"J George","year":"1981","unstructured":"George J, Liu J (1981) Computer solution of large sparse positive definite systems. Prentice-Hall, London"},{"key":"363_CR30","volume-title":"A first course in the finite element method","author":"D Logan","year":"2000","unstructured":"Logan D (2000) A first course in the finite element method, 2nd edn. Brooks\/Cole Publishing Co., Pacific Grove","edition":"2"},{"key":"363_CR31","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative methods for sparse linear systems","author":"Y Saad","year":"2003","unstructured":"Saad Y (2003) Iterative methods for sparse linear systems, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia","edition":"2"},{"key":"363_CR32","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1055\/s-2006-948760","volume":"23","author":"TB Kinney","year":"2006","unstructured":"Kinney TB (2006) Inferior vena cava filters. Semin Intervent Radiol 23:230\u2013239","journal-title":"Semin Intervent Radiol"},{"key":"363_CR33","unstructured":"Si H (2013) TetGen: a quality tetrahedral mesh generator and three-dimensional Delaunay triangulator. http:\/\/tetgen.berlios.de\/"},{"issue":"2","key":"363_CR34","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/2.982916","volume":"35","author":"S Magnusson","year":"2002","unstructured":"Magnusson S, Christensson M, Eskilson J, Forsgren D, H\u00e5llbergv G, H\u00f6gberg J, Larsson F, Moestedt A, Werner B (2002) Simics: a full system simulation platform. Computer 35(2):50\u201358","journal-title":"Computer"},{"key":"363_CR35","unstructured":"Nishtala R, Vuduc R, Demmel J, Yelick K (2004) Performance modeling and analysis of cache blocking in sparse matrix vector multiply. Technical report, University of California, Berkeley"},{"key":"363_CR36","doi-asserted-by":"crossref","unstructured":"Gupta A, Kumar V, Sameh A (1995) Performance and scalability of preconditioned conjugate gradient methods on parallel computers. Technical report, Department of Computer Science, University of Minnesota","DOI":"10.1109\/71.382315"}],"container-title":["Engineering with Computers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-014-0363-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00366-014-0363-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-014-0363-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T10:27:01Z","timestamp":1565432821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00366-014-0363-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,11]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["363"],"URL":"https:\/\/doi.org\/10.1007\/s00366-014-0363-0","relation":{},"ISSN":["0177-0667","1435-5663"],"issn-type":[{"value":"0177-0667","type":"print"},{"value":"1435-5663","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,11]]}}}