Comparison of Different Parallel Modified Gram-Schmidt Algorithms
The modified Gram-Schmidt algorithm (MGS) is used in many fields of computational science as a basic part for problems which relate to Numerical Linear Algebra. In this paper we describe different parallel implementations (blocked and unblocked) of the MGS-algorithm and show how computation and calc...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 836 |
|---|---|
| container_issue | |
| container_start_page | 826 |
| container_title | |
| container_volume | |
| creator | Rünger, Gudula Schwind, Michael |
| description | The modified Gram-Schmidt algorithm (MGS) is used in many fields of computational science as a basic part for problems which relate to Numerical Linear Algebra. In this paper we describe different parallel implementations (blocked and unblocked) of the MGS-algorithm and show how computation and calculation overlap can increase the performance up to 38 percent on the two different Clusters platforms which where used for performance evaluation. |
| doi_str_mv | 10.1007/11549468_90 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17095243</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17095243</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-6d1a7c81200e412f6a7440dd9ee16f45f363d3f91608dc2e7c512d76c28399993</originalsourceid><addsrcrecordid>eNpNULtOwzAUNS-JUjrxA1kYGAL3-hmPVYGCVAQSMEcmtltDEkd2Fv6eoDJwliOd13AIuUC4RgB1gyi45rKqNRyQMyY4MNRUiEMyQ4lYMsb10d6glQKAYzIDBrTUirNTssj5cxKnkhICZmS5it1gUsixL6IvboP3Lrl-LF5MMm3r2uIp2uCDs8U6ma58bXZdsGOxbLcxhXHX5XNy4k2b3eKP5-T9_u5t9VBuntePq-WmHCjqsZQWjWoqpACOI_XSKM7BWu0cSs-FZ5JZ5jVKqGxDnWoEUqtkQyumJ7A5udzvDiY3pvXJ9E3I9ZBCZ9J3jQq0oJxNuat9Lk9Wv3Wp_ojxK9cI9e-B9b8D2Q-R31v7</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Comparison of Different Parallel Modified Gram-Schmidt Algorithms</title><source>Springer Books</source><creator>Rünger, Gudula ; Schwind, Michael</creator><contributor>Cunha, José C. ; Medeiros, Pedro D.</contributor><creatorcontrib>Rünger, Gudula ; Schwind, Michael ; Cunha, José C. ; Medeiros, Pedro D.</creatorcontrib><description>The modified Gram-Schmidt algorithm (MGS) is used in many fields of computational science as a basic part for problems which relate to Numerical Linear Algebra. In this paper we describe different parallel implementations (blocked and unblocked) of the MGS-algorithm and show how computation and calculation overlap can increase the performance up to 38 percent on the two different Clusters platforms which where used for performance evaluation.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540287000</identifier><identifier>ISBN: 9783540287001</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540319255</identifier><identifier>EISBN: 9783540319252</identifier><identifier>DOI: 10.1007/11549468_90</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Basic Linear Algebra Subprogram ; Cluster Platform ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Local Part ; Process Column ; Processor Number ; Software</subject><ispartof>Euro-Par 2005 Parallel Processing, 2005, p.826-836</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11549468_90$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11549468_90$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4049,4050,27924,38254,41441,42510</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17095243$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Cunha, José C.</contributor><contributor>Medeiros, Pedro D.</contributor><creatorcontrib>Rünger, Gudula</creatorcontrib><creatorcontrib>Schwind, Michael</creatorcontrib><title>Comparison of Different Parallel Modified Gram-Schmidt Algorithms</title><title>Euro-Par 2005 Parallel Processing</title><description>The modified Gram-Schmidt algorithm (MGS) is used in many fields of computational science as a basic part for problems which relate to Numerical Linear Algebra. In this paper we describe different parallel implementations (blocked and unblocked) of the MGS-algorithm and show how computation and calculation overlap can increase the performance up to 38 percent on the two different Clusters platforms which where used for performance evaluation.</description><subject>Applied sciences</subject><subject>Basic Linear Algebra Subprogram</subject><subject>Cluster Platform</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Local Part</subject><subject>Process Column</subject><subject>Processor Number</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540287000</isbn><isbn>9783540287001</isbn><isbn>3540319255</isbn><isbn>9783540319252</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNULtOwzAUNS-JUjrxA1kYGAL3-hmPVYGCVAQSMEcmtltDEkd2Fv6eoDJwliOd13AIuUC4RgB1gyi45rKqNRyQMyY4MNRUiEMyQ4lYMsb10d6glQKAYzIDBrTUirNTssj5cxKnkhICZmS5it1gUsixL6IvboP3Lrl-LF5MMm3r2uIp2uCDs8U6ma58bXZdsGOxbLcxhXHX5XNy4k2b3eKP5-T9_u5t9VBuntePq-WmHCjqsZQWjWoqpACOI_XSKM7BWu0cSs-FZ5JZ5jVKqGxDnWoEUqtkQyumJ7A5udzvDiY3pvXJ9E3I9ZBCZ9J3jQq0oJxNuat9Lk9Wv3Wp_ojxK9cI9e-B9b8D2Q-R31v7</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Rünger, Gudula</creator><creator>Schwind, Michael</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Comparison of Different Parallel Modified Gram-Schmidt Algorithms</title><author>Rünger, Gudula ; Schwind, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-6d1a7c81200e412f6a7440dd9ee16f45f363d3f91608dc2e7c512d76c28399993</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Basic Linear Algebra Subprogram</topic><topic>Cluster Platform</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Local Part</topic><topic>Process Column</topic><topic>Processor Number</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rünger, Gudula</creatorcontrib><creatorcontrib>Schwind, Michael</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rünger, Gudula</au><au>Schwind, Michael</au><au>Cunha, José C.</au><au>Medeiros, Pedro D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Comparison of Different Parallel Modified Gram-Schmidt Algorithms</atitle><btitle>Euro-Par 2005 Parallel Processing</btitle><date>2005</date><risdate>2005</risdate><spage>826</spage><epage>836</epage><pages>826-836</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540287000</isbn><isbn>9783540287001</isbn><eisbn>3540319255</eisbn><eisbn>9783540319252</eisbn><abstract>The modified Gram-Schmidt algorithm (MGS) is used in many fields of computational science as a basic part for problems which relate to Numerical Linear Algebra. In this paper we describe different parallel implementations (blocked and unblocked) of the MGS-algorithm and show how computation and calculation overlap can increase the performance up to 38 percent on the two different Clusters platforms which where used for performance evaluation.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11549468_90</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Euro-Par 2005 Parallel Processing, 2005, p.826-836 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17095243 |
| source | Springer Books |
| subjects | Applied sciences Basic Linear Algebra Subprogram Cluster Platform Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Local Part Process Column Processor Number Software |
| title | Comparison of Different Parallel Modified Gram-Schmidt Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T10%3A44%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Comparison%20of%20Different%20Parallel%20Modified%20Gram-Schmidt%20Algorithms&rft.btitle=Euro-Par%202005%20Parallel%20Processing&rft.au=R%C3%BCnger,%20Gudula&rft.date=2005&rft.spage=826&rft.epage=836&rft.pages=826-836&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540287000&rft.isbn_list=9783540287001&rft_id=info:doi/10.1007/11549468_90&rft_dat=%3Cpascalfrancis_sprin%3E17095243%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540319255&rft.eisbn_list=9783540319252&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |