| Presentation | 1999/8/5 The Ψ-Cubes for Multilevel Snoopy Caches Masaru Takesue, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper proposes a Ψ-cube network that consists of low-height trees of buses (where the parent and children are connected by a bus) desirable for the coherence directories of multilevel snoopy caches. Since the Ψ-cube is organized based on a recurrence of the hamming codes, it has recursive levels each of bused fat-hypercubes, named Ψ-cubes. A Ψ-cube is composed of the clusters that are produced by partitioning the nodes with multiple su ts of codewords of a Hamming code. Thus every node is the center(i.e., representative)node of a unicue cluster, while its other nodes have addresses equal to single-bit or detectable double-bit error words of the center node's address. The nodes in a cluster are connected to a bus owned by the center node of the cluster, so that the Ψ-cube configures trees of buses that has the height determined by the recurrence. In the paper, the properties of Hamming codes exploited in the partitioning, and the structure and properties of the Ψ-cube are presented. The routing method in the Ψ-cube and an outline of the tree-type directories for multilevel snoopy caches are also described. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Trees of buses / fat hypercubes / recursive clustering / Hamming codes / multilevel cache protocols |
| Paper # | CPSY99-71 |
| Date of Issue |
| Conference Information | |
| Committee | CPSY |
|---|---|
| Conference Date | 1999/8/5(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Computer Systems (CPSY) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | The Ψ-Cubes for Multilevel Snoopy Caches |
| Sub Title (in English) | |
| Keyword(1) | Trees of buses |
| Keyword(2) | fat hypercubes |
| Keyword(3) | recursive clustering |
| Keyword(4) | Hamming codes |
| Keyword(5) | multilevel cache protocols |
| 1st Author's Name | Masaru Takesue |
| 1st Author's Affiliation | Dept.Electronics and Information Engr.,Hosei University() |
| Date | 1999/8/5 |
| Paper # | CPSY99-71 |
| Volume (vol) | vol.99 |
| Number (no) | 252 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |