A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit <a rel="external noopener" href="http://www-ece.rice.edu/%7Epjv/tcfaulttolerantarray.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Institute of Electrical and Electronics Engineers (IEEE)">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5jlmyrayyrdazh5awdlsoec77q" style="color: black;">IEEE transactions on computers</a>
The Diogenes methodology, proposed by Rosenberg, for the design of easily testable and configurable fault-tolerant VLSI arrays, results in collinear layouts of processors (PE's) that are configured into the desired array structure by appropriate switch settings on buses running parallel to the PE's. While possessing attractive mechanisms for fault-tolerant implementations, Diogenes designs of two-dimensional (2-D) arrays require more area than a two-dimensional implementation and result in long<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/12.16505">doi:10.1109/12.16505</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m3usqgfthrchxfjwokj33bdela">fatcat:m3usqgfthrchxfjwokj33bdela</a> </span>
more »... wires between logically adjacent PE's. In this paper, we present a collinear VLSI array that retains all the desirable fault-tolerance characteristics of Diogenes designs but avoids the degradation in throughput (caused by a lower system clock rate) that long inter-PE wire lengths would impose. Just as in the systolic model, all signals in our array travel a fixed physical distance in any clock cycle. On this model, we show a lower bound of Q(n&) on the time complexity required to multiply two n x n matrices by computing the n3 scalar products. Furthermore, we present an optimal O(n&) time systolic algorithm using n& PE's and requiring O(n*) area. Our algorithm is superior in time performance and/or area requirements to previous matrix multiplication algorithms on this model.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060911104453/http://www-ece.rice.edu/%7Epjv/tcfaulttolerantarray.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/20/d5/20d5fe9723afbada77661b67e3e2c17ba60eeb97.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/12.16505"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>