Wormhole routing has emerged as the most widely used switching technique in massively
parallel computers. We present a detailed survey of various techniques for enhancing the …

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 …

This paper introduces a router delay model that accurately models key aspects of modern
routers. The model accounts for the pipelined nature of contemporary routers, the specific …

Deadlock avoidance is a key issue in wormhole networks. A first approach by WJ Dally and
CL Seitz (1987) consists of removing the cyclic dependencies between channels. Many …

The past few years have seen a rise in popularity of massively parallel architectures that use
fat-trees as their interconnection networks. In this paper we study the communication …

ROMM is a class of Randomized, Oblivious, Multi-phase, Minimal routing algorithms. ROMM
routing offers a potential for improved performance compared to both fully randomized …

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 …

This article introduces a router delay model that takes into account the pipelined nature of
contemporary routers and proposes pipelines matched to the specific flow control method …

Multiprocessor interconnection networks may reach congestion with high traffic loads, which
prevents reaching the wished performance. Unfortunately, many of the mechanisms …

Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely
been reported in the literature. Although many fully adaptive routing algorithms have been …