CS 551: Distributed Operating Systems
Interconnection Tree


Interconnection Tree

Another interconnection scheme
    connects processors in a tree formation

This tree formation
    may connect any number of processors

Recall the information you learned about trees
    in your Data Structures course
        or your Discrete Structures course
If a tree is of depth d
    and each node may have at most m children
what is the maximum number of nodes in the tree?
    And what is the distance between any two nodes?

Notice that an interconnection tree
    does not need to be a binary tree
In fact, the Connection Machine 5
    used what they called a fat tree

Notice the additional connections
    between children of different nodes



Comments:
Copyright © 2001-2003: Colorado State University for CS 551. All rights reserved.