Meklēšana Attēli Maps YouTube Ziņas Gmail Disks Kalendārs Vēl »
Ieiet
Grāmatas Grāmatas
" However, deadlocks may appear if the routing algorithms are not carefully designed. A deadlock in the interconnection network of a multicomputer occurs when no message can advance toward its destination because the queues of the message system are full.... "
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
...multicomputers, the network latency is dominated by the second term for all but very short messages. Deadlocks may appear if the routing algorithms are...advance toward its destination because the queues ofthe message system are full. The size of the queues strongly influences the probability of reaching...
Ierobežota priekšskatīšana - Par šo grāmatu

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

Kevin Bolding, Lawrence Snyder - 1994 - 317 lapas
...technique makes the message latency largely insensitive to the distance in the message-passing network. Deadlocks may appear if the routing algorithms are...because the queues of the message system are full. Many deadlock-free routing algorithms have been developed for store-and-forward computer networks [17,...
Ierobežota priekšskatīšana - Par šo grāmatu

Communication and Architectural Support for Network-Based ..., 1. sējums

Dhabaleswar K. Panda, Tex.) Canpc'9 1997 (San Antonio, Craig B. Stunkel - 1997 - 268 lapas
...increasing node delay [6]. An alternative approach consists of using adaptive routing [18]. However, deadlocks may appear if the routing algorithms are not carefully designed. A deadlock occurs in an interconnection network when no message is able to advance toward its destination because...
Ierobežota priekšskatīšana - Par šo grāmatu

Scientific and Technical Aerospace Reports

...communication. Furthermore routing algorithms may avoid deadlock situations and starvation. Deadlock occurs when no message can advance toward its destination...because the queues of the message system are full. ESA N91-18683# Universiteit Twente, Enschede (Netherlands). Dept. of Computer Science. STATIC ALLOCATION...
Pilnskats - Par šo grāmatu




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