- Title
- The strong connectivity of bubble-sort star graphs
- Creator
- Wang, Shiying; Wang, Mujiangshan
- Relation
- Computer Journal Vol. 62, Issue 5, p. 715-729
- Publisher Link
- http://dx.doi.org/10.1093/comjnl/bxy077
- Publisher
- Oxford University Press
- Resource Type
- journal article
- Date
- 2019
- Description
- Mass data processing and complex problem solving have higher and higher demands for performance of multiprocessor systems. Many multiprocessor systems have interconnection networks as underlying topologies. The interconnection network determines the performance of a multiprocessor system. In the system where the processors and their communication links to each other are likely to fail, it is important to consider the fault tolerance of the network. At this background, the strong connectivity of the network is proposed. For the strong connectivity, it allows both processors and communication links to fail at the same time. For the traditional connectivity, the connectivity only allows processors failure and the edge connectivity only allows communication link failure. In the design of an interconnection network, one of the most fundamental considerations is the connectivity of the network. In this paper, we give the definition of the strong connectivity of the network and some properties of the strong connectivity of the network. As a favorable topology structure of interconnection networks, the n-dimensional bubble-sort star graph BSn has many good properties. We give some strong connectivity of BSn, too.
- Subject
- interconnection network; connectivity; bubble-sort star graph; network
- Identifier
- http://hdl.handle.net/1959.13/1451749
- Identifier
- uon:44260
- Identifier
- ISSN:0010-4620
- Language
- eng
- Reviewed
- Hits: 725
- Visitors: 725
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|