A random, distributed algorithm to embed trees in partially faulty processor arrays
- 1 May 1991
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 12 (1) , 1-11
- https://doi.org/10.1016/0743-7315(91)90024-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Efficient Embeddings of Binary Trees in VLSI ArraysIEEE Transactions on Computers, 1987
- On yield, fault distributions, and clustering of particlesIBM Journal of Research and Development, 1986
- A Fault-Tolerant Modular Architecture for Binary TreesIEEE Transactions on Computers, 1986
- Fault Tolerance in Binary Tree ArchitecturesIEEE Transactions on Computers, 1984
- Embedding Tree Structures in VLSI Hexagonal ArraysIEEE Transactions on Computers, 1984
- The Diogenes Approach to Testable Fault-Tolerant Arrays of ProcessorsIEEE Transactions on Computers, 1983
- Introduction to the configurable, highly parallel computerComputer, 1982
- The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSIIEEE Transactions on Computers, 1981