A Survey and Evaluation of Topology-Agnostic Deterministic Routing Algorithms

Flich, José; Skeie, Tor; Mejı́a, Andrés; Lysne, Olav; López, Pedro; Robles, Antonio; Duato, J.; Koibuchi, Michihiro; Rokicki, Tom; Sancho, José Carlos

doi:10.1109/tpds.2011.190

Cited by 92 publications

(33 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But as these algorithms are sensitive to topology changes, they may not work if the topology becomes irregular due to a failure. Hence, topology-agnostic routing algorithms, which are not sensitive to any topology changes are used for fault-prone networks [21,22].…”

Section: Methodsmentioning

confidence: 99%

“…Unlike other topology-agnostic routing algorithms such as up*/down* [23], SR routing exploits the regularity of 2D meshes and also performs well under regular as well as irregular topology scenarios [21,22]. However, deadlock-freedom is an essential characteristic of any routing algorithm and to ensure this property each routing algorithm restricts certain turns.…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Resilient routing implementation in 2D mesh NoC

Bishnoi

Laxmi

Gaur

et al. 2016

Microelectronics Reliability

View full text Add to dashboard Cite

With the rapid shrinking of technology and growing integration capacity, the probability of failures in Networks-on-Chip (NoCs) increases and thus, fault tolerance is essential. Moreover, the unpredictable locations of these failures may influence the regularity of the underlying topology, and a regular 2D mesh is likely to become irregular. Thus, for these failure-prone networks, a viable routing framework should comprise a topology-agnostic routing algorithm along with a cost-effective, scalable routing mechanism able to handle failures, irrespective of any particular failure patterns. Existing routing techniques designed to route irregular topologies efficiently lack flexibility (logic-based), scalability (table-based) or relaxed switch design (uLBDR-based). Designing an efficient routing implementation technique to address irregular topologies remains a pressing research problem. To address this, we present a fault resilient routing mechanism for irregular 2D meshes resulting from failures. To handle irregularities, it avoids using routing tables and employs a few fixed configuration bits per switch resulting in a scalable approach. Experiments demonstrate that the proposed approach is guaranteed to tolerate all locations of single and double-link failures and most multiple failures. Also, unlike uLBDR it is not restricted to any particular switching technique and does not replicate any extra messages. Along with fault tolerance, the proposed mechanism can achieve better network performance in fault-free cases. The proposed technique achieves graceful performance degradation during failure. Compared to uLBDR, our method has 14% less area requirements and 16% less overall power consumption.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

Resilient routing implementation in 2D mesh NoC

Bishnoi

Laxmi

Gaur

et al. 2016

Microelectronics Reliability

View full text Add to dashboard Cite

show abstract

“…In this context the topology-agnostic routing algorithms are well studied [16]. The routing computation cost and implementation cost need no longer be considered in arbitrary topologies [17].…”

Section: Network Topologymentioning

confidence: 99%

Optical network technologies for HPC: computer-architects point of view

Koibuchi

Fujiwara

Ishii

et al. 2016

IEICE Electron. Express

Self Cite

View full text Add to dashboard Cite

Optical network technologies, such as circuit switching, wavelength division multiplex and silicon photonics, have been considered for high-performance computing (HPC) systems to achieve low communication latency, high link bandwidth and low power consumption. However, conventional HPC systems still use packet networks with electric switches. Only active optical cables for inter-cabinet long links are borrowed from optical network technologies. This paper firstly reviews the gap between the conventional HPC networks and feasible optical network technologies. We explain our pessimism that this gap will continue to exist by the beginning of the post-Moore era, i.e. 2025-2030. It secondly illustrates our research vision that HPC networks will be able to adopt optical circuit switching, possibly using free-space optics in the post-Moore era.

show abstract

“…A potential scalability issue is the computational cost of path computation for topologyagnostic deadlock-free routing, which is more complex than when routing on structured topologies (see the survey in [16]). However, this computation needs to be performed only when initially deploying the system and after a change in system configuration (e.g.…”

Section: Low-jitter Routingmentioning

confidence: 99%

Extreme Big Data (EBD): Next Generation Big Data Infrastructure Technologies Towards Yottabyte/Year

Matsuoka

Sato

Tatebe

et al. 2014

JSFI

View full text Add to dashboard Cite

Miyoshi 5Our claim is that so-called "Big Data" will evolve into a new era with proliferation of data from multiple sources such as massive numbers of sensors whose resolution is increasing exponentially, high-resolution simulations generating huge data results, as well as evolution of social infrastructures that allow for "opening up of data silos", i.e., data sources being abundant across the world instead of being confined within an institution, much as how scientific data are being handled in the modern era as a common asset openly accessible within and across disciplines. Such a situation would create the need for not only petabytes to zetabytes of capacity and beyond, but also for extreme scale computing power. Our new project, sponsored under the Japanese JST-CREST program is called "Extreme Big Data", and aims to achieve the convergence of extreme supercomputing and big data in order to cope with such explosion of data. The project consists of six teams, three of which deals with defining future EBD convergent SW/HW architecture and system, and the other three the EBD co-design applications that represent different facets of big data, in metagenomics, social simulation, and climate simulation with real-time data assimilation. Although the project is still early in its lifetime, started in Oct. 2013, we have already achieved several notable results, including becoming world #1 on the Green Graph 500, a benchmark to measure the power efficiency of graph processing that appear in typical big data scenarios.

show abstract

A Survey and Evaluation of Topology-Agnostic Deterministic Routing Algorithms

Cited by 92 publications

References 35 publications

Resilient routing implementation in 2D mesh NoC

Resilient routing implementation in 2D mesh NoC

Optical network technologies for HPC: computer-architects point of view

Extreme Big Data (EBD): Next Generation Big Data Infrastructure Technologies Towards Yottabyte/Year

Contact Info

Product

Resources

About