In this paper, we discuss a reconfigurable tree-connected multiprocessor system and its arraylike layout. Each level in our tree consists of several blocks with PEs. The reconfiguration is executed for each block by shifting PEs to the right. It is valid if the number of faulty PEs in each block is less than or equal to that of spare ones in it. We introduce a 7/spl times/7 square module with a five-level tree to simplify the arraylike layout. The system with six or more levels is constructed easily by arranging several modules regularly. The comparison with other trees layoutable in planar arrays shows that our tree is superior to others in maximum interconnection length.
['Sumito Nakano', 'Naotake Kamiura', 'Yutaka Hata']
Fault tolerance of a tree-connected multiprocessor system and its arraylike layout