7 search results - page 1 / 2 » Deadlock prevention by turn prohibition in interconnection n... |
IPPS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
COMCOM
2008
13 years 5 months ago
2008
The issue of breaking cycles in communication networks is an important topic for several reasons. For instance, it is required when transparent bridges are filling the forwarding ...
PE
2008
Springer
13 years 4 months ago
2008
Springer
As the size of parallel computers increases, as well as the number of sources per router node, congestion inside the interconnection network rises significantly. In such systems, ...
CCECE
2006
IEEE
13 years 11 months ago
2006
IEEE
Real Time embedded system designers are facing extreme challenges in underlying architectural design selection. It involves the selection of a programmable, concurrent, heterogene...