[BOOK][B] Interconnection networks

J Duato, S Yalamanchili, L Ni - 2002 - books.google.com
The performance of most digital systems today is limited by their communication or
interconnection, not by their logic or memory. As designers strive to make more efficient use …

[BOOK][B] Network-on-chip: the next generation of system-on-chip integration

S Kundu, S Chattopadhyay - 2014 - library.oapen.org
Addresses the Challenges Associated with System-on-Chip Integration Network-on-Chip:
The Next Generation of System-on-Chip Integration examines the current issues restricting …

Internet routing policies and round-trip-times

H Zheng, EK Lua, M Pias, TG Griffin - … PAM 2005, Boston, MA, USA, March …, 2005 - Springer
Round trip times (RTTs) play an important role in Internet measurements. In this paper, we
explore some of the ways in which routing policies impact RTTs. In particular, we investigate …

A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks

J Duato - IEEE Transactions on Parallel and Distributed …, 1996 - ieeexplore.ieee.org
This paper develops the theoretical background for the design of deadlock-free adaptive
routing algorithms for virtual cut-through and store-and-forward switching. This theory is …

On-the-fly adaptive routing in high-radix hierarchical networks

M Garcia, E Vallejo, R Beivide… - 2012 41st …, 2012 - ieeexplore.ieee.org
Dragonfly networks have been recently proposed for the interconnection network of
forthcoming exascale supercomputers. Relying on large-radix routers, they build a topology …

Optimal communication algorithms for hypercubes

DP Bertsekas, C Özveren, GD Stamoulis… - Journal of Parallel and …, 1991 - Elsevier
We consider the following basic communication problems in a hypercube network of
processors: the problem of a single processor sending a different packet to each of the other …

Valuable detours: Least-cost anypath routing

H Dubois-Ferrière, M Grossglauser… - IEEE/ACM Transactions …, 2010 - ieeexplore.ieee.org
In many networks, it is less costly to transmit a packet to any node in a set of neighbors than
to one specific neighbor. This observation was previously exploited by opportunistic routing …

[BOOK][B] Deadlock resolution in computer-integrated systems

MC Zhou, MP Fanti - 2004 - books.google.com
Complex computer-integrated systems offer enormous benefits across a wide array of
applications, including automated production, transportation, concurrent software, and …

[BOOK][B] The handbook of optical communication networks

M Ilyas, HT Mouftah - 2003 - taylorfrancis.com
The Internet revolution. Once, the public was delighted with 14.4 modem access and
fascinated by low-tech Web site content. But not for long. Technology has raced to keep up …

Reconfiguring shortest paths in graphs

K Gajjar, AV Jha, M Kumar, A Lahiri - Algorithmica, 2024 - Springer
Reconfiguring two shortest paths in a graph means modifying one shortest path to the other
by changing one vertex at a time so that all the intermediate paths are also shortest paths …