ALGORITHMS FOR INTERCONNECTION NETWORKS

Abstract

In the present work algorithms related with some operation (broadcasting, routing and partitioing) of the interconnection network are developed. Algorithms for analysis of interconnection network are also developed. For the purpose of writing algorithms, six interconnection network topologies (generalized cube, hypercube, fault-tolerant, graph, chordal ring, delta and PM21) are choosers (though, all the four algorithms (algorithms for broad casting, algorithms for routing etc.) are "not"-developed for each of the six networks). Each algorithm is meant for doing a specific task and is written as the sequence of steps. For each algorithm, a flow chart is drawn and one example of its usage is provided. Then a SPARKS program is written for each algorithm,which is then converted into a C language program. SPARKS contain set of statements, using these statements one can write program similar to program of conventional- language. ._