Multimegapoint FFT's running on workstation computers
The authors show that the data addressing required for an in-place fast Fourier transform (FFT) whose memory requirement significantly exceeds the physical memory size of a machine causes an unacceptable level of virtual memory disk access, commonly known as thrashing. In addition, a matrix-decompos...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 105 vol.1 |
|---|---|
| container_issue | |
| container_start_page | 101 |
| container_title | |
| container_volume | |
| creator | Grimm, M.J. Zimmerman, G.A. |
| description | The authors show that the data addressing required for an in-place fast Fourier transform (FFT) whose memory requirement significantly exceeds the physical memory size of a machine causes an unacceptable level of virtual memory disk access, commonly known as thrashing. In addition, a matrix-decomposition FFT is shown to replace the reordering of the large data set with matrix transpositions, using a two pass memory-efficient matrix transposition technique. The matrix FFT, combined with a file oriented matrix transpose, is shown to be an easy way to prevent thrashing. This method was applied to perform simulations of a 2/sup 23/ (8,388,608) point real-only FFT processor which will be used in NASA's Search for Extraterrestrial Intelligence program.< > |
| doi_str_mv | 10.1109/ACSSC.1991.186422 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_186422</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>186422</ieee_id><sourcerecordid>186422</sourcerecordid><originalsourceid>FETCH-LOGICAL-i172t-7589c7270e2d29e2703799f06368b8a88b2f5711d315646543c392dd6489c5163</originalsourceid><addsrcrecordid>eNotj01Lw0AYhBc_wFDzA_SUm6fEfff7PZZgqlDx0HouabIpq80HuxvEf2-gzmUeGGZgCHkAWgBQfF6Xu11ZACIUYJRg7IokTGqVM075NUlRG2qWhAlNxQ1JgEqTK478jqQhfNFFQoKQmBD5Pp-j6-2pnkY3xKyq9k8h8_MwuOGUjUP2M_rvEOvoFm7Gfpqj9eGe3Hb1Odj031fks3rZl6_59mPzVq63uQPNYq6lwUYzTS1rGdoFuEbsqOLKHE1tzJF1UgO0HKQSSgrecGRtq8TSk6D4ijxedp219jB519f-93D5zP8AcaVGcA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Multimegapoint FFT's running on workstation computers</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Grimm, M.J. ; Zimmerman, G.A.</creator><creatorcontrib>Grimm, M.J. ; Zimmerman, G.A.</creatorcontrib><description>The authors show that the data addressing required for an in-place fast Fourier transform (FFT) whose memory requirement significantly exceeds the physical memory size of a machine causes an unacceptable level of virtual memory disk access, commonly known as thrashing. In addition, a matrix-decomposition FFT is shown to replace the reordering of the large data set with matrix transpositions, using a two pass memory-efficient matrix transposition technique. The matrix FFT, combined with a file oriented matrix transpose, is shown to be an easy way to prevent thrashing. This method was applied to perform simulations of a 2/sup 23/ (8,388,608) point real-only FFT processor which will be used in NASA's Search for Extraterrestrial Intelligence program.< ></description><identifier>ISSN: 1058-6393</identifier><identifier>ISBN: 9780818624704</identifier><identifier>ISBN: 0818624701</identifier><identifier>EISSN: 2576-2303</identifier><identifier>DOI: 10.1109/ACSSC.1991.186422</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Computational modeling ; Degradation ; Drives ; Fast Fourier transforms ; Flexible printed circuits ; High performance computing ; Laboratories ; Machine intelligence ; Spectral analysis ; Workstations</subject><ispartof>[1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers, 1991, p.101-105 vol.1</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/186422$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/186422$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Grimm, M.J.</creatorcontrib><creatorcontrib>Zimmerman, G.A.</creatorcontrib><title>Multimegapoint FFT's running on workstation computers</title><title>[1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers</title><addtitle>ACSSC</addtitle><description>The authors show that the data addressing required for an in-place fast Fourier transform (FFT) whose memory requirement significantly exceeds the physical memory size of a machine causes an unacceptable level of virtual memory disk access, commonly known as thrashing. In addition, a matrix-decomposition FFT is shown to replace the reordering of the large data set with matrix transpositions, using a two pass memory-efficient matrix transposition technique. The matrix FFT, combined with a file oriented matrix transpose, is shown to be an easy way to prevent thrashing. This method was applied to perform simulations of a 2/sup 23/ (8,388,608) point real-only FFT processor which will be used in NASA's Search for Extraterrestrial Intelligence program.< ></description><subject>Computational modeling</subject><subject>Degradation</subject><subject>Drives</subject><subject>Fast Fourier transforms</subject><subject>Flexible printed circuits</subject><subject>High performance computing</subject><subject>Laboratories</subject><subject>Machine intelligence</subject><subject>Spectral analysis</subject><subject>Workstations</subject><issn>1058-6393</issn><issn>2576-2303</issn><isbn>9780818624704</isbn><isbn>0818624701</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1991</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj01Lw0AYhBc_wFDzA_SUm6fEfff7PZZgqlDx0HouabIpq80HuxvEf2-gzmUeGGZgCHkAWgBQfF6Xu11ZACIUYJRg7IokTGqVM075NUlRG2qWhAlNxQ1JgEqTK478jqQhfNFFQoKQmBD5Pp-j6-2pnkY3xKyq9k8h8_MwuOGUjUP2M_rvEOvoFm7Gfpqj9eGe3Hb1Odj031fks3rZl6_59mPzVq63uQPNYq6lwUYzTS1rGdoFuEbsqOLKHE1tzJF1UgO0HKQSSgrecGRtq8TSk6D4ijxedp219jB519f-93D5zP8AcaVGcA</recordid><startdate>1991</startdate><enddate>1991</enddate><creator>Grimm, M.J.</creator><creator>Zimmerman, G.A.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1991</creationdate><title>Multimegapoint FFT's running on workstation computers</title><author>Grimm, M.J. ; Zimmerman, G.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i172t-7589c7270e2d29e2703799f06368b8a88b2f5711d315646543c392dd6489c5163</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Computational modeling</topic><topic>Degradation</topic><topic>Drives</topic><topic>Fast Fourier transforms</topic><topic>Flexible printed circuits</topic><topic>High performance computing</topic><topic>Laboratories</topic><topic>Machine intelligence</topic><topic>Spectral analysis</topic><topic>Workstations</topic><toplevel>online_resources</toplevel><creatorcontrib>Grimm, M.J.</creatorcontrib><creatorcontrib>Zimmerman, G.A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Grimm, M.J.</au><au>Zimmerman, G.A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Multimegapoint FFT's running on workstation computers</atitle><btitle>[1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers</btitle><stitle>ACSSC</stitle><date>1991</date><risdate>1991</risdate><spage>101</spage><epage>105 vol.1</epage><pages>101-105 vol.1</pages><issn>1058-6393</issn><eissn>2576-2303</eissn><isbn>9780818624704</isbn><isbn>0818624701</isbn><abstract>The authors show that the data addressing required for an in-place fast Fourier transform (FFT) whose memory requirement significantly exceeds the physical memory size of a machine causes an unacceptable level of virtual memory disk access, commonly known as thrashing. In addition, a matrix-decomposition FFT is shown to replace the reordering of the large data set with matrix transpositions, using a two pass memory-efficient matrix transposition technique. The matrix FFT, combined with a file oriented matrix transpose, is shown to be an easy way to prevent thrashing. This method was applied to perform simulations of a 2/sup 23/ (8,388,608) point real-only FFT processor which will be used in NASA's Search for Extraterrestrial Intelligence program.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/ACSSC.1991.186422</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1058-6393 |
| ispartof | [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers, 1991, p.101-105 vol.1 |
| issn | 1058-6393 2576-2303 |
| language | eng |
| recordid | cdi_ieee_primary_186422 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computational modeling Degradation Drives Fast Fourier transforms Flexible printed circuits High performance computing Laboratories Machine intelligence Spectral analysis Workstations |
| title | Multimegapoint FFT's running on workstation computers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T14%3A57%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Multimegapoint%20FFT's%20running%20on%20workstation%20computers&rft.btitle=%5B1991%5D%20Conference%20Record%20of%20the%20Twenty-Fifth%20Asilomar%20Conference%20on%20Signals,%20Systems%20&%20Computers&rft.au=Grimm,%20M.J.&rft.date=1991&rft.spage=101&rft.epage=105%20vol.1&rft.pages=101-105%20vol.1&rft.issn=1058-6393&rft.eissn=2576-2303&rft.isbn=9780818624704&rft.isbn_list=0818624701&rft_id=info:doi/10.1109/ACSSC.1991.186422&rft_dat=%3Cieee_6IE%3E186422%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=186422&rfr_iscdi=true |