Publication | Closed Access

An efficient shortest path algorithm for content-based routing on 2-D mesh accelerator networks

Cluster ComputingNetwork Routing AlgorithmEngineeringEdge ComputingMesh NetworkNetwork RoutingComputer ArchitectureComputer EngineeringRoutingNetwork AnalysisContent-based RoutingParallel ProgrammingComputer ScienceScalable RoutingParallel ComputingCombinatorial OptimizationRouting Protocol