Sciweavers

7 search results - page 1 / 2
» Generic Methodologies for Deadlock-Free Routing
Sort
View
IPPS
1996
IEEE
13 years 9 months ago
Generic Methodologies for Deadlock-Free Routing
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
Hyunmin Park, Dharma P. Agrawal
NOCS
2009
IEEE
13 years 11 months ago
HiRA: A methodology for deadlock free routing in hierarchical networks on chip
Rickard Holsmark, Shashi Kumar, Maurizio Palesi, A...
DSD
2006
IEEE
159views Hardware» more  DSD 2006»
13 years 11 months ago
Deadlock Free Routing Algorithms for Mesh Topology NoC Systems with Regions
Region concept helps to accommodate cores larger than the tile size in mesh topology NoC architectures. In addition, it offers many new opportunities for NoC design, as well as pr...
Rickard Holsmark, Maurizio Palesi, Shashi Kumar
TON
2008
96views more  TON 2008»
13 years 4 months ago
MICRON: a framework for connection establishment in optical networks
Traffic grooming in optical networks has gained significance due to the prevailing sub-wavelength requirement of end users. Optical networks get upgraded to the latest technology s...
Srinivasan Ramasubramanian, Arun K. Somani
CCS
2009
ACM
14 years 5 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria