Spare Allocation and Compensation-Path Finding for Reconfiguring WSI Processor Arrays Having Single-Track Switches (Special Section of Papers Selected from ITC-CSCC'96)

スポンサーリンク

概要

• 論文の詳細を見る

• In contrast to previous algorithms for reconfiguring processor arrays under the assumption that spare rows and columns are placed on the perimeter of the array or on fixed positions, our new algorithm employs movable and partitionable spare rows and columns. The objective of moving and partitioning spare rows and/or columns is the elimination of faulty processors each of which is blocked in all directions to spare processors. The results of our computer simulation indicate that recofigurability can significantly be improved.

• 一般社団法人電子情報通信学会の論文
• 1997-06-25

著者

• Ozawa Takao

  Department Of Applied Mathematics And Informatics Ryukoku University

• Yamaguchi Takeshi

  Tada Electric Ltd.

関連論文

• Lymph node metastasis and p53 overexpression in combination for the prognosis for the colorectal cancer
• Optical Multiple-Valued Logic Gates : Complement and Literals
• Optical Mullistability by a Liquid Crystal Light Modulator
• On the Mapping Data of Planar Graphs (Applied Combinatorial Theory and Algorithms)
• New Applications of the Principal Partition of Graphs to Electrical Network Analysis (Graphs and Combinatorics III)
• Spare Allocation and Compensation-Path Finding for Reconfiguring WSI Processor Arrays Having Single-Track Switches (Special Section of Papers Selected from ITC-CSCC'96)

スポンサーリンク