On simulation of some Cayley-based networks
โ Scribed by Shahram Latifi
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 349 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1069-0115
No coin nor oath required. For personal study only.
โฆ Synopsis
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-sort 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.
๐ SIMILAR VOLUMES
We consider the operator equation SX -~)~t i U, XV, = Y where { U, }. { t~ } are some commutative sets of operators but in general { U, } need not commute with { 1,)}. Particular cases of this equation are the Syivester and Ljaptmov equations. We give a new representation and an approximation of the
## Abstract In this paper, a new method based on Global Network Simulation (GNS) approach for adaptive distance relaying is presented. The GNS approach uses Diakoptics and Large Change Sensitivity (LCS) concepts to perform the interconnected power systems analysis globally. The proposed method empl
Im nachstehenden Artikel wird der. Zusammenhang zwischen dem Real-bezw. Imagin~irteil einer Impedanzfunktion, oder ihres Logarithmus, und der Funktion selbst erneut abgeleitet, diesmal mit besonderer Riicksicht auf l~bertragungsimpedanzen. Diese Beziehu~agen geben Anlass zu zwei besonderen Klassen