BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:An Analysis of FFTW and FFTE Performance
DTSTART;VALUE=DATE-TIME:20121017T150000Z
DTEND;VALUE=DATE-TIME:20121017T153000Z
DTSTAMP;VALUE=DATE-TIME:20261011T115958Z
UID:indico-contribution-177@indico.ipb.ac.rs
DESCRIPTION:Speakers: Josip Jakic (Scientific Computing Laboratory\, Insti
 tute of Physics Belgrade)\nOne of the most frequently used algorithms in e
 ngineering and scientific applications is Fast Fourier Transform (FFT). It
 s open source implementation (Fastest Fourier Transform of the West\, FFTW
 ) is widely used\, mainly due to its excellent performance\, comparable to
  the vendor-supplied libraries. On the other hand\, even if not yet in a f
 ully production state\, FFTE (Fastest Fourier Transform of the East) keeps
  up with FFTW\, and outperforms it for very large transform sizes. Here we
  present results of the performance and scalability tests of FFTW and FFTE
  libraries. Comparison is done using different compilers and parallelizati
 on approaches on Curie and Jugene supercomputers.\n\nhttps://events.saifa.
 rs/event/291/contributions/177/
LOCATION:National Library of Serbia
URL:https://events.saifa.rs/event/291/contributions/177/
END:VEVENT
END:VCALENDAR