Meklēšana Attēli Maps YouTube Ziņas Gmail Disks Kalendārs Vēl »
Ieiet
Grāmatas Grāmatas
" Dally [9] has proposed a methodology to design static routing algorithms under general assumptions. He defines a channel dependency graph and establishes a total order among channels. Routing is restricted to visit channels in decreasing or increasing... "
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
...routing algorithms under general assumptions. He defines a channel dependency graph and establishes a total order among channels. Routing is restricted to visit channels in decreasing or increasing order to eliminate cycles in the channel dependency graph. This methodology has been...
Ierobežota priekšskatīšana - Par šo grāmatu

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

Kevin Bolding, Lawrence Snyder - 1994 - 317 lapas
...to be deadlock-free. Based on this condition, he defined a channel dependency graph and established a total order among channels. Routing is restricted...virtual channels to connect the network again. This technique has been applied to the design of routing chips for multicomputers [8], multicomputer nodes...
Ierobežota priekšskatīšana - Par šo grāmatu

Proceedings of the 1995 International Conference on Parallel ..., 3. sējums

Kyle Gallivan - 1995 - 256 lapas
...corresponding to cycles are split into a group of virtual channels, the virtual channels are ordered, and routing is restricted to visit channels in decreasing...eliminate cycles in the channel dependency graph. An adaptive, minimal routing algorithm has been presented in [9]. This algorithm has the drawback that...
Ierobežota priekšskatīšana - Par šo grāmatu




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