A blocked all-pairs shortest-paths algorithm

DOI10.1145/996546.996553zbMath1085.68744OpenAlexW2035449679MaRDI QIDQ5463439

Gayathri Venkataraman, Srabani Mukhopadhyaya, Sartaj K. Sahni

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/jea/2003/VenkataramanBlocked/

zbMATH Keywords

cachealgorithmsblockingall pairs shortest pathsspeedup

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The uniform memory hierarchy model of computation
• The Influence of Caches on the Performance of Sorting
• Irredundant intervals
• A memetic algorithm to schedule planned maintenance for the national grid
• Improving memory performance of sorting algorithms
• Analysing cache effects in distribution sorting
• Organizing matrices and matrix operations for paged memory systems

This page was built for publication: A blocked all-pairs shortest-paths algorithm