Computing all-pairs shortest paths on a linear systolic array and hardware realization on a reprogrammable FPGA platform

Author： Milovanović E. Milovanović I. Bekakos M. Tselepis I.

Publisher： Springer Publishing Company

ISSN： 0920-8542

Source： The Journal of Supercomputing, Vol.40, Iss.1, 2007-04, pp. : 49-66

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Branch-Checking Algorithm for All-Pairs Shortest Paths

By Duin Cees

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 131-145

Springer Publishing Company

Access to resources Recommend Favorite

All-Pairs Bottleneck Paths in Vertex Weighted Graphs

By Shapira Asaf Yuster Raphael Zwick Uri

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 621-633

Springer Publishing Company

Access to resources Recommend Favorite

A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths

By Zwick Uri

Algorithmica, Vol. 46, Iss. 2, 2006-10 ,pp. : 181-192

Springer Publishing Company

Access to resources Recommend Favorite

Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

By Banerjee S. Ghosh R.K. Reddy A.P.K.

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 165-171

Academic Press

Access to resources Recommend Favorite

Harnessing parallelism in multicore clusters with the All-Pairs, Wavefront, and Makeflow abstractions

By Yu Li Moretti Christopher Thrasher Andrew Emrich Scott Judd Kenneth Thain Douglas

Cluster Computing, Vol. 13, Iss. 3, 2010-09 ,pp. : 243-256

Springer Publishing Company

Access to resources Recommend Favorite