ON SIMULATION OF SOME CAYLEY-BASED NETWORKS

This paper addresses the simulation of four networks whose underlying topology is a Cayley graph. The SIMD model of parallelism is used in t his study. The networks considered are: star graph, bubble-sort graph, and pancake graph. The simulation is performed by mimicking the inter connection functions of the guest (network to be simulated) using a se t of interconnection functions offered by the host. The interconnectio n function of the network to be simulated that requires the most time to simulate determines the simulation time of that network. The simula tion times for all cases are derived and shown to be optimal. Results indicate the superiority of pancake networks over star networks in sim ulating the networks under study.