{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:51Z","timestamp":1725544791581},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341413"},{"type":"electronic","value":"9783540341420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11752578_131","type":"book-chapter","created":{"date-parts":[[2006,6,9]],"date-time":"2006-06-09T03:44:36Z","timestamp":1149824676000},"page":"1082-1088","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing Associativity Conflicts in Morton Layout"],"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":[{"key":"131_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-24644-2_16","volume-title":"Languages and Compilers for Parallel Computing","author":"J. Thiyagalingam","year":"2004","unstructured":"Thiyagalingam, J., Beckmann, O., Kelly, P.H.J.: Improving the performance of Morton layout by array alignment and loop unrolling reducing the price of naivety. In: Rauchwerger, L. (ed.) LCPC 2003. LNCS, vol.\u00a02958, pp. 241\u2013257. Springer, Heidelberg (2004)"},{"key":"131_CR2","doi-asserted-by":"crossref","unstructured":"Wise, D.S., Frens, J.D., Gu, Y., Alexander, G.A.: Language support for morton-order matrices. In: PPoPP 2001: Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, pp. 24\u201333 (2001)","DOI":"10.1145\/379539.379559"},{"key":"131_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, pp. 222\u2013231 (1999)","DOI":"10.1145\/305619.305645"},{"key":"131_CR4","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 13th International Conference on Supercomputing, pp. 444\u2013453 (1999)","DOI":"10.1145\/305138.305231"},{"key":"131_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-48086-2_47","volume-title":"Parallel Processing and Applied Mathematics","author":"F.G. Gustavson","year":"2002","unstructured":"Gustavson, F.G.: New generalized data structures for matrices lead to a variety of high performance algorithms. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Wa\u015bniewski, J. (eds.) PPAM 2001. LNCS, vol.\u00a02328, pp. 418\u2013436. Springer, Heidelberg (2002)"},{"key":"131_CR6","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 semi-hierarchical array layout. In: Proceedings of the Workshop on Interaction between Compilers and Computer Architectures, Kluwer, Dordrecht (2001), Available via: \n                    \n                      www.mrtc.mdh.se"},{"key":"131_CR7","unstructured":"Thiyagalingam, J.: Alternative Array Storage Layouts for Regular Scientific Programs. PhD thesis, Department of Computing, Imperial College, London, U.K. (2005)"},{"key":"131_CR8","unstructured":"SPEC 2000 CPU Benchmarks (2000), \n                    \n                      http:\/\/www.specbench.org\/"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11752578_131.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:31Z","timestamp":1619506951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11752578_131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341413","9783540341420"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11752578_131","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}