{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:35Z","timestamp":1725664235713},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540576594"},{"type":"electronic","value":"9783540483083"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57659-2_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:14:39Z","timestamp":1330262079000},"page":"358-373","source":"Crossref","is-referenced-by-count":1,"title":["A methodology for generating efficient disk-based algorithms from tensor product formulas"],"prefix":"10.1007","author":[{"given":"S. D.","family":"Kaushik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. -H.","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. W.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"10","key":"21_CR1","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/T-C.1975.224124","volume":"C-24","author":"W. O. Alltop","year":"1975","unstructured":"W. O. Alltop. A computer algorithm for transposing nonsquare matrices. IEEE Transactions on Computers, C-24(10):1038\u20131040, 1975.","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"R. Alverson, D. Callahan, D. Cummings, B.Koblenz, A. Porterfield, and B. Smith. The Tera computer system. In 1990 International Conference on Supercomputing, pages 1\u20136, 1990.","DOI":"10.1145\/77726.255132"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1109\/TASSP.1980.1163404","volume":"ASSP-28","author":"G. L. Anderson","year":"1980","unstructured":"G. L. Anderson. A stepwise approach to computing the multidimensional fast Fourier transform of large arrays. IEEE Transactions on Acoustics and Speech Signal Processing, ASSP-28(3):280\u2013284, 1980.","journal-title":"IEEE Transactions on Acoustics and Speech Signal Processing"},{"issue":"1","key":"21_CR4","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/TC.1979.1675228","volume":"C-27","author":"M. B. Ari","year":"1979","unstructured":"M. B. Ari. On transposing large 2n \u00d7 2n matrices. IEEE Transactions on Computers, C-27(1):72\u201375, 1979.","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00162341","volume":"4","author":"D. H. Bailey","year":"1990","unstructured":"D. H. Bailey. FFTs in external or hierarchical memory. Journal of Supercomputing, 4:23\u201335, 1990.","journal-title":"Journal of Supercomputing"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"P. M. Chen and D. A. Patterson. Maximizing performance in a striped disk array. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 322\u2013331, 1990.","DOI":"10.1145\/325164.325158"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/jpdc.1993.1004","volume":"17","author":"T. H. Cormen","year":"1993","unstructured":"T. H. Cormen. Fast permuting on disk arrays. Journal of Parallel and Distributed Computing, 17:41\u201357, Jan.\u2013Feb. 1993.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"9","key":"21_CR8","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/T-C.1974.224062","volume":"C-23","author":"L. G. Delcaro","year":"1974","unstructured":"L. G. Delcaro and G. L. Sicuranza. A method on transposing externally stored matrices. IEEE Transactions on Computers, C-23(9):801\u2013803, 1974.","journal-title":"IEEE Transactions on Computers"},{"issue":"7","key":"21_CR9","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/T-C.1972.223584","volume":"20","author":"J. O. Eklundh","year":"1972","unstructured":"J. O. Eklundh. A fast computer method for matrix transposing. IEEE Transactions on Computers, 20(7):801\u2013803, 1972.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"21_CR10","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1145\/321941.321949","volume":"23","author":"D. Fraser","year":"1976","unstructured":"D. Fraser. Array permutation by index-digit permutation. Journal of ACM, 23(2):298\u2013309, 1976.","journal-title":"Journal of ACM"},{"issue":"2","key":"21_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TSE.1981.234523","volume":"SE-7","author":"G. C. Goldbogen","year":"1981","unstructured":"G. C. Goldbogen. Prim: A fast matrix transpose method. IEEE Transactions on Software Engineering, SE-7(2):255\u2013257, 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"21_CR12","unstructured":"A. Graham. Kronecker Products and Matrix Calculus: With Applications. Ellis Horwood Limited, 1981."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"S. K. S. Gupta, S. D. Kaushik, C.-H. Huang, J. R. Johnson, R. W. Johnson, and P. Sadayappan. A methodology for the generation of data distributions to optimize communication. In Fourth IEEE Symposium on Parallel and Distributed Processing, pages 436\u2013441, 1992.","DOI":"10.1109\/SPDP.1992.242712"},{"key":"21_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"R. A. Horn","year":"1991","unstructured":"R. A. Horn and C. R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991."},{"key":"21_CR15","unstructured":"C.-H. Huang, J. R. Johnson, and R. W. Johnson. Generating parallel programs from tensor product formulas: A case study of Strassen's matrix multiplication algorithm. In Proc. International Conference on Parallel Processing 1992, pages 104\u2013108, 1992."},{"key":"21_CR16","unstructured":"Paragon XP\/S product overview. Intel Corporation, 1991."},{"issue":"4","key":"21_CR17","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01189337","volume":"9","author":"J. R. Johnson","year":"1990","unstructured":"J. R. Johnson, R. W. Johnson, D. Rodriguez, and R. Tolimieri. A methodology for designing, modifying and implementing fourier transform algorithms on various architectures. Circuits Systems Signal Process, 9(4):449\u2013500, 1990.","journal-title":"Circuits Systems Signal Process"},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00127843","volume":"5","author":"R. W. Johnson","year":"1991","unstructured":"R. W. Johnson, C.-H. Huang, and J. R. Johnson. Multilinear algebra and parallel programming. Journal of Supercomputing, 5:189\u2013218, 1991.","journal-title":"Journal of Supercomputing"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"S. D. Kaushik, C.-H. Huang, J. R. Johnson, R. W. Johnson, and P. Sadayappan. Efficient transposition algorithms for large matrices. In Supercomputing '93, 1993. To appear.","DOI":"10.1145\/169627.169814"},{"key":"21_CR20","unstructured":"S. D. Kaushik, S. Sharma, and C.-H. Huang. An algebraic theory for modeling multistage interconnection networks. Journal of Information Science and Engineering. To appear."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"S. D. Kaushik, S. Sharma, C.-H. Huang, J. R. Johnson, R. W. Johnson, and P. Sadayappan. An algebraic theory for modeling direct interconnection networks. In Supercomputing '92, pages 488\u2013497, 1992.","DOI":"10.1109\/SUPERC.1992.236655"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"D. A. Patterson, G. Gibson, and R. H. Katz. A case for redundant arrays of inexpensive disks. In Proceedings of the ACM International Conference on Management of Data (SIGMOD), pages 109\u2013116, June 1988.","DOI":"10.1145\/50202.50214"},{"issue":"12","key":"21_CR23","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1109\/T-C.1975.224167","volume":"C-24","author":"H. K. Ramapriyan","year":"1975","unstructured":"H. K. Ramapriyan. A generalization of Eklundhs's algorithm for transposing large matrices. IEEE Transactions on Computers, C-24(12):1221\u20131226, 1975.","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR24","doi-asserted-by":"crossref","first-page":"1680","DOI":"10.1109\/12.40846","volume":"38","author":"A. Reddy","year":"1989","unstructured":"A. Reddy and P. Banerjee. Evaluation of multiple-disk I\/O systems. IEEE Tramactions on Computers, 38:1680\u20131690, December 1989.","journal-title":"IEEE Tramactions on Computers"},{"issue":"5","key":"21_CR25","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1109\/T-C.1973.223760","volume":"C-22","author":"U. Schumann","year":"1973","unstructured":"U. Schumann. Comment on \u2018a fast computer method for matrix transposing'. IEEE Transactions on Computers, C-22(5):542\u2013543, 1973.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"21_CR26","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TAU.1967.1161906","volume":"AU-15","author":"R. C. Singleton","year":"1967","unstructured":"R. C. Singleton. A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage. IEEE Transactions on Audio and Electroacoustics, AU-15(2):91\u201398, 1967.","journal-title":"IEEE Transactions on Audio and Electroacoustics"},{"issue":"12","key":"21_CR27","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1109\/TC.1976.1674721","volume":"C-25","author":"R. E. Twogood","year":"1976","unstructured":"R. E. Twogood and M. P. Ekstrom. An extension of Eklundh's matrix transposition algorithm and its application to digital signal processing. IEEE Transactions on Computers, C-25(12):950\u2013952, 1976.","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"C. Van Loan. Computational framework for the Fast Fourier Transform. SIAM, 1992.","DOI":"10.1137\/1.9781611970999"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"J. S. Vitter and M. Shriver. Optimal disk I\/O with parallel block transfer. In Twenty Second Annual ACM Symposium on Theory of Computing, pages 159\u2013169, May 1990.","DOI":"10.1145\/100216.100234"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57659-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:35Z","timestamp":1605647615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57659-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540576594","9783540483083"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-57659-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}