Implementing parallel shortest path for parallel transportation applications

Shortest path algorithms are required by several transportation applications; furthermore, the shortest path computation in these applications can account for a large percentage of the total execution time. Since these algorithms are very computationally intense, parallel processing can provide the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel computing 2001-11, Vol.27 (12), p.1537-1568
Hauptverfasser: Hribar, Michelle R, Taylor, Valerie E, Boyce, David E
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1568
container_issue 12
container_start_page 1537
container_title Parallel computing
container_volume 27
creator Hribar, Michelle R
Taylor, Valerie E
Boyce, David E
description Shortest path algorithms are required by several transportation applications; furthermore, the shortest path computation in these applications can account for a large percentage of the total execution time. Since these algorithms are very computationally intense, parallel processing can provide the compute power and memory required to solve large problems quickly. Therefore, good parallel shortest algorithms are critical for efficient parallel implementations of transportation applications. The experimental work related to parallel shortest path algorithms has focused on the development of parallel algorithms; however, very little work has been done with analyzing and understanding the performance impact of various implementation issues. In this paper, we conduct a thorough experimental analysis of parallel shortest path algorithms for sparse networks, concentrating on three implementation issues: (1) choice of shortest path algorithm, (2) termination detection and (3) network decomposition. The paper focuses on the choice of shortest path algorithm and network decomposition since the work on termination detection was published previously. We determine that all three issues affect the communication and convergence of the shortest path algorithm. Furthermore, we find that communicating the most information at a time results in the best convergence; this is contrary to most scientific applications where it is optimal to minimize communication.
doi_str_mv 10.1016/S0167-8191(01)00105-3
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_26819195</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0167819101001053</els_id><sourcerecordid>26819195</sourcerecordid><originalsourceid>FETCH-LOGICAL-c338t-b3d58513db995538c242bf9e9485993ece3913cfbebd701617dbe2230ae7355a3</originalsourceid><addsrcrecordid>eNqFUE1LxDAQDaLguvoThJ5ED9Wks2mbk4j4sbDgQT2HNJ26kbSNSVbw35vuih6FYWaYeTO89wg5ZfSSUVZePadU5TUT7JyyC0oZ5TnskRmrqyKvAMp9MvuFHJKjEN4ppeWipjOyWvbOYo9DNMNb5pRX1qLNwnr0EUNMk7jOutH_raJXQ3BpraIZh0w5Z43e9uGYHHTKBjz5qXPyen_3cvuYr54elrc3q1wD1DFvoOU1Z9A2QnAOtS4WRdMJFIuaCwGoEQQD3TXYtFUizqq2waIAqrACzhXMydnur_PjxybRlL0JGq1VA46bIItyUip4AvIdUPsxBI-ddN70yn9JRuXkndx6Jye4pCkm7ySku-vdHSYVnwa9DNrgoLE1HnWU7Wj--fANpvV3fg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26819195</pqid></control><display><type>article</type><title>Implementing parallel shortest path for parallel transportation applications</title><source>Access via ScienceDirect (Elsevier)</source><creator>Hribar, Michelle R ; Taylor, Valerie E ; Boyce, David E</creator><creatorcontrib>Hribar, Michelle R ; Taylor, Valerie E ; Boyce, David E</creatorcontrib><description>Shortest path algorithms are required by several transportation applications; furthermore, the shortest path computation in these applications can account for a large percentage of the total execution time. Since these algorithms are very computationally intense, parallel processing can provide the compute power and memory required to solve large problems quickly. Therefore, good parallel shortest algorithms are critical for efficient parallel implementations of transportation applications. The experimental work related to parallel shortest path algorithms has focused on the development of parallel algorithms; however, very little work has been done with analyzing and understanding the performance impact of various implementation issues. In this paper, we conduct a thorough experimental analysis of parallel shortest path algorithms for sparse networks, concentrating on three implementation issues: (1) choice of shortest path algorithm, (2) termination detection and (3) network decomposition. The paper focuses on the choice of shortest path algorithm and network decomposition since the work on termination detection was published previously. We determine that all three issues affect the communication and convergence of the shortest path algorithm. Furthermore, we find that communicating the most information at a time results in the best convergence; this is contrary to most scientific applications where it is optimal to minimize communication.</description><identifier>ISSN: 0167-8191</identifier><identifier>EISSN: 1872-7336</identifier><identifier>DOI: 10.1016/S0167-8191(01)00105-3</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Network decomposition ; Parallel performance ; Parallel shortest path ; Parallel transportation applications ; Shortest path algorithms ; Traffic equilibrium</subject><ispartof>Parallel computing, 2001-11, Vol.27 (12), p.1537-1568</ispartof><rights>2001</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c338t-b3d58513db995538c242bf9e9485993ece3913cfbebd701617dbe2230ae7355a3</citedby><cites>FETCH-LOGICAL-c338t-b3d58513db995538c242bf9e9485993ece3913cfbebd701617dbe2230ae7355a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0167-8191(01)00105-3$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Hribar, Michelle R</creatorcontrib><creatorcontrib>Taylor, Valerie E</creatorcontrib><creatorcontrib>Boyce, David E</creatorcontrib><title>Implementing parallel shortest path for parallel transportation applications</title><title>Parallel computing</title><description>Shortest path algorithms are required by several transportation applications; furthermore, the shortest path computation in these applications can account for a large percentage of the total execution time. Since these algorithms are very computationally intense, parallel processing can provide the compute power and memory required to solve large problems quickly. Therefore, good parallel shortest algorithms are critical for efficient parallel implementations of transportation applications. The experimental work related to parallel shortest path algorithms has focused on the development of parallel algorithms; however, very little work has been done with analyzing and understanding the performance impact of various implementation issues. In this paper, we conduct a thorough experimental analysis of parallel shortest path algorithms for sparse networks, concentrating on three implementation issues: (1) choice of shortest path algorithm, (2) termination detection and (3) network decomposition. The paper focuses on the choice of shortest path algorithm and network decomposition since the work on termination detection was published previously. We determine that all three issues affect the communication and convergence of the shortest path algorithm. Furthermore, we find that communicating the most information at a time results in the best convergence; this is contrary to most scientific applications where it is optimal to minimize communication.</description><subject>Network decomposition</subject><subject>Parallel performance</subject><subject>Parallel shortest path</subject><subject>Parallel transportation applications</subject><subject>Shortest path algorithms</subject><subject>Traffic equilibrium</subject><issn>0167-8191</issn><issn>1872-7336</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><recordid>eNqFUE1LxDAQDaLguvoThJ5ED9Wks2mbk4j4sbDgQT2HNJ26kbSNSVbw35vuih6FYWaYeTO89wg5ZfSSUVZePadU5TUT7JyyC0oZ5TnskRmrqyKvAMp9MvuFHJKjEN4ppeWipjOyWvbOYo9DNMNb5pRX1qLNwnr0EUNMk7jOutH_raJXQ3BpraIZh0w5Z43e9uGYHHTKBjz5qXPyen_3cvuYr54elrc3q1wD1DFvoOU1Z9A2QnAOtS4WRdMJFIuaCwGoEQQD3TXYtFUizqq2waIAqrACzhXMydnur_PjxybRlL0JGq1VA46bIItyUip4AvIdUPsxBI-ddN70yn9JRuXkndx6Jye4pCkm7ySku-vdHSYVnwa9DNrgoLE1HnWU7Wj--fANpvV3fg</recordid><startdate>20011101</startdate><enddate>20011101</enddate><creator>Hribar, Michelle R</creator><creator>Taylor, Valerie E</creator><creator>Boyce, David E</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></search><sort><creationdate>20011101</creationdate><title>Implementing parallel shortest path for parallel transportation applications</title><author>Hribar, Michelle R ; Taylor, Valerie E ; Boyce, David E</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c338t-b3d58513db995538c242bf9e9485993ece3913cfbebd701617dbe2230ae7355a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Network decomposition</topic><topic>Parallel performance</topic><topic>Parallel shortest path</topic><topic>Parallel transportation applications</topic><topic>Shortest path algorithms</topic><topic>Traffic equilibrium</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hribar, Michelle R</creatorcontrib><creatorcontrib>Taylor, Valerie E</creatorcontrib><creatorcontrib>Boyce, David E</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><jtitle>Parallel computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hribar, Michelle R</au><au>Taylor, Valerie E</au><au>Boyce, David E</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Implementing parallel shortest path for parallel transportation applications</atitle><jtitle>Parallel computing</jtitle><date>2001-11-01</date><risdate>2001</risdate><volume>27</volume><issue>12</issue><spage>1537</spage><epage>1568</epage><pages>1537-1568</pages><issn>0167-8191</issn><eissn>1872-7336</eissn><abstract>Shortest path algorithms are required by several transportation applications; furthermore, the shortest path computation in these applications can account for a large percentage of the total execution time. Since these algorithms are very computationally intense, parallel processing can provide the compute power and memory required to solve large problems quickly. Therefore, good parallel shortest algorithms are critical for efficient parallel implementations of transportation applications. The experimental work related to parallel shortest path algorithms has focused on the development of parallel algorithms; however, very little work has been done with analyzing and understanding the performance impact of various implementation issues. In this paper, we conduct a thorough experimental analysis of parallel shortest path algorithms for sparse networks, concentrating on three implementation issues: (1) choice of shortest path algorithm, (2) termination detection and (3) network decomposition. The paper focuses on the choice of shortest path algorithm and network decomposition since the work on termination detection was published previously. We determine that all three issues affect the communication and convergence of the shortest path algorithm. Furthermore, we find that communicating the most information at a time results in the best convergence; this is contrary to most scientific applications where it is optimal to minimize communication.</abstract><pub>Elsevier B.V</pub><doi>10.1016/S0167-8191(01)00105-3</doi><tpages>32</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0167-8191
ispartof Parallel computing, 2001-11, Vol.27 (12), p.1537-1568
issn 0167-8191
1872-7336
language eng
recordid cdi_proquest_miscellaneous_26819195
source Access via ScienceDirect (Elsevier)
subjects Network decomposition
Parallel performance
Parallel shortest path
Parallel transportation applications
Shortest path algorithms
Traffic equilibrium
title Implementing parallel shortest path for parallel transportation applications
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T10%3A01%3A57IST&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=Implementing%20parallel%20shortest%20path%20for%20parallel%20transportation%20applications&rft.jtitle=Parallel%20computing&rft.au=Hribar,%20Michelle%20R&rft.date=2001-11-01&rft.volume=27&rft.issue=12&rft.spage=1537&rft.epage=1568&rft.pages=1537-1568&rft.issn=0167-8191&rft.eissn=1872-7336&rft_id=info:doi/10.1016/S0167-8191(01)00105-3&rft_dat=%3Cproquest_cross%3E26819195%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=26819195&rft_id=info:pmid/&rft_els_id=S0167819101001053&rfr_iscdi=true