{"id":"https://openalex.org/W2017829605","doi":"https://doi.org/10.1145/1542275.1542353","title":"Performance modeling for DFT algorithms in FFTW","display_name":"Performance modeling for DFT algorithms in FFTW","publication_year":2009,"publication_date":"2009-06-08","ids":{"openalex":"https://openalex.org/W2017829605","doi":"https://doi.org/10.1145/1542275.1542353","mag":"2017829605"},"language":"en","primary_location":{"id":"doi:10.1145/1542275.1542353","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1542275.1542353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd international conference on Supercomputing","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/A5064828315","display_name":"Liang Gu","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liang Gu","raw_affiliation_strings":["University of Delaware, Newark, DE, USA","University of Delaware, Newark, DE. USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]},{"raw_affiliation_string":"University of Delaware, Newark, DE. USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100452133","display_name":"Xiaoming Li","orcid":"https://orcid.org/0000-0002-7397-723X"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaoming Li","raw_affiliation_strings":["University of Delaware, Newark, DE, USA","University of Delaware, Newark, DE. USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]},{"raw_affiliation_string":"University of Delaware, Newark, DE. USA","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.05538099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"507","last_page":"508"},"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.9782000184059143,"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.9782000184059143,"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/T11439","display_name":"Video Analysis and Summarization","score":0.968999981880188,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9599999785423279,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.6309400796890259},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.5748180747032166},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.5744234323501587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4910416603088379},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.16880545020103455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11237075924873352},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.10925683379173279},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.054350346326828}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6309400796890259},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.5748180747032166},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.5744234323501587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4910416603088379},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.16880545020103455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11237075924873352},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.10925683379173279},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.054350346326828}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1542275.1542353","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1542275.1542353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd international conference on Supercomputing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2019436626","https://openalex.org/W2102182691","https://openalex.org/W2136952590"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2516295475","https://openalex.org/W2766639751","https://openalex.org/W2390401148"],"abstract_inverted_index":{"Fast":[0],"Fourier":[1,14],"Transform":[2],"in":[3,49],"the":[4,9,45,57,66],"West(FFTW)":[5],"is":[6],"one":[7],"of":[8,19,56,65],"most":[10],"successful":[11],"adaptive":[12,37],"Discrete":[13],"Transform(DFT)":[15],"libraries.":[16],"The":[17],"high-performance":[18],"FFTW":[20,71],"mostly":[21],"derives":[22],"from":[23],"its":[24],"empirical":[25,46],"search":[26,47,67,73],"engine":[27,48],"that":[28],"includes":[29],"all":[30],"major":[31],"DFT":[32,58],"algorithms.":[33],"We":[34],"propose":[35],"an":[36],"model-driven":[38],"FT":[39],"performance":[40,59],"prediction":[41],"technique":[42],"to":[43],"replace":[44],"FFTW.":[50],"Our":[51],"model":[52],"achieves":[53],"over":[54],"94%":[55],"and":[60],"uses":[61],"less":[62],"than":[63],"5%":[64],"time":[68],"compared":[69],"with":[70],"Exhaustive":[72],"on":[74],"four":[75],"test":[76],"platforms.":[77]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
