Distributed route initialization algorithms for the Monash Secure RISC Multiprocessor

The Monash Secure RISC Multiprocessor (SRMP) is a general-purpose large-scale multiprocessor with a capability-based distributed shared virtual memory. The physical design of the Monash SRMP consists of passive backplane bus sections and dual-ported processor-memory modules connected in an unusual topology. This paper details three algorithms used for route initialization. The first is a simplification of the flooding algorithms commonly used in distributed networks. The second algorithm uses a variation of the depth-first search algorithm, which has been used to route mesh and hypercube architectures. The final algorithm uses a theoretical solution to the gossiping (all-to-all broadcast) problem for mesh networks; this is the first known simulation of this algorithm. The algorithms are evaluated via simulations of the traffic flow over the multiprocessor network