## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Edwin Hsing-Mean Sha; Kenneth Steiglitz |

OCLC Number: | 26368465 |

Notes: | "April 1991." |

Description: | 24 pages : illustrations ; 28 cm. |

Series Title: | Princeton University.; Department of Computer Science.; Technical report |

Responsibility: | Edwin Hsing-Mean Sha, Kenneth Steiglitz. |

### Abstract:

Abstract: "This paper describes some explicit constructions for reconfigurable array architectures. Given a working architecture (application graph), we add redundant hardware to increase reliability. The degree of reconfigurability, DR, of a redundant graph is a measure of the cost of reconfiguration after failures. When DR is independent of the size of the application graph, we say the graph is finitely reconfigurable, FR. We present a class of simple layered graphs with a logarithmic number of redundant edges, which can maintain both finite reconfigurability and a fixed level of reliability for a wide class of application graphs.

By sacrificing finite reconfigurability, we show that by using expanders we can construct highly reliable structures with the asymptotically optimal number of edges for one-dimensional and tree-like array architectures."

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Reliable reconfigurable structures for array architectures".
Be the first.