The Experts below are selected from a list of 5043 Experts worldwide ranked by ideXlab platform
M Nicolaidis - One of the best experts on this subject based on the ideXlab platform.
-
a dynamic sufficient condition of deadlock freedom for high performance fault tolerant routing in Networks on Chips
IEEE Transactions on Emerging Topics in Computing, 2017Co-Authors: Amir Charif, Alexandre Siqueira Guedes Coelho, Nacereddine Zergainoh, M NicolaidisAbstract:Networks-on-Chips (NoCs) are considered to be the paradigm of choice for on-chip communication and are today widely adopted in many-core systems. Many existing routing solutions make use of virtual channels (VCs) to avoid deadlocks while offering enough routing flexibility to avoid faulty and congested areas in a NoC. However, most of the current solutions rely on an overly restrictive, static partitioning of VCs, which results in an underutilization of their throughput enhancement capabilities. To overcome the limitations of such approaches, we introduce a new sufficient condition of deadlock-freedom that greatly relaxes the restrictions imposed by the classic VC-based deadlock-avoidance methods. The strength of our condition lies in the fact that it is imposed on packets at runtime and does not require any partitioning of virtual channels, which makes it possible to fully exploit them to reduce packet blocking and boost performance. Based on this condition, we present a generic, topology-agnostic routing algorithm design methodology that can be used to construct highly flexible routing algorithms in only a few steps. Several examples are presented to showcase the usefulness of our approach for the construction of fault-tolerant routing algorithms, as well as the enhancement and the proof of existing routing algorithms. The implementation of all the required mechanisms in hardware is also described in detail, thereby demonstrating its feasibility in an on-chip environment.
-
MINI-ESPADA: A Low-Cost Fully Adaptive Routing Mechanism for Networks-on-Chips
2017Co-Authors: A. Charif, Nacereddine Zergainoh, A. Coelho, M NicolaidisAbstract:With NoCs (Networks-on-Chips) becoming a central part of today’s many-core systems, ensuring a good level of performance at the routing level has never been so crucial. In previous works, we have introduced a novel method for designing fully adaptive deadlock-free routing algorithms for NoCs called ESPADA (EScape PAths with Dynamic channel Acquisition). The strength of our approach lies in its ability to simultaneously utilize the available virtual channels for throughput enhancement and deadlock-avoidance, thereby enabling high- coverage fault-tolerance at a much higher performance than state-of-the art techniques. In this paper, we further highlight the potentials of this approach and its suitability for low-cost designs, by using it to build MINI-ESPADA, an enhanced version of the popular DyXY algorithm that routes packets following available minimal paths while exploiting the properties of ESPADA to offer higher throughput. In addition to a significant perfo! rmance improvement, we report a negligible area overhead with respects to the classic XY and DyXY when using the same number of virtual channels.
-
a new approach to deadlock free fully adaptive routing for high performance fault tolerant nocs
Defect and Fault Tolerance in VLSI and Nanotechnology Systems, 2016Co-Authors: Amir Charif, Nacereddine Zergainoh, M NicolaidisAbstract:NoCs (Networks-on-Chips) are considered as the paradigm of choice for on-chip communication as they solve the scalability concerns of traditional buses. Many research efforts have been aimed toward the design of adaptive routing algorithms that are flexible enough to avoid congested and defective areas in a NoC. However, to avoid deadlocks, most of these solutions either prohibit some turns, which limits path diversity and reduces fault-tolerance, or restrict the use of some virtual channels, which can enable full adaptiveness at the cost of an underutilization of virtual channels. In this work, we eliminate the trade-off between path diversity and virtual channel utilization by introducing a novel, topology-agnostic, deadlock-free routing algorithm capable of taking full advantage of virtual channels for performance boosting while providing very high fault-tolerance at the same time. Both an intuitive and a formal description of our routing algorithm are presented, and simulation results show the merits of our solution compared to other techniques from the literature.
Giovanni De Micheli - One of the best experts on this subject based on the ideXlab platform.
-
a method to remove deadlocks in Networks on Chips with wormhole flow control
Design Automation and Test in Europe, 2010Co-Authors: Ciprian Seiculescu, Srinivasan Murali, Luca Benini, Giovanni De MicheliAbstract:Networks-on-Chip (NoCs) are a promising interconnect paradigm to address the communication bottleneck of Systems-on-Chip (SoCs). Wormhole flow control is widely used as the transmission protocol in NoCs, as it offers high throughput and low latency. To match the application characteristics, customized irregular topologies and routing functions are used. With wormhole flow control and custom irregular NoC topologies, deadlocks can occur during system operation. Ensuring a deadlock free operation of custom NoCs is a major challenge. In this paper, we address this important issue and present a method to remove deadlocks in application-specific NoCs. Our method can be applied to any NoC topology and routing function, and the potential deadlocks are removed by adding minimal number of virtual or physical channels. Experiments on a variety of realistic benchmarks show that our method results in a large reduction in the number of resources needed (88% on average) and NoC power consumption, area reduction (66% area savings on average) when compared to the state-of-the-art deadlock removal methods.
-
designing application specific Networks on Chips with floorplan information
International Conference on Computer Aided Design, 2006Co-Authors: Srinivasan Murali, Federico Angiolini, David Atienza, Paolo Meloni, Giovanni De Micheli, Luca Benini, Salvatore Carta, Luigi RaffoAbstract:With increasing communication demands of processor and memory cores in systems on Chips (SoCs), scalable Networks on Chips (NoCs) are needed to interconnect the cores. For the use of NoCs to be feasible in today's industrial designs, a custom-tailored, application-specific NoC that satisfies the design objectives and constraints of the targeted application domain is required. In this work, we present a design methodology that automates the synthesis of such application-specific NoC architectures. We present a floorplan aware design method that considers the wiring complexity of the NoC during the topology synthesis process. This leads to detecting timing violations on the NoC links early in the design cycle and to have accurate power estimations of the interconnect. We incorporate mechanisms to prevent deadlocks during routing, which is critical for proper operation of NoCs. We integrate the NoC synthesis method with an existing design flow, automating NoC synthesis, generation, simulation and physical design processes. We also present ways to ensure design convergence across the levels. Experiments on several SoC benchmarks are presented, which show that the synthesized topologies provide a large reduction in network power consumption (2.78 times on average) and improvement in performance (1.59 times on average) over the best mesh and mesh-based custom topologies. An actual layout of a multimedia SoC with the NoC designed using our methodology is presented, which shows that the designed NoC supports the required frequency of operation (close to 900 MHz) without any timing violations. We could design the NoC from input specifications to layout in 4 hours, a process that usually takes several weeks
-
Networks on Chips technology and tools
2006Co-Authors: Giovanni De Micheli, Luca BeniniAbstract:The design of today's semiconductor Chips for various applications, such as telecommunications, poses various challenges due to the complexity of these systems. These highly complex systems-on-Chips demand new approaches to connect and manage the communication between on-chip processing and storage components and Networks on Chips (NoCs) provide a powerful solution. This book is the first to provide a unified overview of NoC technology. It includes in-depth analysis of all the on-chip communication challenges, from physical wiring implementation up to software architecture, and a complete classification of their various Network-on-Chip approaches and solutions.
-
design synthesis and test of Networks on Chips
IEEE Design & Test of Computers, 2005Co-Authors: Partha Pratim Pande, C Grecu, Andre Ivanov, R Saleh, Giovanni De MicheliAbstract:For Networks on Chips to succeed as the next generation of on-chip interconnect, researchers must solve the major problems involved in designing, implementing, verifying, and testing them. This article surveys the latest NoC architectures, methods, and tools and shows what must happen to make NoCs part of a viable future.
-
analysis of error recovery schemes for Networks on Chips
IEEE Design & Test of Computers, 2005Co-Authors: Srinivasan Murali, Luca Benini, Theocharis Theocharides, Narayanan Vijaykrishnan, M J Irwin, Giovanni De MicheliAbstract:In this article, we discuss design constraints to characterize efficient error recovery mechanisms for the NoC design environment. We explore error control mechanisms at the data link and network layers and present the schemes' architectural details. We investigate the energy efficiency, error protection efficiency, and performance impact of various error recovery mechanisms.
Luca Benini - One of the best experts on this subject based on the ideXlab platform.
-
a method for integrating network on chip topologies with 3d ics
IEEE Computer Society Annual Symposium on VLSI, 2011Co-Authors: Pawan M Kumar, Srinivasan Murali, Luca Benini, Anish S Kumar, Kamakoti VeezhinathanAbstract:Three dimensional integration is a promising approach for reducing the form factor of Chips. Scalable Networks on Chips (NoCs) are a necessity to support the communication requirements of such 3D ICs. Mapping of NoC topologies onto the different layers of the 3D stack, while meeting the 3D technology requirements and application power-performance constraints is an important problem. In this paper, we present an algorithm that addresses this issue of performing 3D layer assignment of NoC components. We also integrate the algorithm with an existing NoC interconnect floor planner. Our experiments on many SoC benchmarks show a reduction of 8 - 10% in the NoC power consumption and a 49% reduction in the number of vertical links (and hence, the Through Silicon Vias (TSVs)) when compared to existing approaches.
-
a method to remove deadlocks in Networks on Chips with wormhole flow control
Design Automation and Test in Europe, 2010Co-Authors: Ciprian Seiculescu, Srinivasan Murali, Luca Benini, Giovanni De MicheliAbstract:Networks-on-Chip (NoCs) are a promising interconnect paradigm to address the communication bottleneck of Systems-on-Chip (SoCs). Wormhole flow control is widely used as the transmission protocol in NoCs, as it offers high throughput and low latency. To match the application characteristics, customized irregular topologies and routing functions are used. With wormhole flow control and custom irregular NoC topologies, deadlocks can occur during system operation. Ensuring a deadlock free operation of custom NoCs is a major challenge. In this paper, we address this important issue and present a method to remove deadlocks in application-specific NoCs. Our method can be applied to any NoC topology and routing function, and the potential deadlocks are removed by adding minimal number of virtual or physical channels. Experiments on a variety of realistic benchmarks show that our method results in a large reduction in the number of resources needed (88% on average) and NoC power consumption, area reduction (66% area savings on average) when compared to the state-of-the-art deadlock removal methods.
-
designing application specific Networks on Chips with floorplan information
International Conference on Computer Aided Design, 2006Co-Authors: Srinivasan Murali, Federico Angiolini, David Atienza, Paolo Meloni, Giovanni De Micheli, Luca Benini, Salvatore Carta, Luigi RaffoAbstract:With increasing communication demands of processor and memory cores in systems on Chips (SoCs), scalable Networks on Chips (NoCs) are needed to interconnect the cores. For the use of NoCs to be feasible in today's industrial designs, a custom-tailored, application-specific NoC that satisfies the design objectives and constraints of the targeted application domain is required. In this work, we present a design methodology that automates the synthesis of such application-specific NoC architectures. We present a floorplan aware design method that considers the wiring complexity of the NoC during the topology synthesis process. This leads to detecting timing violations on the NoC links early in the design cycle and to have accurate power estimations of the interconnect. We incorporate mechanisms to prevent deadlocks during routing, which is critical for proper operation of NoCs. We integrate the NoC synthesis method with an existing design flow, automating NoC synthesis, generation, simulation and physical design processes. We also present ways to ensure design convergence across the levels. Experiments on several SoC benchmarks are presented, which show that the synthesized topologies provide a large reduction in network power consumption (2.78 times on average) and improvement in performance (1.59 times on average) over the best mesh and mesh-based custom topologies. An actual layout of a multimedia SoC with the NoC designed using our methodology is presented, which shows that the designed NoC supports the required frequency of operation (close to 900 MHz) without any timing violations. We could design the NoC from input specifications to layout in 4 hours, a process that usually takes several weeks
-
a multi path routing strategy with guaranteed in order packet delivery and fault tolerance for Networks on chip
Design Automation Conference, 2006Co-Authors: Srinivasan Murali, David Atienza, Luca Benini, Giovanni De MichelAbstract:In this work we present a multi-path routing strategy that guaran-tees in-order packet delivery for Networks on Chips (NoCs). We present a design methodology that uses the routing strategy to opti-mally spread the traffic in the NoC to minimize the network band-width needs and power consumption. We also integrate support for tolerance against transient and permanent failures in the NoC links in the methodology by utilizing spatial and temporal redundancy for transporting packets. Our experimental studies show large re-duction in network bandwidth requirements (36.86% on average) and power consumption (30.51% on average) compared to single-path systems. The area overhead of the proposed scheme is small (a modest 5% increase in network area). Hence, it is practical to be used in the on-chip domain.
-
Networks on Chips technology and tools
2006Co-Authors: Giovanni De Micheli, Luca BeniniAbstract:The design of today's semiconductor Chips for various applications, such as telecommunications, poses various challenges due to the complexity of these systems. These highly complex systems-on-Chips demand new approaches to connect and manage the communication between on-chip processing and storage components and Networks on Chips (NoCs) provide a powerful solution. This book is the first to provide a unified overview of NoC technology. It includes in-depth analysis of all the on-chip communication challenges, from physical wiring implementation up to software architecture, and a complete classification of their various Network-on-Chip approaches and solutions.
Srinivasan Murali - One of the best experts on this subject based on the ideXlab platform.
-
a method for integrating network on chip topologies with 3d ics
IEEE Computer Society Annual Symposium on VLSI, 2011Co-Authors: Pawan M Kumar, Srinivasan Murali, Luca Benini, Anish S Kumar, Kamakoti VeezhinathanAbstract:Three dimensional integration is a promising approach for reducing the form factor of Chips. Scalable Networks on Chips (NoCs) are a necessity to support the communication requirements of such 3D ICs. Mapping of NoC topologies onto the different layers of the 3D stack, while meeting the 3D technology requirements and application power-performance constraints is an important problem. In this paper, we present an algorithm that addresses this issue of performing 3D layer assignment of NoC components. We also integrate the algorithm with an existing NoC interconnect floor planner. Our experiments on many SoC benchmarks show a reduction of 8 - 10% in the NoC power consumption and a 49% reduction in the number of vertical links (and hence, the Through Silicon Vias (TSVs)) when compared to existing approaches.
-
a method to remove deadlocks in Networks on Chips with wormhole flow control
Design Automation and Test in Europe, 2010Co-Authors: Ciprian Seiculescu, Srinivasan Murali, Luca Benini, Giovanni De MicheliAbstract:Networks-on-Chip (NoCs) are a promising interconnect paradigm to address the communication bottleneck of Systems-on-Chip (SoCs). Wormhole flow control is widely used as the transmission protocol in NoCs, as it offers high throughput and low latency. To match the application characteristics, customized irregular topologies and routing functions are used. With wormhole flow control and custom irregular NoC topologies, deadlocks can occur during system operation. Ensuring a deadlock free operation of custom NoCs is a major challenge. In this paper, we address this important issue and present a method to remove deadlocks in application-specific NoCs. Our method can be applied to any NoC topology and routing function, and the potential deadlocks are removed by adding minimal number of virtual or physical channels. Experiments on a variety of realistic benchmarks show that our method results in a large reduction in the number of resources needed (88% on average) and NoC power consumption, area reduction (66% area savings on average) when compared to the state-of-the-art deadlock removal methods.
-
designing application specific Networks on Chips with floorplan information
International Conference on Computer Aided Design, 2006Co-Authors: Srinivasan Murali, Federico Angiolini, David Atienza, Paolo Meloni, Giovanni De Micheli, Luca Benini, Salvatore Carta, Luigi RaffoAbstract:With increasing communication demands of processor and memory cores in systems on Chips (SoCs), scalable Networks on Chips (NoCs) are needed to interconnect the cores. For the use of NoCs to be feasible in today's industrial designs, a custom-tailored, application-specific NoC that satisfies the design objectives and constraints of the targeted application domain is required. In this work, we present a design methodology that automates the synthesis of such application-specific NoC architectures. We present a floorplan aware design method that considers the wiring complexity of the NoC during the topology synthesis process. This leads to detecting timing violations on the NoC links early in the design cycle and to have accurate power estimations of the interconnect. We incorporate mechanisms to prevent deadlocks during routing, which is critical for proper operation of NoCs. We integrate the NoC synthesis method with an existing design flow, automating NoC synthesis, generation, simulation and physical design processes. We also present ways to ensure design convergence across the levels. Experiments on several SoC benchmarks are presented, which show that the synthesized topologies provide a large reduction in network power consumption (2.78 times on average) and improvement in performance (1.59 times on average) over the best mesh and mesh-based custom topologies. An actual layout of a multimedia SoC with the NoC designed using our methodology is presented, which shows that the designed NoC supports the required frequency of operation (close to 900 MHz) without any timing violations. We could design the NoC from input specifications to layout in 4 hours, a process that usually takes several weeks
-
a multi path routing strategy with guaranteed in order packet delivery and fault tolerance for Networks on chip
Design Automation Conference, 2006Co-Authors: Srinivasan Murali, David Atienza, Luca Benini, Giovanni De MichelAbstract:In this work we present a multi-path routing strategy that guaran-tees in-order packet delivery for Networks on Chips (NoCs). We present a design methodology that uses the routing strategy to opti-mally spread the traffic in the NoC to minimize the network band-width needs and power consumption. We also integrate support for tolerance against transient and permanent failures in the NoC links in the methodology by utilizing spatial and temporal redundancy for transporting packets. Our experimental studies show large re-duction in network bandwidth requirements (36.86% on average) and power consumption (30.51% on average) compared to single-path systems. The area overhead of the proposed scheme is small (a modest 5% increase in network area). Hence, it is practical to be used in the on-chip domain.
-
analysis of error recovery schemes for Networks on Chips
IEEE Design & Test of Computers, 2005Co-Authors: Srinivasan Murali, Luca Benini, Theocharis Theocharides, Narayanan Vijaykrishnan, M J Irwin, Giovanni De MicheliAbstract:In this article, we discuss design constraints to characterize efficient error recovery mechanisms for the NoC design environment. We explore error control mechanisms at the data link and network layers and present the schemes' architectural details. We investigate the energy efficiency, error protection efficiency, and performance impact of various error recovery mechanisms.
Nacereddine Zergainoh - One of the best experts on this subject based on the ideXlab platform.
-
A soft-error resilient route computation unit for 3D Networks-on-Chips
2018Co-Authors: A. Coelho, Nacereddine Zergainoh, A. Charif, J. Fraire, R. VelazcoAbstract:Three-dimensional Networks-on-Chips (3D-NoCs) have emerged as an alternative to further enhance the performance, functionality, and packaging density of 2D-NoCs. However, the increasing complexity of NoC routers, the continuous miniaturization of silicon technology, the lower operating voltages, and the higher operating frequencies have made the NoC increasingly vulnerable to soft errors. In particular, transient faults occurring in the route computation unit (RCU) can provoke misrouting which may lead to severe effects such as deadlocks or packet loss, corrupting the operation of the entire chip. By combining a reliable fault detection circuit leveraging circuit-level double-sampling, with a cost-effective rerouting mechanism, we develop a full fault-tolerance solution that can efficiently detect and correct such fatal errors before the affected packets leave the router. To validate the proposed solution, we also introduce a novel method for simulation-based fault -injection based on the NoC's gate-level netlist. Experimental results obtained from a partially and vertically connected 3D-NoC indicate that our solution can provide a high level of reliability in the presence of errors, at the expense of an area and power overhead of 4.1% and 6.8% respectively.
-
a dynamic sufficient condition of deadlock freedom for high performance fault tolerant routing in Networks on Chips
IEEE Transactions on Emerging Topics in Computing, 2017Co-Authors: Amir Charif, Alexandre Siqueira Guedes Coelho, Nacereddine Zergainoh, M NicolaidisAbstract:Networks-on-Chips (NoCs) are considered to be the paradigm of choice for on-chip communication and are today widely adopted in many-core systems. Many existing routing solutions make use of virtual channels (VCs) to avoid deadlocks while offering enough routing flexibility to avoid faulty and congested areas in a NoC. However, most of the current solutions rely on an overly restrictive, static partitioning of VCs, which results in an underutilization of their throughput enhancement capabilities. To overcome the limitations of such approaches, we introduce a new sufficient condition of deadlock-freedom that greatly relaxes the restrictions imposed by the classic VC-based deadlock-avoidance methods. The strength of our condition lies in the fact that it is imposed on packets at runtime and does not require any partitioning of virtual channels, which makes it possible to fully exploit them to reduce packet blocking and boost performance. Based on this condition, we present a generic, topology-agnostic routing algorithm design methodology that can be used to construct highly flexible routing algorithms in only a few steps. Several examples are presented to showcase the usefulness of our approach for the construction of fault-tolerant routing algorithms, as well as the enhancement and the proof of existing routing algorithms. The implementation of all the required mechanisms in hardware is also described in detail, thereby demonstrating its feasibility in an on-chip environment.
-
MINI-ESPADA: A Low-Cost Fully Adaptive Routing Mechanism for Networks-on-Chips
2017Co-Authors: A. Charif, Nacereddine Zergainoh, A. Coelho, M NicolaidisAbstract:With NoCs (Networks-on-Chips) becoming a central part of today’s many-core systems, ensuring a good level of performance at the routing level has never been so crucial. In previous works, we have introduced a novel method for designing fully adaptive deadlock-free routing algorithms for NoCs called ESPADA (EScape PAths with Dynamic channel Acquisition). The strength of our approach lies in its ability to simultaneously utilize the available virtual channels for throughput enhancement and deadlock-avoidance, thereby enabling high- coverage fault-tolerance at a much higher performance than state-of-the art techniques. In this paper, we further highlight the potentials of this approach and its suitability for low-cost designs, by using it to build MINI-ESPADA, an enhanced version of the popular DyXY algorithm that routes packets following available minimal paths while exploiting the properties of ESPADA to offer higher throughput. In addition to a significant perfo! rmance improvement, we report a negligible area overhead with respects to the classic XY and DyXY when using the same number of virtual channels.
-
a new approach to deadlock free fully adaptive routing for high performance fault tolerant nocs
Defect and Fault Tolerance in VLSI and Nanotechnology Systems, 2016Co-Authors: Amir Charif, Nacereddine Zergainoh, M NicolaidisAbstract:NoCs (Networks-on-Chips) are considered as the paradigm of choice for on-chip communication as they solve the scalability concerns of traditional buses. Many research efforts have been aimed toward the design of adaptive routing algorithms that are flexible enough to avoid congested and defective areas in a NoC. However, to avoid deadlocks, most of these solutions either prohibit some turns, which limits path diversity and reduces fault-tolerance, or restrict the use of some virtual channels, which can enable full adaptiveness at the cost of an underutilization of virtual channels. In this work, we eliminate the trade-off between path diversity and virtual channel utilization by introducing a novel, topology-agnostic, deadlock-free routing algorithm capable of taking full advantage of virtual channels for performance boosting while providing very high fault-tolerance at the same time. Both an intuitive and a formal description of our routing algorithm are presented, and simulation results show the merits of our solution compared to other techniques from the literature.