A blocked all-pairs shortest-paths algorithm

A blocked all-pairs shortest-paths algorithm

We propose a blocked version of Floyd's all-pairs shortest-paths algorithm. The blocked algorithm makes better utilization of cache than does Floyd's original algorithm. Experiments indicate that the blocked algorithm delivers a speedup (relative to the unblocked Floyd's algorithm) be...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The ACM journal of experimental algorithmics 2003-12, Vol.8
Hauptverfasser: Venkataraman, Gayathri, Sahni, Sartaj, Mukhopadhyaya, Srabani
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title The ACM journal of experimental algorithmics
container_volume 8
creator Venkataraman, Gayathri
Sahni, Sartaj
Mukhopadhyaya, Srabani
description We propose a blocked version of Floyd's all-pairs shortest-paths algorithm. The blocked algorithm makes better utilization of cache than does Floyd's original algorithm. Experiments indicate that the blocked algorithm delivers a speedup (relative to the unblocked Floyd's algorithm) between 1.6 and 1.9 on a Sun Ultra Enterprise 4000/5000 for graphs that have between 480 and 3200 vertices. The measured speedup on an SGI O2 for graphs with between 240 and 1200 vertices is between 1.6 and 2.
doi_str_mv 10.1145/996546.996553
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28875362</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28875362</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2883-8a800cec453e9faebd0151d25a09d1382d7598b09243e8ffbaa6bb353b09e6d23</originalsourceid><addsrcrecordid>eNpNkL1PwzAQxS0EEqUwsmdiwsXOxa49VhVfUiUWmC1_hQQcHOx04L_HURiY3t27p7vTD6FrSjaUNuxOSs4avpmFwQlaUSIazIt3-q8-Rxc5fxBCgQCs0O2uMiHaT-8qHQIedZ9ylbuYJp-n0k5dLoP3mPqpGy7RWatD9ld_ukZvD_ev-yd8eHl83u8O2NZCABZaEGK9bRh42WpvHKGMupppIh0FUbstk8IQWTfgRdsarbkxwKBYnrsa1uhm2Tum-H0sj6ihz9aHoL98PGZVrmwZ8DmIl6BNMefkWzWmftDpR1GiZiZqYaIWJvALvVVSzA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28875362</pqid></control><display><type>article</type><title>A blocked all-pairs shortest-paths algorithm</title><source>ACM Digital Library Complete</source><creator>Venkataraman, Gayathri ; Sahni, Sartaj ; Mukhopadhyaya, Srabani</creator><creatorcontrib>Venkataraman, Gayathri ; Sahni, Sartaj ; Mukhopadhyaya, Srabani</creatorcontrib><description>We propose a blocked version of Floyd's all-pairs shortest-paths algorithm. The blocked algorithm makes better utilization of cache than does Floyd's original algorithm. Experiments indicate that the blocked algorithm delivers a speedup (relative to the unblocked Floyd's algorithm) between 1.6 and 1.9 on a Sun Ultra Enterprise 4000/5000 for graphs that have between 480 and 3200 vertices. The measured speedup on an SGI O2 for graphs with between 240 and 1200 vertices is between 1.6 and 2.</description><identifier>ISSN: 1084-6654</identifier><identifier>EISSN: 1084-6654</identifier><identifier>DOI: 10.1145/996546.996553</identifier><language>eng</language><ispartof>The ACM journal of experimental algorithmics, 2003-12, Vol.8</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2883-8a800cec453e9faebd0151d25a09d1382d7598b09243e8ffbaa6bb353b09e6d23</citedby><cites>FETCH-LOGICAL-c2883-8a800cec453e9faebd0151d25a09d1382d7598b09243e8ffbaa6bb353b09e6d23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Venkataraman, Gayathri</creatorcontrib><creatorcontrib>Sahni, Sartaj</creatorcontrib><creatorcontrib>Mukhopadhyaya, Srabani</creatorcontrib><title>A blocked all-pairs shortest-paths algorithm</title><title>The ACM journal of experimental algorithmics</title><description>We propose a blocked version of Floyd's all-pairs shortest-paths algorithm. The blocked algorithm makes better utilization of cache than does Floyd's original algorithm. Experiments indicate that the blocked algorithm delivers a speedup (relative to the unblocked Floyd's algorithm) between 1.6 and 1.9 on a Sun Ultra Enterprise 4000/5000 for graphs that have between 480 and 3200 vertices. The measured speedup on an SGI O2 for graphs with between 240 and 1200 vertices is between 1.6 and 2.</description><issn>1084-6654</issn><issn>1084-6654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><recordid>eNpNkL1PwzAQxS0EEqUwsmdiwsXOxa49VhVfUiUWmC1_hQQcHOx04L_HURiY3t27p7vTD6FrSjaUNuxOSs4avpmFwQlaUSIazIt3-q8-Rxc5fxBCgQCs0O2uMiHaT-8qHQIedZ9ylbuYJp-n0k5dLoP3mPqpGy7RWatD9ld_ukZvD_ev-yd8eHl83u8O2NZCABZaEGK9bRh42WpvHKGMupppIh0FUbstk8IQWTfgRdsarbkxwKBYnrsa1uhm2Tum-H0sj6ihz9aHoL98PGZVrmwZ8DmIl6BNMefkWzWmftDpR1GiZiZqYaIWJvALvVVSzA</recordid><startdate>20031231</startdate><enddate>20031231</enddate><creator>Venkataraman, Gayathri</creator><creator>Sahni, Sartaj</creator><creator>Mukhopadhyaya, Srabani</creator><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>20031231</creationdate><title>A blocked all-pairs shortest-paths algorithm</title><author>Venkataraman, Gayathri ; Sahni, Sartaj ; Mukhopadhyaya, Srabani</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2883-8a800cec453e9faebd0151d25a09d1382d7598b09243e8ffbaa6bb353b09e6d23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Venkataraman, Gayathri</creatorcontrib><creatorcontrib>Sahni, Sartaj</creatorcontrib><creatorcontrib>Mukhopadhyaya, Srabani</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>The ACM journal of experimental algorithmics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Venkataraman, Gayathri</au><au>Sahni, Sartaj</au><au>Mukhopadhyaya, Srabani</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A blocked all-pairs shortest-paths algorithm</atitle><jtitle>The ACM journal of experimental algorithmics</jtitle><date>2003-12-31</date><risdate>2003</risdate><volume>8</volume><issn>1084-6654</issn><eissn>1084-6654</eissn><abstract>We propose a blocked version of Floyd's all-pairs shortest-paths algorithm. The blocked algorithm makes better utilization of cache than does Floyd's original algorithm. Experiments indicate that the blocked algorithm delivers a speedup (relative to the unblocked Floyd's algorithm) between 1.6 and 1.9 on a Sun Ultra Enterprise 4000/5000 for graphs that have between 480 and 3200 vertices. The measured speedup on an SGI O2 for graphs with between 240 and 1200 vertices is between 1.6 and 2.</abstract><doi>10.1145/996546.996553</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1084-6654
ispartof The ACM journal of experimental algorithmics, 2003-12, Vol.8
issn 1084-6654
1084-6654
language eng
recordid cdi_proquest_miscellaneous_28875362
source ACM Digital Library Complete
title A blocked all-pairs shortest-paths algorithm
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T00%3A01%3A11IST&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=A%20blocked%20all-pairs%20shortest-paths%20algorithm&rft.jtitle=The%20ACM%20journal%20of%20experimental%20algorithmics&rft.au=Venkataraman,%20Gayathri&rft.date=2003-12-31&rft.volume=8&rft.issn=1084-6654&rft.eissn=1084-6654&rft_id=info:doi/10.1145/996546.996553&rft_dat=%3Cproquest_cross%3E28875362%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=28875362&rft_id=info:pmid/&rfr_iscdi=true