H-tree
A special tree in graph theory is called an H-tree . This is the embedding of a binary tree in a rectangular grid - root in the middle - so that tree and subtrees the shape of the capital letter H show. Each node can again be the center of an H.
The H-tree is a FASS curve ; that is, it fills the whole level. Its fractal Hausdorff dimension is 2. With each new iteration, the total length of the curve is multiplied by .
H-trees play a role in the design of synchronous digital circuits for signal distribution. In those circuits, the transmission of the centrally fed clock signals to all circuit parts on the chip is ensured with identical transmission times via H-trees .
Another example of the use of H-trees is the mapping of the communication structure of a program onto the processors in a computer cluster .
Web links
- H fractal in the tungsten demonstration project