A. Chatterjee, R. Samtaney, B. Hadri, R. Khurram, S. Aseeri, David Keys, Abhishek Kumar, D. Takahashi
{"title":"HiPC 2018 WORKSHOP 1:并行快速傅里叶变换(PFFT)","authors":"A. Chatterjee, R. Samtaney, B. Hadri, R. Khurram, S. Aseeri, David Keys, Abhishek Kumar, D. Takahashi","doi":"10.1109/hipcw.2018.8634287","DOIUrl":null,"url":null,"abstract":"The goal of this workshop is to encourage discussions about FFTs and to discover a benchmark suite that is widely accepted for computer co-design. This workshop is part of an initiative project that plans a series of meetings at different international venues with the aim of forming a community in order to collect the viewpoints of users, developers and vendors. FFT is an accurate lowcost algorithm which is extensively used in many parallel applications such as signal processing, astronomy and fluid dynamics. However, it might not run well on a full parallel computer due to its Alltoall communication limitations. Consequently, it is of interest to the High Performance Computing community to address related challenges and seek solutions.","PeriodicalId":401060,"journal":{"name":"2018 IEEE 25th International Conference on High Performance Computing Workshops (HiPCW)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"HiPC 2018 WORKSHOP 1: Parallel Fast Fourier Transforms (PFFT)\",\"authors\":\"A. Chatterjee, R. Samtaney, B. Hadri, R. Khurram, S. Aseeri, David Keys, Abhishek Kumar, D. Takahashi\",\"doi\":\"10.1109/hipcw.2018.8634287\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The goal of this workshop is to encourage discussions about FFTs and to discover a benchmark suite that is widely accepted for computer co-design. This workshop is part of an initiative project that plans a series of meetings at different international venues with the aim of forming a community in order to collect the viewpoints of users, developers and vendors. FFT is an accurate lowcost algorithm which is extensively used in many parallel applications such as signal processing, astronomy and fluid dynamics. However, it might not run well on a full parallel computer due to its Alltoall communication limitations. Consequently, it is of interest to the High Performance Computing community to address related challenges and seek solutions.\",\"PeriodicalId\":401060,\"journal\":{\"name\":\"2018 IEEE 25th International Conference on High Performance Computing Workshops (HiPCW)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 25th International Conference on High Performance Computing Workshops (HiPCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/hipcw.2018.8634287\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 25th International Conference on High Performance Computing Workshops (HiPCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/hipcw.2018.8634287","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
HiPC 2018 WORKSHOP 1: Parallel Fast Fourier Transforms (PFFT)
The goal of this workshop is to encourage discussions about FFTs and to discover a benchmark suite that is widely accepted for computer co-design. This workshop is part of an initiative project that plans a series of meetings at different international venues with the aim of forming a community in order to collect the viewpoints of users, developers and vendors. FFT is an accurate lowcost algorithm which is extensively used in many parallel applications such as signal processing, astronomy and fluid dynamics. However, it might not run well on a full parallel computer due to its Alltoall communication limitations. Consequently, it is of interest to the High Performance Computing community to address related challenges and seek solutions.