A Parallel Algorithm for Solving the Reversal Median Problem
We present a new algorithm called rEvoluzer II for solving the Reversal Median problem (RMP). Similar to its predecessor rEvoluzer I the new algorithm can preserve conserved intervals but it has the additional property that it is suitable for parallelization. For the parallel version of rEvoluzer II...
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 | 1096 |
|---|---|
| container_issue | |
| container_start_page | 1089 |
| container_title | |
| container_volume | |
| creator | Bernt, Matthias Merkle, Daniel Middendorf, Martin |
| description | We present a new algorithm called rEvoluzer II for solving the Reversal Median problem (RMP). Similar to its predecessor rEvoluzer I the new algorithm can preserve conserved intervals but it has the additional property that it is suitable for parallelization. For the parallel version of rEvoluzer II a master-slave parallelization scheme is used and several methods for reducing parallelization overheads have been incorporated. We show experimentally that rEvoluzer achieves very good results compared to other methods for the RMP. It is also shown that the parallel version has good scaling behavior for a not too large number of processors. |
| doi_str_mv | 10.1007/11752578_132 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19162309</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19162309</sourcerecordid><originalsourceid>FETCH-LOGICAL-p220t-9d01b2ea8fcdc1a338f90d3eeb78cf0061591a08ae1cf37c218254461dec599e3</originalsourceid><addsrcrecordid>eNpNkEtLAzEUheMLrLU7f0A2boTRe3OTmQm4KaU-oGLxsR4ymaQdTWdKUgr-eytV8GzO4nycxcfYBcI1AhQ3iIUSqigrJHHARrooSUkgiVLAIRtgjpgRSX3Ezv4GFMdsAAQi04WkUzZK6QN2IdREasBux3xuognBBT4Oiz62m-WK-z7y1z5s227BN0vHX9zWxWQCf3JNazo-j30d3OqcnXgTkhv99pC9303fJg_Z7Pn-cTKeZWshYJPpBrAWzpTeNhYNUek1NORcXZTWA-SoNBoojUPrqbACS6GkzLFxVmntaMgu979rk6wJPprOtqlax3Zl4leFGnNBoHfc1Z5Lu6lbuFjVff-ZKoTqx1_13x99A-5kW6M</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Parallel Algorithm for Solving the Reversal Median Problem</title><source>Springer Books</source><creator>Bernt, Matthias ; Merkle, Daniel ; Middendorf, Martin</creator><contributor>Meyer, Norbert ; Dongarra, Jack ; Wyrzykowski, Roman ; Waśniewski, Jerzy</contributor><creatorcontrib>Bernt, Matthias ; Merkle, Daniel ; Middendorf, Martin ; Meyer, Norbert ; Dongarra, Jack ; Wyrzykowski, Roman ; Waśniewski, Jerzy</creatorcontrib><description>We present a new algorithm called rEvoluzer II for solving the Reversal Median problem (RMP). Similar to its predecessor rEvoluzer I the new algorithm can preserve conserved intervals but it has the additional property that it is suitable for parallelization. For the parallel version of rEvoluzer II a master-slave parallelization scheme is used and several methods for reducing parallelization overheads have been incorporated. We show experimentally that rEvoluzer achieves very good results compared to other methods for the RMP. It is also shown that the parallel version has good scaling behavior for a not too large number of processors.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540341412</identifier><identifier>ISBN: 9783540341413</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540341420</identifier><identifier>EISBN: 3540341420</identifier><identifier>DOI: 10.1007/11752578_132</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Chunk Size ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Master Node ; Master Process ; Parallel Algorithm ; Parallel Version ; Software</subject><ispartof>Lecture notes in computer science, 2006, p.1089-1096</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 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/11752578_132$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11752578_132$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,777,778,782,787,788,791,4038,4039,27908,38238,41425,42494</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19162309$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Meyer, Norbert</contributor><contributor>Dongarra, Jack</contributor><contributor>Wyrzykowski, Roman</contributor><contributor>Waśniewski, Jerzy</contributor><creatorcontrib>Bernt, Matthias</creatorcontrib><creatorcontrib>Merkle, Daniel</creatorcontrib><creatorcontrib>Middendorf, Martin</creatorcontrib><title>A Parallel Algorithm for Solving the Reversal Median Problem</title><title>Lecture notes in computer science</title><description>We present a new algorithm called rEvoluzer II for solving the Reversal Median problem (RMP). Similar to its predecessor rEvoluzer I the new algorithm can preserve conserved intervals but it has the additional property that it is suitable for parallelization. For the parallel version of rEvoluzer II a master-slave parallelization scheme is used and several methods for reducing parallelization overheads have been incorporated. We show experimentally that rEvoluzer achieves very good results compared to other methods for the RMP. It is also shown that the parallel version has good scaling behavior for a not too large number of processors.</description><subject>Applied sciences</subject><subject>Chunk Size</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Master Node</subject><subject>Master Process</subject><subject>Parallel Algorithm</subject><subject>Parallel Version</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540341412</isbn><isbn>9783540341413</isbn><isbn>9783540341420</isbn><isbn>3540341420</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkEtLAzEUheMLrLU7f0A2boTRe3OTmQm4KaU-oGLxsR4ymaQdTWdKUgr-eytV8GzO4nycxcfYBcI1AhQ3iIUSqigrJHHARrooSUkgiVLAIRtgjpgRSX3Ezv4GFMdsAAQi04WkUzZK6QN2IdREasBux3xuognBBT4Oiz62m-WK-z7y1z5s227BN0vHX9zWxWQCf3JNazo-j30d3OqcnXgTkhv99pC9303fJg_Z7Pn-cTKeZWshYJPpBrAWzpTeNhYNUek1NORcXZTWA-SoNBoojUPrqbACS6GkzLFxVmntaMgu979rk6wJPprOtqlax3Zl4leFGnNBoHfc1Z5Lu6lbuFjVff-ZKoTqx1_13x99A-5kW6M</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Bernt, Matthias</creator><creator>Merkle, Daniel</creator><creator>Middendorf, Martin</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>A Parallel Algorithm for Solving the Reversal Median Problem</title><author>Bernt, Matthias ; Merkle, Daniel ; Middendorf, Martin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p220t-9d01b2ea8fcdc1a338f90d3eeb78cf0061591a08ae1cf37c218254461dec599e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Chunk Size</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Master Node</topic><topic>Master Process</topic><topic>Parallel Algorithm</topic><topic>Parallel Version</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bernt, Matthias</creatorcontrib><creatorcontrib>Merkle, Daniel</creatorcontrib><creatorcontrib>Middendorf, Martin</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bernt, Matthias</au><au>Merkle, Daniel</au><au>Middendorf, Martin</au><au>Meyer, Norbert</au><au>Dongarra, Jack</au><au>Wyrzykowski, Roman</au><au>Waśniewski, Jerzy</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Parallel Algorithm for Solving the Reversal Median Problem</atitle><btitle>Lecture notes in computer science</btitle><date>2006</date><risdate>2006</risdate><spage>1089</spage><epage>1096</epage><pages>1089-1096</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540341412</isbn><isbn>9783540341413</isbn><eisbn>9783540341420</eisbn><eisbn>3540341420</eisbn><abstract>We present a new algorithm called rEvoluzer II for solving the Reversal Median problem (RMP). Similar to its predecessor rEvoluzer I the new algorithm can preserve conserved intervals but it has the additional property that it is suitable for parallelization. For the parallel version of rEvoluzer II a master-slave parallelization scheme is used and several methods for reducing parallelization overheads have been incorporated. We show experimentally that rEvoluzer achieves very good results compared to other methods for the RMP. It is also shown that the parallel version has good scaling behavior for a not too large number of processors.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11752578_132</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2006, p.1089-1096 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19162309 |
| source | Springer Books |
| subjects | Applied sciences Chunk Size Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Master Node Master Process Parallel Algorithm Parallel Version Software |
| title | A Parallel Algorithm for Solving the Reversal Median Problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T12%3A45%3A10IST&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=A%20Parallel%20Algorithm%20for%20Solving%20the%20Reversal%20Median%20Problem&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Bernt,%20Matthias&rft.date=2006&rft.spage=1089&rft.epage=1096&rft.pages=1089-1096&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540341412&rft.isbn_list=9783540341413&rft_id=info:doi/10.1007/11752578_132&rft_dat=%3Cpascalfrancis_sprin%3E19162309%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540341420&rft.eisbn_list=3540341420&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |