{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:09:25Z","timestamp":1725466165345},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314636"},{"type":"electronic","value":"9783642314643"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31464-3_17","type":"book-chapter","created":{"date-parts":[[2012,7,2]],"date-time":"2012-07-02T15:20:38Z","timestamp":1341242438000},"page":"163-172","source":"Crossref","is-referenced-by-count":1,"title":["FFTs and Multiple Collective Communication on Multiprocessor-Node Architectures"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Jocksch","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60246-1_109","volume-title":"Mathematical Foundations of Computer Science 1995","author":"M. Adler","year":"1995","unstructured":"Adler, M., Byers, J.W., Karp, R.M.: Scheduling Parallel Communication: The h-Relation Problem. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 1\u201320. Springer, Heidelberg (1995)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0167-8191(86)90033-5","volume":"3","author":"A. Brass","year":"1986","unstructured":"Brass, A., Pawley, G.S.: Two and three dimensional FFTs on highly parallel computers. Parallel Comput.\u00a03, 167\u2013184 (1986)","journal-title":"Parallel Comput."},{"issue":"11","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/71.642949","volume":"8","author":"J. Bruck","year":"1997","unstructured":"Bruck, J., Ho, C.T., Kipnis, S., Upfal, E., Weathersby, D.: Efficient algorithms for all-to-all communications in multiport message-passing systems. IEEE T. Parall. Distr.\u00a08(11), 1143\u20131156 (1997)","journal-title":"IEEE T. Parall. Distr."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-89894-8_32","volume-title":"High Performance Computing - HiPC 2008","author":"A. Chan","year":"2008","unstructured":"Chan, A., Balaji, P., Gropp, W., Thakur, R.: Communication Analysis of Parallel 3D FFT for Flat Cartesian Meshes on Large Blue Gene Systems. In: Sadayappan, P., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2008. LNCS, vol.\u00a05374, pp. 350\u2013364. Springer, Heidelberg (2008)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.cpc.2006.12.006","volume":"176","author":"B. Fang","year":"2007","unstructured":"Fang, B., Deng, Y., Martyna, G.: Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer. Comput. Phys. Commun.\u00a0176, 531\u2013538 (2007)","journal-title":"Comput. Phys. Commun."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Appl. Math.\u00a053, 79\u2013133 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/JPROC.2004.840301","volume":"93","author":"M. Frigo","year":"2005","unstructured":"Frigo, M., Johnson, S.G.: The design and implementation of FFTW3. P IEEE\u00a093(2), 216\u2013231 (2005)","journal-title":"P IEEE"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2005.06.003","volume":"66","author":"A. Goldman","year":"2006","unstructured":"Goldman, A., Peters, J.G., Trystram, D.: Exchanging messages of different size. J. Parallel Distr. Com.\u00a066, 1\u201318 (2006)","journal-title":"J. Parallel Distr. Com."},{"issue":"8","key":"17_CR9","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/71.238626","volume":"4","author":"A. Gupta","year":"1993","unstructured":"Gupta, A., Kumar, V.: The scalability of FFT on parallel computers. IEEE T. Parall. Distr.\u00a04(8), 922\u2013932 (1993)","journal-title":"IEEE T. Parall. Distr."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/237502.237558","volume-title":"SPAA 1996: Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures","author":"D.R. Helman","year":"1996","unstructured":"Helman, D.R., Bader, D.A., J\u00e1J\u00e1, J.: Parallel algorithms for personalized communication and sorting with an experimental study (extended abstract). In: SPAA 1996: Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 211\u2013222. ACM, New York (1996)"},{"issue":"9","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1109\/12.29465","volume":"38","author":"S.L. Johnsson","year":"1989","unstructured":"Johnsson, S.L., Ho, C.T.: Optimum broadcasting and personalized communication in hypercubes. IEEE T. Comput.\u00a038(9), 1249\u20131268 (1989)","journal-title":"IEEE T. Comput."},{"key":"17_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970999","volume-title":"Computational Frameworks for the Fast Fourier Transfrom","author":"C. Loan van","year":"1992","unstructured":"van Loan, C.: Computational Frameworks for the Fast Fourier Transfrom. SIAM, Philadelphia (1992)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jagm.2001.1169","volume":"41","author":"P. Sanders","year":"2001","unstructured":"Sanders, P., Solis-Oba, R.: How helpers hasten h-relations. J. Algorithm.\u00a041, 86\u201398 (2001)","journal-title":"J. Algorithm."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/3-540-45706-2_112","volume-title":"Euro-Par 2002. Parallel Processing","author":"P. Sanders","year":"2002","unstructured":"Sanders, P., Tr\u00e4ff, J.L.: The Hierarchical Factor Algorithm for All-to-All Communication. In: Monien, B., Feldmann, R. (eds.) Euro-Par 2002. LNCS, vol.\u00a02400, pp. 799\u2013803. Springer, Heidelberg (2002)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","volume":"5","author":"P.N. Swarztrauber","year":"1987","unstructured":"Swarztrauber, P.N.: Multiprocessor FFTs. Parallel Comput.\u00a05, 197\u2013210 (1987)","journal-title":"Parallel Comput."},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/978-3-642-14390-8_63","volume-title":"Parallel Processing and Applied Mathematics","author":"D. Takahashi","year":"2010","unstructured":"Takahashi, D.: An Implementation of Parallel 3-D FFT with 2-D Decomposition on a Massively Parallel Cluster of Multi-core Processors. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2009. LNCS, vol.\u00a06067, pp. 606\u2013614. Springer, Heidelberg (2010)"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1177\/1094342005051521","volume":"19","author":"R. Thakur","year":"2005","unstructured":"Thakur, R., Rabenseifner, R., Gropp, W.: Optimization of collective communication operations in MPICH. Int. J. High Perform. C.\u00a019(1), 49\u201366 (2005)","journal-title":"Int. J. High Perform. C."},{"key":"17_CR18","unstructured":"Tipparaju, V., Nieplocha, J., Panda, D.: Fast collective operations using shared and remote memory access protocols on clusters. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France (April 2003)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31464-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:48:20Z","timestamp":1558313300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31464-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314636","9783642314643"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31464-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}