Can a Helmholtz solver run on a cluster?
Our vectorized Helmholtz solver runs at 85% efficiency on a NEC SX-5. The most time-consuming parts have been ported on SMP, NUMA, and cluster architectures. It is shown that an OpenMP version can deliver similar performance when running it on a 16 processor SGI Altix. A partial parallelisation usin...
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 | 8 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Gruber, R. Keller, V. Leriche, E. Habisreutinger, M.A. |
| description | Our vectorized Helmholtz solver runs at 85% efficiency on a NEC SX-5. The most time-consuming parts have been ported on SMP, NUMA, and cluster architectures. It is shown that an OpenMP version can deliver similar performance when running it on a 16 processor SGI Altix. A partial parallelisation using MPI is made to validate the Gamma model to predict application behaviours on parallel machines. This model is then applied to simulate the behaviour of a hypothetical full MPI version on different distributed memory machines. It is found that only the Cray XT3 with its very fast internode communication network will be able to deliver the performance of a NEC SX-8 with the advantage that bigger case could be handled |
| doi_str_mv | 10.1109/CLUSTR.2006.311874 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4100380</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4100380</ieee_id><sourcerecordid>4100380</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-2e9e3e8a0e171f17583720716579618abebe56185019293444d17a8f5ebbfefe3</originalsourceid><addsrcrecordid>eNo1jMtKxEAQRcsXGMf8gG6ydJNY1Y909UokqCMEBI3roaMVjGQmkmQE5-uNqHdzL-fABTgjzIjQXxbl81P1mCnEPNNE7MwexN4xGWUMasW8D5GinFOvrD6Ak3_h-BAislaldgbHEI_jO84x1mhSEVwUYZOEZCnd-q3vpl0y9t2nDMmw3ST9j3nptuMkw9UpHDWhGyX-6wVUtzdVsUzLh7v74rpMW49TqsSLFg4o5KghZ1k7hY5y63xOHGqpxc7DInnltTHmlVzgxkpdN9KIXsD5720rIquPoV2H4WtlCFEz6m9gN0QK</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Can a Helmholtz solver run on a cluster?</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Gruber, R. ; Keller, V. ; Leriche, E. ; Habisreutinger, M.A.</creator><creatorcontrib>Gruber, R. ; Keller, V. ; Leriche, E. ; Habisreutinger, M.A.</creatorcontrib><description>Our vectorized Helmholtz solver runs at 85% efficiency on a NEC SX-5. The most time-consuming parts have been ported on SMP, NUMA, and cluster architectures. It is shown that an OpenMP version can deliver similar performance when running it on a 16 processor SGI Altix. A partial parallelisation using MPI is made to validate the Gamma model to predict application behaviours on parallel machines. This model is then applied to simulate the behaviour of a hypothetical full MPI version on different distributed memory machines. It is found that only the Cray XT3 with its very fast internode communication network will be able to deliver the performance of a NEC SX-8 with the advantage that bigger case could be handled</description><identifier>ISSN: 1552-5244</identifier><identifier>ISBN: 1424403278</identifier><identifier>ISBN: 9781424403271</identifier><identifier>EISSN: 2168-9253</identifier><identifier>EISBN: 9781424403288</identifier><identifier>EISBN: 1424403286</identifier><identifier>DOI: 10.1109/CLUSTR.2006.311874</identifier><language>eng</language><publisher>IEEE</publisher><subject>Boundary conditions ; Chebyshev approximation ; Communication networks ; Computer architecture ; Costs ; Geometry ; Laboratories ; National electric code ; Parallel machines ; Predictive models</subject><ispartof>2006 IEEE International Conference on Cluster Computing, 2006, p.1-8</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/4100380$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,781,785,790,791,2059,27927,54922</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4100380$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Gruber, R.</creatorcontrib><creatorcontrib>Keller, V.</creatorcontrib><creatorcontrib>Leriche, E.</creatorcontrib><creatorcontrib>Habisreutinger, M.A.</creatorcontrib><title>Can a Helmholtz solver run on a cluster?</title><title>2006 IEEE International Conference on Cluster Computing</title><addtitle>CLUSTR</addtitle><description>Our vectorized Helmholtz solver runs at 85% efficiency on a NEC SX-5. The most time-consuming parts have been ported on SMP, NUMA, and cluster architectures. It is shown that an OpenMP version can deliver similar performance when running it on a 16 processor SGI Altix. A partial parallelisation using MPI is made to validate the Gamma model to predict application behaviours on parallel machines. This model is then applied to simulate the behaviour of a hypothetical full MPI version on different distributed memory machines. It is found that only the Cray XT3 with its very fast internode communication network will be able to deliver the performance of a NEC SX-8 with the advantage that bigger case could be handled</description><subject>Boundary conditions</subject><subject>Chebyshev approximation</subject><subject>Communication networks</subject><subject>Computer architecture</subject><subject>Costs</subject><subject>Geometry</subject><subject>Laboratories</subject><subject>National electric code</subject><subject>Parallel machines</subject><subject>Predictive models</subject><issn>1552-5244</issn><issn>2168-9253</issn><isbn>1424403278</isbn><isbn>9781424403271</isbn><isbn>9781424403288</isbn><isbn>1424403286</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1jMtKxEAQRcsXGMf8gG6ydJNY1Y909UokqCMEBI3roaMVjGQmkmQE5-uNqHdzL-fABTgjzIjQXxbl81P1mCnEPNNE7MwexN4xGWUMasW8D5GinFOvrD6Ak3_h-BAislaldgbHEI_jO84x1mhSEVwUYZOEZCnd-q3vpl0y9t2nDMmw3ST9j3nptuMkw9UpHDWhGyX-6wVUtzdVsUzLh7v74rpMW49TqsSLFg4o5KghZ1k7hY5y63xOHGqpxc7DInnltTHmlVzgxkpdN9KIXsD5720rIquPoV2H4WtlCFEz6m9gN0QK</recordid><startdate>200609</startdate><enddate>200609</enddate><creator>Gruber, R.</creator><creator>Keller, V.</creator><creator>Leriche, E.</creator><creator>Habisreutinger, M.A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200609</creationdate><title>Can a Helmholtz solver run on a cluster?</title><author>Gruber, R. ; Keller, V. ; Leriche, E. ; Habisreutinger, M.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-2e9e3e8a0e171f17583720716579618abebe56185019293444d17a8f5ebbfefe3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Boundary conditions</topic><topic>Chebyshev approximation</topic><topic>Communication networks</topic><topic>Computer architecture</topic><topic>Costs</topic><topic>Geometry</topic><topic>Laboratories</topic><topic>National electric code</topic><topic>Parallel machines</topic><topic>Predictive models</topic><toplevel>online_resources</toplevel><creatorcontrib>Gruber, R.</creatorcontrib><creatorcontrib>Keller, V.</creatorcontrib><creatorcontrib>Leriche, E.</creatorcontrib><creatorcontrib>Habisreutinger, M.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/IET 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>Gruber, R.</au><au>Keller, V.</au><au>Leriche, E.</au><au>Habisreutinger, M.A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Can a Helmholtz solver run on a cluster?</atitle><btitle>2006 IEEE International Conference on Cluster Computing</btitle><stitle>CLUSTR</stitle><date>2006-09</date><risdate>2006</risdate><spage>1</spage><epage>8</epage><pages>1-8</pages><issn>1552-5244</issn><eissn>2168-9253</eissn><isbn>1424403278</isbn><isbn>9781424403271</isbn><eisbn>9781424403288</eisbn><eisbn>1424403286</eisbn><abstract>Our vectorized Helmholtz solver runs at 85% efficiency on a NEC SX-5. The most time-consuming parts have been ported on SMP, NUMA, and cluster architectures. It is shown that an OpenMP version can deliver similar performance when running it on a 16 processor SGI Altix. A partial parallelisation using MPI is made to validate the Gamma model to predict application behaviours on parallel machines. This model is then applied to simulate the behaviour of a hypothetical full MPI version on different distributed memory machines. It is found that only the Cray XT3 with its very fast internode communication network will be able to deliver the performance of a NEC SX-8 with the advantage that bigger case could be handled</abstract><pub>IEEE</pub><doi>10.1109/CLUSTR.2006.311874</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1552-5244 |
| ispartof | 2006 IEEE International Conference on Cluster Computing, 2006, p.1-8 |
| issn | 1552-5244 2168-9253 |
| language | eng |
| recordid | cdi_ieee_primary_4100380 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Boundary conditions Chebyshev approximation Communication networks Computer architecture Costs Geometry Laboratories National electric code Parallel machines Predictive models |
| title | Can a Helmholtz solver run on a cluster? |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T21%3A10%3A41IST&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=Can%20a%20Helmholtz%20solver%20run%20on%20a%20cluster?&rft.btitle=2006%20IEEE%20International%20Conference%20on%20Cluster%20Computing&rft.au=Gruber,%20R.&rft.date=2006-09&rft.spage=1&rft.epage=8&rft.pages=1-8&rft.issn=1552-5244&rft.eissn=2168-9253&rft.isbn=1424403278&rft.isbn_list=9781424403271&rft_id=info:doi/10.1109/CLUSTR.2006.311874&rft_dat=%3Cieee_6IE%3E4100380%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424403288&rft.eisbn_list=1424403286&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4100380&rfr_iscdi=true |