Program Systems: Theory and Applications
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Program Systems: Theory and Applications:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Program Systems: Theory and Applications, 2017, Volume 8, Issue 1, Pages 47–62
DOI: https://doi.org/10.25209/2079-3316-2017-8-1-47-62 (Mi ps248) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Hardware, software and distributed supercomputer systems

Effective computation of two-dimensional FFT on a homogeneous or heterogeneous cluster

D. Yu. Knyazkov

Ishlinsky Institute for Problems in Mechanics of the Russian Academy of Sciences
Full-text PDF (888 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.25209/2079-3316-2017-8-1-47-62
Abstract: The paper considers performing two-dimensional FFT on a supercomputer. It investigates a dependance of FFT computation time from a matrix size for MVS-100K, MVS-10P and HybriLIT supercomputers. A method of CPU-GPU load balance for a heterogeneous cluster is proposed. For a TESLA K40 card it is shown, that two-dimensional FFT computation time is almost equal to data transferring time. The computation itself is 48 times faster when using GPU comparing to two-processors node. (In Russian).
Key words and phrases: HPC, supercomputer computations, fast Fourier transform, FFT, GPU computations.
Funding agency Grant number
Russian Foundation for Basic Research 16-31-60096_мол-а-дк
Document Type: Article
UDC: 519.68
Language: Russian
Citation: D. Yu. Knyazkov, “Effective computation of two-dimensional FFT on a homogeneous or heterogeneous cluster”, Program Systems: Theory and Applications, 8:1 (2017), 47–62
Citation in format AMSBIB
\Bibitem{Kny17}
\by D.~Yu.~Knyazkov
\paper Effective computation of two-dimensional FFT on a homogeneous or heterogeneous cluster
\jour Program Systems: Theory and Applications
\yr 2017
\vol 8
\issue 1
\pages 47--62
\mathnet{http://mi.mathnet.ru/ps248}
\crossref{https://doi.org/10.25209/2079-3316-2017-8-1-47-62}
Linking options:
  • https://www.mathnet.ru/eng/ps248
  • https://www.mathnet.ru/eng/ps/v8/i1/p47
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Program Systems: Theory and Applications
    Statistics & downloads:
    Abstract page:155
    Full-text PDF :44
    References:22
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024