Randomness and Robustness in Hypercube Computation

Author(s)
Newman, Mark Joseph
Thumbnail
DownloadMIT-LCS-TR-500.pdf (3.824Mb)
Metadata
Show full item record
Abstract
In this thesis we explore means by which hypercubes can compute despite faulty processors and links. We also study techniques which enable hypercubes to simulate dynamically changing networks and data structures.
Date issued
1991-04
URI
https://hdl.handle.net/1721.1/149703
Series/Report no.
MIT-LCS-TR-500
Collections