Struct caminos_lib::routing::WeighedShortest

pub struct WeighedShortest { /* fields omitted */ }

Use the shortest path from origin to destination, giving a weight to each link class. Note that it uses information based on BFS and not on Dijkstra, which may cause discrepancies in some topologies. See the Topology::compute_distance_matrix and its notes on weights for more informations.

Implementations

impl WeighedShortest

pub fn new(arg: RoutingBuilderArgument<'_>) -> WeighedShortest

Trait Implementations

impl Debug for WeighedShortest

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Routing for WeighedShortest

pub fn next(
    &self,
    _routing_info: &RoutingInfo,
    topology: &dyn Topology,
    current_router: usize,
    target_server: usize,
    num_virtual_channels: usize,
    _rng: &RefCell<StdRng>
) -> Vec<CandidateEgress>

Compute the list of allowed exits.

pub fn initialize_routing_info(
    &self,
    _routing_info: &RefCell<RoutingInfo>,
    _topology: &dyn Topology,
    _current_router: usize,
    _target_server: usize,
    _rng: &RefCell<StdRng>
)

Initialize the routing info of the packet. Called when the first phit of the packet leaves the server and enters a router.

pub fn update_routing_info(
    &self,
    _routing_info: &RefCell<RoutingInfo>,
    _topology: &dyn Topology,
    _current_router: usize,
    _current_port: usize,
    _target_server: usize,
    _rng: &RefCell<StdRng>
)

Updates the routing info of the packet. Called when the first phit of the packet leaves a router and enters another router. Values are of the router being entered into.

pub fn initialize(
    &mut self,
    topology: &Box<dyn Topology>,
    _rng: &RefCell<StdRng>
)

Prepares the routing to be utilized. Perhaps by precomputing routing tables.