Ψ-cubes: recursive bused fat-hypercubes for multilevel snoopy caches
Masaru Takesue · 2003
The paper proposes a /spl Psi/-cube network that consists of low-height trees of buses desirable for the coherence directories of multilevel snoopy caches. Since the /spl Psi/-cube is organized based on a recurrence of the Hamming codes, it has recursive levels, each of bused fat-hypercubes, named /spl psi/-cubes. A /spl psi/-cube is composed of the clusters that are produced by partitioning the nodes with multiple suits of codewords of a Hamming code. Thus every node is the representative node of a unique cluster, while its other nodes have addresses equal to single-bit or detectable double-bit error words of the node's address. The nodes are connected to a bus in the cluster, so that the /spl Psi/-cube configures trees of buses that has the height determined by the recurrence.