pacman.operations.router_algorithms package

Module contents

pacman.operations.router_algorithms.basic_dijkstra_routing(bw_per_route_entry=0.01, max_bw=250)
Find routes between the edges with the allocated information,
placed in the given places
Parameters:use_progress_bar (bool) – whether to show a progress bar
Returns:The discovered routes
Return type:MulticastRoutingTables
Raises:PacmanRoutingException – If something goes wrong with the routing
pacman.operations.router_algorithms.ner_route()

basic ner router

Returns:a routing table by partition
Return type:MulticastRoutingTableByPartition
pacman.operations.router_algorithms.ner_route_traffic_aware()

traffic-aware ner router

Returns:a routing table by partition
Return type:MulticastRoutingTableByPartition
pacman.operations.router_algorithms.route_application_graph()

Route an application graph