Abstract: In the real parallel computer systems,faults of processors and links are inevitable,and the fault tolerance abi-lity of a system can be evaluated by the performance of its interconnection network.In order to measure the fault tole-rance abilities of the parallel computers which take (n,k)-bubble-sort networks as underlying topologies,combining the hierarchical structures and sub-network partitions’ characters of (n,k)-bubble-sort networks,an algorithm of the problem that destroy all the (n－m,k－m)-bubble-sort networks in the (n,k)-bubble-sort network under the node fault model and the link fault model was proposed,and the optimal attacking nodes set and the optimal attacking links set were obtained.According to the algorithm,to destroy all the (n－m,k－m)-bubble-sort networks in the (n,k)-bubble-sort network,at least C^m_nm!nodes or C^m_nm!links ought to be faulty under the node fault model and the link fault mo-del,respectively,where 2≤k≤n－2 and m≤k－1.

Key words: Parallel computer,High-performance interconnection network,(n,k)-bubble-sort network,Fault tolerance,Sub-network preclusion