Find a copy in the library
Finding libraries that hold this item...
|All Authors / Contributors:||
Edwin Hsing-Mean Sha; Kenneth Steiglitz
|Description:||28 pages : illustrations ; 28 cm.|
|Series Title:||Princeton University.; Department of Computer Science.; Technical report|
|Responsibility:||Edwin Hsing-Mean Sha, Kenneth Steiglitz.|
We show 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. We then show that if we wish to maintain both local reconfigurability, and a fixed level of reliability, a dynamic graph must be of 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."