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 this study. The networks considered are: star graph, bubble-soart graph, and pancake graph. The simulation is performed by mimicking the interconnection functions of the guest (network to be simulated) using a set of interconnection functions offered by the host. The interconnection function of the network to be simulated that requires the most time to simulate determines the simulation time of that network. The simulation times for all cases are derived and shown to be optimal. Results indicate the superiority of pancake networks over star networks in simulating the networks under study.
Cayley graphs; Computer network resources; Graph theory; Group theory--Data processing; Parallel processing (Electronic computers); Resource allocation--Data processing; SIMD (Computer architecture)
Computer and Systems Architecture | Computer Engineering | Digital Communications and Networking | Electrical and Computer Engineering | Systems and Communications
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
On simulation of some Cayley-based networks.
Information Sciences-Applications, 2