Meklēšana Attēli Maps YouTube Ziņas Gmail Disks Kalendārs Vēl »
Ieiet
Grāmatas Grāmatas
" 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... "
Interconnection Networks and Mapping and Scheduling Parallel Computations ... - 88. lappuse
laboja - 1995 - 342 lapas
Ierobežota priekšskatīšana - Par šo grāmatu

PARLE '92, Parallel Architectures and Languages Europe: 4th International ...

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....
Ierobežota priekšskatīšana - Par šo grāmatu

Parallel Computer Routing and Communication: First International Workshop ...

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...
Ierobežota priekšskatīšana - Par šo grāmatu




  1. Mana bibliotēka
  2. Palīdzība
  3. Izvērstā grāmatu meklēšana