Distributed computing on oriented anonymous hypercubes with faulty components

摘要

We give efficient algorithms for distributed com- putation on oriented, anonymous, asynchronous hypercubes with possible faulty components (I.e. processors and links) and deterministic processors. Initially, the processors know only the size of the network and that they are inter-connected in a hypercube topology.