{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:34:41Z","timestamp":1743132881621,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540211990"},{"type":"electronic","value":"9783540246442"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24644-2_16","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T12:00:18Z","timestamp":1294401618000},"page":"241-257","source":"Crossref","is-referenced-by-count":6,"title":["Improving the Performance of Morton Layout by Array Alignment and Loop Unrolling"],"prefix":"10.1007","author":[{"given":"Jeyarajan","family":"Thiyagalingam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olav","family":"Beckmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul H. J.","family":"Kelly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2\/3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BF01185206","volume":"12","author":"B. Alpern","year":"1994","unstructured":"Alpern, B., Carter, L., Feig, E., Selker, T.: The uniform memory hierarchy model of computation. Algorithmica\u00a012(2\/3), 72\u2013109 (1994)","journal-title":"Algorithmica"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Jain, V.V., Lebeck, A.R., Mundhra, S., Thottethodi, M.: Nonlinear array layouts for hierarchical memory systems. In: ICS 1999: Proceedings of the 1999 International Conference on Supercomputing, June 20\u201325, pp. 444\u2013453 (1999)","DOI":"10.1145\/305138.305231"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Lebeck, A.R., Patnala, P.K., Thottethodi, M.: Recursive array layouts and fast parallel matrix multiplication. In: SPAA 1999: Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, New York, June 1999, pp. 222\u2013231 (1999)","DOI":"10.1145\/305619.305645"},{"key":"16_CR4","volume-title":"Proceedings of the Workshop on Interaction between Compilers and Computer Architectures","author":"P. Drakenberg","year":"2001","unstructured":"Drakenberg, P., Lundevall, F., Lisper, B.: An efficient semihierarchical array layout. In: Proceedings of the Workshop on Interaction between Compilers and Computer Architectures, Monterrey, Mexico, January 2001. Kluwer, Dordrecht (2001), Available via www.mrtc.mdh.se"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BFb0095337","volume-title":"Applied Parallel Computing. Large Scale Scientific and Industrial Problems","author":"F. Gustavson","year":"1998","unstructured":"Gustavson, F., Henriksson, A., Jonsson, I., Kaagstroem, B.: Recursive blocked data formats and BLAS\u2019s for dense linear algebra algorithms. In: K\u00e5gstr\u00f6m, B., Elmroth, E., Wa\u015bniewski, J., Dongarra, J. (eds.) PARA 1998. LNCS, vol.\u00a01541, pp. 195\u2013206. Springer, Heidelberg (1998)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF01199431","volume":"38","author":"D. Hilbert","year":"1891","unstructured":"Hilbert, D.: \u00dcber die stetige Abbildung einer Linie auf ein Fl\u00e4chenst\u00fcck. Math. Ann.\u00a038, 459\u2013460 (1891)","journal-title":"Math. Ann."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Rivera, G., Tseng, C.-W.: Data transformations for eliminating conflict misses. In: PLDI 1998: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, Montreal, Canada, June 17\u201319, pp. 38\u201349 (1998)","DOI":"10.1145\/277652.277661"},{"key":"16_CR8","first-page":"340","volume-title":"Performance Engineering: 19th Annual UK Performance Engineering Workshop","author":"J. Thiyagalingam","year":"2003","unstructured":"Thiyagalingam, J., Beckmann, O., Kelly, P.H.J.: An exhaustive evaluation of row-major, column-major and Morton layouts for large twodimensional arrays. In: Jarvis, S.A. (ed.) Performance Engineering: 19th Annual UK Performance Engineering Workshop, July 2003, pp. 340\u2013351. University of Warwick, UK (2003)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Thiyagalingam, J., Beckmann, O., Kelly, P.H.J.: Improving the performance of basic morton layout by array alignment and loop unrolling \u2014 towards a better compromise storage layout. Technical report, Department of Computing, Imperial College London, Available via (September 2003), http:\/\/www.doc.ic.ac.uk\/~jeyan\/","DOI":"10.1007\/978-3-540-24644-2_16"},{"issue":"10","key":"16_CR10","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1002\/cpe.630","volume":"14","author":"V. Valsalam","year":"2002","unstructured":"Valsalam, V., Skjellum, A.: A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience\u00a014(10), 805\u2013839 (2002)","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"16_CR11","unstructured":"Wise, D.S., Frens, J.D.: Morton-order Matrices Deserve Compilers\u2019 Support. Technical Report, TR533 (November 1999)"},{"issue":"7","key":"16_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/568014.379559","volume":"36","author":"D.S. Wise","year":"2001","unstructured":"Wise, D.S., Frens, J.D., Gu, Y., Alexander, G.A.: Language support for Morton-order matrices. ACM SIGPLAN Notices\u00a036(7), 24\u201333 (2001); Proceedings of PPoPP 2001","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24644-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T19:41:47Z","timestamp":1685907707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24644-2_16"}},"subtitle":["Reducing the Price of Naivety"],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540211990","9783540246442"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24644-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}