 | Daniel Etiemble - 1992 - 984 lapas
...computer networks. These algorithms are based on a structured buffer pool. However, with wormhole routing, buffer allocation cannot be restricted, because flits...So, routing must be restricted to avoid deadlock. Daily [6] has proposed a methodology to design static routing algorithms under general assumptions.... | |
 | Kevin Bolding, Lawrence Snyder - 1994 - 317 lapas
...[17, 20, 32]. These algorithms are based on a structured buffer pool. However, with wormhole routing, buffer allocation cannot be restricted, because flits...So, routing must be restricted to avoid deadlock. Dally [9] proposed the necessary and sufficient condition for a deterministic routing algorithm to... | |
| |
These algorithms are based on a structured buffer pool. However, with wormhole routing, buffer allocation cannot be restricted, because flits have no routing information. Once the header of a message has been accepted by a channel, the remaining flits... 