following manner. When it is the turn of a PE to broadcast its cost, it also broadcasts a signal (using one of the unused bits in the data bus) to indicate whether its status was modified during the previous iteration. The rest of the PEs receive and process this information during the next clock cycle. Thus, at the end of the iteration, each PE would be able to decide whether the status of any of the PEs was modified during the previous iteration. If the status of none of the PEs is modified, then the PE, which corresponds to
the source node, outputs a special value on the data bus to indicate to the host that the shortest-path computation has been completed. Thus, if the algorithm converges in m iterations, m + 1 iterations need to be performed as one extra iteration is required to detect the convergence.