Lines Matching refs:each

6 1.  Min Hop Algorithm - based on the minimum hops to each node where the
9 2.  UPDN Unicast routing algorithm - also based on the minimum hops to each
47    How many hops are required to get from each port to each LID ?
56 2. Once MinHop matrices exist, each switch is visited and for each target LID,
62    If LMC > 0, more checks are added: Within each group of LIDs assigned to
132 the subnet, a statistical histogram is built for each switch (hop num vs
150 each (CA or switch) node in the subnet. During the BFS process, the FDB table
151 of each switch node traversed by BFS is updated, in reference to the starting
176 1.   A valid guid file specifies one guid in each line. Lines with an invalid
210     of ports in each UP-going port group.
212     of ports in each DOWN-going port group.
277 channel dependency graph for each layer. Once the potential addition
284 to another so that the number of paths in each layer averages out.
336 at each step.  This provides the ordering necessary to avoid deadlock.