Fault-tolerance in biswapped multiprocessor interconnection networks

Abstract

Interconnection networks play a vital role in connecting many sets of processor memories, known as processing vertices. Recently, multiprocessor interconnection networks have obtained much attention due to their cost-effectiveness and wide applications in parallel multi-processor systems connecting processors and memory modules. A locating set in a computer network is to select certain nodes, called the locating set, whose positions determine the positions of all other nodes in the network. The locating number is defined as the minimum size of the locating set needed to identify all network vertices. Since, if any single node fails within the locating set, that set is no longer able to identify all the nodes within the network, if the remaining nodes in the locating set can still locate all other network nodes, then it is termed a fault-tolerant locating set. The fault tolerance becomes highly essential in multiprocessor networks, wherein every processor is subject to an absolute failure, to guarantee the system is at full capacity in case one or more components fail. In this study, we determine the fault-tolerant locating number of biswapped networks by considering different classes of networks as base clusters.