Searching for authors named "Raffaele Tripiccione" – sorted by Relevance.
-
FFT for the APE Parallel Computer
- this article has been implemented on a 512-node QH4 machine and has been optimized for working with very large lattice sizes (i. e. 8192 \Theta 8192 elements). We are able to compute an FFT on the corresponding date set of about 512 Mbyte in 4 seconds. This means that we are working at about 9% of t
- Add To MetaCart
-
published in Parallel Computing: Architectures, Algorithms and Applications,
- to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific
- Add To MetaCart

