Randomness and Robustness in Hypercube Computation

Thumbnail Image
Download
Name

MIT-LCS-TR-500.pdf

Size

3.82 MB

Format

Adobe PDF

Checksum (MD5)

95fcc539a8bdd701f672261e6598e1f3

Author(s)
Newman, Mark Joseph
Date Issued
April 1991
Series/Report no.
MIT-LCS-TR-500
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.