Research Article
A Framework for Scalable TSV Assignment and Selection in Three-Dimensional Networks-on-Chips
Algorithm 6
Generic algorithm for setting the elevator bits for offline deadlock-freedom.
Input: | LastDirSet (The last directions set of the routing algorithm) | Output: | Elevator[LayerNodes] (Elevator location bits) | for all node do | Initialize Elevator[] to all zeros | end for | for all node of coord do | = List of all elevators | Sort By distance from | | | for alldo | | (11)ifthen | (12)add East to | (13)end if | (14)ifthen | (15)add West to | (16)end if | (17)ifthen | (18)add North to | (19)end if | (20)ifthen | (21)add South to | (22)end if | (23)ifthen | (24)add to | (25)end if | (26)end for | (27)if is empty then | (28) = random elevator from Min | (29)else | (30) = random elevator from | (31)end if | (32) | (33) | (34) | (35) | (36)end for |
|