{"id":"https://openalex.org/W2097982649","doi":"https://doi.org/10.1109/hpcc.2012.53","title":"An Implementation of Parallel 1-D FFT on the K Computer","display_name":"An Implementation of Parallel 1-D FFT on the K Computer","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2097982649","doi":"https://doi.org/10.1109/hpcc.2012.53","mag":"2097982649"},"language":"en","primary_location":{"id":"doi:10.1109/hpcc.2012.53","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcc.2012.53","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 14th International Conference on High Performance Computing and Communication &amp; 2012 IEEE 9th International Conference on Embedded Software and Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100710410","display_name":"Daisuke Takahashi","orcid":"https://orcid.org/0000-0003-1357-5770"},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Daisuke Takahashi","raw_affiliation_strings":["Faculty of Engineering, Information and Systems, University of Tsukuba, Tsukuba, Ibaraki, Japan","Fac. of Eng., Inf. & Syst. Univ. of Tsukuba, Tsukuba, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Information and Systems, University of Tsukuba, Tsukuba, Ibaraki, Japan","institution_ids":["https://openalex.org/I146399215"]},{"raw_affiliation_string":"Fac. of Eng., Inf. & Syst. Univ. of Tsukuba, Tsukuba, Japan","institution_ids":["https://openalex.org/I146399215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079932269","display_name":"Atsuya Uno","orcid":"https://orcid.org/0009-0002-8449-5196"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Atsuya Uno","raw_affiliation_strings":["Rikagaku Kenkyujo Yokohama Campus, Yokohama, Kanagawa, JP","Next-Generation Supercomput. R&D Center, RIKEN, Kobe, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rikagaku Kenkyujo Yokohama Campus, Yokohama, Kanagawa, JP","institution_ids":[]},{"raw_affiliation_string":"Next-Generation Supercomput. R&D Center, RIKEN, Kobe, Japan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064617213","display_name":"Mitsuo Yokokawa","orcid":"https://orcid.org/0000-0003-3790-1243"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mitsuo Yokokawa","raw_affiliation_strings":["Rikagaku Kenkyujo Yokohama Campus, Yokohama, Kanagawa, JP","Next-Generation Supercomput. R&D Center, RIKEN, Kobe, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rikagaku Kenkyujo Yokohama Campus, Yokohama, Kanagawa, JP","institution_ids":[]},{"raw_affiliation_string":"Next-Generation Supercomput. R&D Center, RIKEN, Kobe, Japan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"56","issue":null,"first_page":"344","last_page":"350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.9500292539596558},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.8013187646865845},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.7731907367706299},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7552299499511719},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.733656108379364},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.7117769122123718},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.5552920699119568},{"id":"https://openalex.org/keywords/flops","display_name":"FLOPS","score":0.5348870158195496},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5243109464645386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.458060085773468},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.2066606879234314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18076160550117493},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.09733313322067261}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.9500292539596558},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.8013187646865845},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.7731907367706299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7552299499511719},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.733656108379364},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.7117769122123718},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.5552920699119568},{"id":"https://openalex.org/C3826847","wikidata":"https://www.wikidata.org/wiki/Q188768","display_name":"FLOPS","level":2,"score":0.5348870158195496},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5243109464645386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.458060085773468},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.2066606879234314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18076160550117493},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.09733313322067261},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcc.2012.53","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcc.2012.53","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 14th International Conference on High Performance Computing and Communication &amp; 2012 IEEE 9th International Conference on Embedded Software and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320330412","display_name":"Scheme for Promotion of Academic and Research Collaboration","ror":null},{"id":"https://openalex.org/F4320335125","display_name":"RIKEN","ror":"https://ror.org/01sjwvz98"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W309890564","https://openalex.org/W1489894178","https://openalex.org/W1579661906","https://openalex.org/W1866830630","https://openalex.org/W1966904279","https://openalex.org/W1999472284","https://openalex.org/W2032484463","https://openalex.org/W2037026538","https://openalex.org/W2045836768","https://openalex.org/W2049644498","https://openalex.org/W2060469182","https://openalex.org/W2061171222","https://openalex.org/W2062826522","https://openalex.org/W2102182691","https://openalex.org/W2127391977","https://openalex.org/W2129889687","https://openalex.org/W2134572726","https://openalex.org/W2136952590","https://openalex.org/W2166395705","https://openalex.org/W4254979840"],"related_works":["https://openalex.org/W1984254719","https://openalex.org/W2031343199","https://openalex.org/W2149121524","https://openalex.org/W2151986570","https://openalex.org/W2547585993","https://openalex.org/W2061302196","https://openalex.org/W2977460836","https://openalex.org/W2144412928","https://openalex.org/W2131706490","https://openalex.org/W2113951268"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"an":[5],"implementation":[6],"of":[7,43,76,90,97],"a":[8,88,110],"parallel":[9,69],"one-dimensional":[10,70,77],"fast":[11],"Fourier":[12],"transform":[13],"(FFT)":[14],"on":[15,24,79,94],"the":[16,25,34,41,55,61,68,80,98],"K":[17,81,99],"computer.":[18],"The":[19,46,73],"proposed":[20],"algorithm":[21,38,50,65],"is":[22],"based":[23],"six-step":[26,36,48,63],"FFT":[27,37,49,64,71],"algorithm,":[28],"which":[29],"can":[30],"be":[31],"altered":[32],"into":[33],"recursive":[35,47,62],"to":[39,66],"reduce":[40],"number":[42],"cache":[44,56],"misses.":[45],"improves":[51],"performance":[52,74,89],"by":[53],"utilizing":[54],"memory":[57],"effectively.":[58],"We":[59,85],"use":[60],"implement":[67],"algorithm.":[72],"results":[75],"FFTs":[78],"computer":[82,100],"are":[83],"reported.":[84],"successfully":[86],"achieved":[87],"over":[91],"18":[92],"TFlops":[93],"8192":[95],"nodes":[96],"(82944":[101],"nodes,":[102],"128":[103],"GFlops/node,":[104],"10.6":[105],"PFlops":[106],"peak":[107],"performance)":[108],"for":[109],"2":[111],"<sup":[112],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[113],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">41</sup>":[114],"-point":[115],"FFT.":[116]},"counts_by_year":[{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}