{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:47Z","timestamp":1740099647933,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030432287"},{"type":"electronic","value":"9783030432294"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43229-4_14","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"151-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Implementation of Parallel 3-D Real FFT with 2-D Decomposition on Intel Xeon Phi Clusters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1357-5770","authenticated-orcid":false,"given":"Daisuke","family":"Takahashi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"key":"14_CR1","unstructured":"2DECOMP&FFT - Library for 2D Pencil Decomposition and Distributed FFTs. \nhttp:\/\/www.2decomp.org\/"},{"key":"14_CR2","unstructured":"TOP500 Supercomputer Sites. \nhttps:\/\/www.top500.org\/"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.parco.2012.12.002","volume":"39","author":"O Ayala","year":"2013","unstructured":"Ayala, O., Wang, L.P.: Parallel implementation and scalability analysis of 3D Fast Fourier Transform using 2D domain decomposition. Parallel Comput. 39, 58\u201377 (2013)","journal-title":"Parallel Comput."},{"key":"14_CR4","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. 3, 167\u2013184 (1986)","journal-title":"Parallel Comput."},{"key":"14_CR5","volume-title":"The Fast Fourier Transform and Its Applications","author":"EO Brigham","year":"1988","unstructured":"Brigham, E.O.: The Fast Fourier Transform and Its Applications. Prentice-Hall, Upper Saddle River (1988)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"14_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. Proc. IEEE 93, 216\u2013231 (2005)","journal-title":"Proc. IEEE"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s11390-014-1484-z","volume":"29","author":"YQ Liu","year":"2014","unstructured":"Liu, Y.Q., Li, Y., Zhang, Y.Q., Zhang, X.Y.: Memory efficient two-pass 3D FFT algorithm for Intel\u00ae Xeon Phi\u2122 coprocessor. J. Comput. Sci. Technol. 29, 989\u20131002 (2014)","journal-title":"J. Comput. Sci. Technol."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"C192","DOI":"10.1137\/11082748X","volume":"34","author":"D Pekurovsky","year":"2012","unstructured":"Pekurovsky, D.: P3DFFT: a framework for parallel computations of Fourier transforms in three dimensions. SIAM J. Sci. Comput. 34, C192\u2013C209 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"C213","DOI":"10.1137\/120885887","volume":"35","author":"M Pippig","year":"2013","unstructured":"Pippig, M.: PFFT: an extension of FFTW to massively parallel architectures. SIAM J. Sci. Comput. 35, C213\u2013C236 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"14_CR11","series-title":"LNCS","first-page":"606","volume-title":"PPAM 2009, Part I","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., et al. (eds.) PPAM 2009, Part I. LNCS, vol. 6067, pp. 606\u2013614. Springer, Heidelberg (2010)"},{"key":"14_CR12","series-title":"LNCS","first-page":"401","volume-title":"ICCSA 2017, Part I","author":"D Takahashi","year":"2017","unstructured":"Takahashi, D.: An implementation of parallel 1-D real FFT on Intel Xeon Phi processors. In: Gervasi, O., et al. (eds.) ICCSA 2017, Part I. LNCS, vol. 10404, pp. 401\u2013410. Springer, Cham (2017)"}],"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-030-43229-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:08:23Z","timestamp":1584576503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ppam.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}