Showing papers by "Kenneth Steiglitz published in 1993"
Journal Article•
TL;DR: It is shown that the FHP lattice gases are computation universal, implying that general questions about their behavior are undecidable, and embeds a universal one-dimensional cellular automat on in the two-dimensional F HP lattice gas.
Abstract: We show that the FHP lattice gases are computation universal, implying that general questions about their behavior are undecidable. The proof embeds a universal one-dimensional cellular automat on in the two-dimensional FHP latt ice gas. This provides evidence that general questions about fluid behavior are undecidable.
10 citations
TL;DR: It is shown that DR provides a natural lower bound on the time complexity of any distributed reconfiguration algorithm and that there is no difference between being FR and LR on dynamic graphs.
Abstract: The authors study fault-tolerant redundant structures for maintaining reliable arrays. In particular, they assume that the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. The degree of reconfigurability (DR) and DR with distance (DR/sup d/) of a redundant graph are defined. When DR and DR/sup d/ are independent of the size of the application graph, the graph is finitely reconfigurable (FR) and locally reconfigurable (LR), respectively. It is shown that DR provides a natural lower bound on the time complexity of any distributed reconfiguration algorithm and that there is no difference between being FR and LR on dynamic graphs. It is also shown that if both local reconfigurability and a fixed level of reliability are to be maintained, a dynamic graph must be of a dimension at least one greater than the application graph. Thus, for example, a one-dimensional systolic array cannot be embedded in a one-dimensional dynamic graph without sacrificing either reliability or locality of reconfiguration. >
4 citations
13 Apr 1993
TL;DR: The authors present an on-line distributed reconfiguration algorithm for finding a new maximum matching incrementally after some nodes have failed, which is deadlock free, and maintains at least M-k matching pairs during the reconfigured process.
Abstract: The authors present an on-line distributed reconfiguration algorithm for finding a new maximum matching incrementally after some nodes have failed. Their algorithm is deadlock free, and with k failures maintains at least M-k matching pairs during the reconfiguration process, where M is the size of the original maximum matching. The algorithm tolerates failures that occur during reconfiguration. The worst-case reconfiguration time is O(k min( mod A mod , mod B mod )) after k failures, where A and B are the node sets, but simulations show that the average-case reconfiguration time is much better. The algorithm is also simple enough to be implemented in hardware. >
2 citations
TL;DR: The algorithm is deadlock-free and, with k failures, maintains at least M – k matching pairs during the reconfiguration process, where M is the size of the original maximum matching.
Abstract: We present an on-line distributed reconfiguration algorithm for finding a new maximum matching incrementally after some nodes have failed. Our algorithm is deadlock-free and, with k failures, maintains at least M – k matching pairs during the reconfiguration process, where M is the size of the original maximum matching. The algorithm tolerates failures that occur during reconfiguration. The worst-case reconfiguration time is O(k min(|A|, |B|)) after k failures, where A and B are the node sets, but simulations show that the average-case reconfiguration time is much better. The algorithm is also simple enough to be implemented in hardware. © 1993 by John Wiley & Sons, Inc.
1 citations