guest ::
| Home > Institute Collections > JSC > Transpose algorithm for FFT on APE/Quadrics > print |
| 001 | 860344 | ||
| 005 | 20200914095805.0 | ||
| 020 | _ | _ | |a 978-3-540-64443-9 (print) |
| 020 | _ | _ | |a 978-3-540-69783-1 (electronic) |
| 024 | 7 | _ | |a 10.1007/BFb0037171 |2 doi |
| 024 | 7 | _ | |a 0302-9743 |2 ISSN |
| 024 | 7 | _ | |a 1611-3349 |2 ISSN |
| 037 | _ | _ | |a FZJ-2019-01119 |
| 100 | 1 | _ | |a Lippert, Th. |0 P:(DE-Juel1)132179 |b 0 |u fzj |
| 111 | 2 | _ | |a International Conference on High-Performance Computing and Networking |c Amsterdam |d 1998-04-21 - 1998-04-23 |w The Netherlands |
| 245 | _ | _ | |a Transpose algorithm for FFT on APE/Quadrics |
| 260 | _ | _ | |a Berlin, Heidelberg |c 1998 |b Springer Berlin Heidelberg |
| 295 | 1 | 0 | |a High-Performance Computing and Networking / Sloot, Peter (Editor) ; Berlin, Heidelberg : Springer Berlin Heidelberg, 1998, Chapter 46 ; ISSN: 0302-9743=1611-3349 ; ISBN: 978-3-540-64443-9=978-3-540-69783-1 ; doi:10.1007/BFb0037125 |
| 300 | _ | _ | |a 439 - 448 |
| 336 | 7 | _ | |a CONFERENCE_PAPER |2 ORCID |
| 336 | 7 | _ | |a Conference Paper |0 33 |2 EndNote |
| 336 | 7 | _ | |a INPROCEEDINGS |2 BibTeX |
| 336 | 7 | _ | |a conferenceObject |2 DRIVER |
| 336 | 7 | _ | |a Output Types/Conference Paper |2 DataCite |
| 336 | 7 | _ | |a Contribution to a conference proceedings |b contrib |m contrib |0 PUB:(DE-HGF)8 |s 1600070267_27411 |2 PUB:(DE-HGF) |
| 336 | 7 | _ | |a Contribution to a book |0 PUB:(DE-HGF)7 |2 PUB:(DE-HGF) |m contb |
| 490 | 0 | _ | |a Lecture Notes in Computer Science |v 1401 |
| 520 | _ | _ | |a We describe a novel practical parallel FFT scheme designed for SIMD systems and/or data parallel programming. A bit-exchange of elements between the processors is avoided by means of the ‘Transpose Algorithm’. Our transposition is based on the assignment of the data field onto a 1-dimensional ring of systolic cells which subsequently is mapped onto a ring of processors, realized as a subset of the system's connectivity. We have implemented and benchmarked a 2-dimensional parallel FFT code on the APE100/Quadrics parallel computer, where–due to a rigid next-neighbour connectivity and lack of local addressing–efficient FFT implementations could not be realized so far. |
| 588 | _ | _ | |a Dataset connected to CrossRef Book Series |
| 700 | 1 | _ | |a Schilling, K. |0 P:(DE-HGF)0 |b 1 |
| 700 | 1 | _ | |a Toschi, F. |0 P:(DE-HGF)0 |b 2 |
| 700 | 1 | _ | |a Trentmann, S. |0 P:(DE-HGF)0 |b 3 |
| 700 | 1 | _ | |a Tripiccione, R. |0 P:(DE-HGF)0 |b 4 |
| 773 | _ | _ | |a 10.1007/BFb0037171 |
| 909 | C | O | |p extern4vita |o oai:juser.fz-juelich.de:860344 |
| 910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 0 |6 P:(DE-Juel1)132179 |
| 910 | 1 | _ | |a External Institute |0 I:(DE-HGF)0 |k Extern |b 1 |6 P:(DE-HGF)0 |
| 915 | _ | _ | |a Nationallizenz |0 StatID:(DE-HGF)0420 |2 StatID |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0200 |2 StatID |b SCOPUS |
| 980 | _ | _ | |a contrib |
| 980 | _ | _ | |a EDITORS |
| 980 | _ | _ | |a contb |
| 980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| 980 | _ | _ | |a I:(DE-Juel1)NIC-20090406 |
| 980 | 1 | _ | |a EXTERN4VITA |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|