Fast Poisson solvers for MIMD computers
The methods of cyclic reduction, Fourier analysis and the resulting hybrid algorithm FACR( l) are formulated for a shared memory multiprocessor and applied to the two-dimensional Poisson equation. The complexity of the algorithms is analyzed, performance curves are given and optimal values of the pa...
Gespeichert in:
| Veröffentlicht in: | Parallel computing 1988, Vol.6 (3), p.265-274 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 274 |
|---|---|
| container_issue | 3 |
| container_start_page | 265 |
| container_title | Parallel computing |
| container_volume | 6 |
| creator | Briggs, William L. Turnbull, Thomas |
| description | The methods of cyclic reduction, Fourier analysis and the resulting hybrid algorithm FACR(
l) are formulated for a shared memory multiprocessor and applied to the two-dimensional Poisson equation. The complexity of the algorithms is analyzed, performance curves are given and optimal values of the parameter
l are determined for various problem sizes and degrees of parallelism. The algorithms are implemented on a shared memory multiprocessor and performance results are discussed. |
| doi_str_mv | 10.1016/0167-8191(88)90069-5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_24888273</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0167819188900695</els_id><sourcerecordid>24888273</sourcerecordid><originalsourceid>FETCH-LOGICAL-c395t-3b476eca96ca297a0d8232ef5e4844fdc97e4923e64b927901a2d2aad347192e3</originalsourceid><addsrcrecordid>eNqNkE1LAzEQhoMoWKv_wMOe_Dis5ms3yUWQarXQogc9hzQ7C5FtUzPbQv-9qRWP4mEYGJ73hXkIOWf0hlFW3-ZRpWaGXWl9bSitTVkdkAHTipdKiPqQDH6RY3KC-EEzJDUdkMuxw754jQExLguM3QYSFm1MxWwyeyh8XKzWfT6dkqPWdQhnP3tI3sePb6PncvryNBndT0svTNWXYi5VDd6Z2jtulKON5oJDW4HUUraNNwqk4QJqOTdcGcocb7hzjZCKGQ5iSC72vasUP9eAvV0E9NB1bglxjZZLrTXPT_0HVEbVGZR70KeImKC1qxQWLm0to3anz-7c2J0bq7X91merHLvbxyB_uwmQLPoASw9NSOB728Twd8EXbfp0wA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>24887976</pqid></control><display><type>article</type><title>Fast Poisson solvers for MIMD computers</title><source>Elsevier ScienceDirect Journals</source><creator>Briggs, William L. ; Turnbull, Thomas</creator><creatorcontrib>Briggs, William L. ; Turnbull, Thomas</creatorcontrib><description>The methods of cyclic reduction, Fourier analysis and the resulting hybrid algorithm FACR(
l) are formulated for a shared memory multiprocessor and applied to the two-dimensional Poisson equation. The complexity of the algorithms is analyzed, performance curves are given and optimal values of the parameter
l are determined for various problem sizes and degrees of parallelism. The algorithms are implemented on a shared memory multiprocessor and performance results are discussed.</description><identifier>ISSN: 0167-8191</identifier><identifier>EISSN: 1872-7336</identifier><identifier>DOI: 10.1016/0167-8191(88)90069-5</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Cyclic reduction ; Denelcor HEP ; FACR( l) ; FFT ; shared memory multiprocessor ; timing results</subject><ispartof>Parallel computing, 1988, Vol.6 (3), p.265-274</ispartof><rights>1988</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c395t-3b476eca96ca297a0d8232ef5e4844fdc97e4923e64b927901a2d2aad347192e3</citedby><cites>FETCH-LOGICAL-c395t-3b476eca96ca297a0d8232ef5e4844fdc97e4923e64b927901a2d2aad347192e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/0167819188900695$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,4010,27900,27901,27902,65534</link.rule.ids></links><search><creatorcontrib>Briggs, William L.</creatorcontrib><creatorcontrib>Turnbull, Thomas</creatorcontrib><title>Fast Poisson solvers for MIMD computers</title><title>Parallel computing</title><description>The methods of cyclic reduction, Fourier analysis and the resulting hybrid algorithm FACR(
l) are formulated for a shared memory multiprocessor and applied to the two-dimensional Poisson equation. The complexity of the algorithms is analyzed, performance curves are given and optimal values of the parameter
l are determined for various problem sizes and degrees of parallelism. The algorithms are implemented on a shared memory multiprocessor and performance results are discussed.</description><subject>Cyclic reduction</subject><subject>Denelcor HEP</subject><subject>FACR( l)</subject><subject>FFT</subject><subject>shared memory multiprocessor</subject><subject>timing results</subject><issn>0167-8191</issn><issn>1872-7336</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1988</creationdate><recordtype>article</recordtype><recordid>eNqNkE1LAzEQhoMoWKv_wMOe_Dis5ms3yUWQarXQogc9hzQ7C5FtUzPbQv-9qRWP4mEYGJ73hXkIOWf0hlFW3-ZRpWaGXWl9bSitTVkdkAHTipdKiPqQDH6RY3KC-EEzJDUdkMuxw754jQExLguM3QYSFm1MxWwyeyh8XKzWfT6dkqPWdQhnP3tI3sePb6PncvryNBndT0svTNWXYi5VDd6Z2jtulKON5oJDW4HUUraNNwqk4QJqOTdcGcocb7hzjZCKGQ5iSC72vasUP9eAvV0E9NB1bglxjZZLrTXPT_0HVEbVGZR70KeImKC1qxQWLm0to3anz-7c2J0bq7X91merHLvbxyB_uwmQLPoASw9NSOB728Twd8EXbfp0wA</recordid><startdate>1988</startdate><enddate>1988</enddate><creator>Briggs, William L.</creator><creator>Turnbull, Thomas</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>H8D</scope></search><sort><creationdate>1988</creationdate><title>Fast Poisson solvers for MIMD computers</title><author>Briggs, William L. ; Turnbull, Thomas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c395t-3b476eca96ca297a0d8232ef5e4844fdc97e4923e64b927901a2d2aad347192e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1988</creationdate><topic>Cyclic reduction</topic><topic>Denelcor HEP</topic><topic>FACR( l)</topic><topic>FFT</topic><topic>shared memory multiprocessor</topic><topic>timing results</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Briggs, William L.</creatorcontrib><creatorcontrib>Turnbull, Thomas</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Aerospace Database</collection><jtitle>Parallel computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Briggs, William L.</au><au>Turnbull, Thomas</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fast Poisson solvers for MIMD computers</atitle><jtitle>Parallel computing</jtitle><date>1988</date><risdate>1988</risdate><volume>6</volume><issue>3</issue><spage>265</spage><epage>274</epage><pages>265-274</pages><issn>0167-8191</issn><eissn>1872-7336</eissn><abstract>The methods of cyclic reduction, Fourier analysis and the resulting hybrid algorithm FACR(
l) are formulated for a shared memory multiprocessor and applied to the two-dimensional Poisson equation. The complexity of the algorithms is analyzed, performance curves are given and optimal values of the parameter
l are determined for various problem sizes and degrees of parallelism. The algorithms are implemented on a shared memory multiprocessor and performance results are discussed.</abstract><pub>Elsevier B.V</pub><doi>10.1016/0167-8191(88)90069-5</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0167-8191 |
| ispartof | Parallel computing, 1988, Vol.6 (3), p.265-274 |
| issn | 0167-8191 1872-7336 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_24888273 |
| source | Elsevier ScienceDirect Journals |
| subjects | Cyclic reduction Denelcor HEP FACR( l) FFT shared memory multiprocessor timing results |
| title | Fast Poisson solvers for MIMD computers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-15T02%3A43%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fast%20Poisson%20solvers%20for%20MIMD%20computers&rft.jtitle=Parallel%20computing&rft.au=Briggs,%20William%20L.&rft.date=1988&rft.volume=6&rft.issue=3&rft.spage=265&rft.epage=274&rft.pages=265-274&rft.issn=0167-8191&rft.eissn=1872-7336&rft_id=info:doi/10.1016/0167-8191(88)90069-5&rft_dat=%3Cproquest_cross%3E24888273%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=24887976&rft_id=info:pmid/&rft_els_id=0167819188900695&rfr_iscdi=true |