The Experts below are selected from a list of 23454 Experts worldwide ranked by ideXlab platform
Radu Marculescu - One of the best experts on this subject based on the ideXlab platform.
-
Energy- And performance-aware mapping for regular NoC architectures
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2005Co-Authors: Jingcao Hu, Radu MarculescuAbstract:In this paper, we present an algorithm which automatically maps a given set of intellectual property onto a generic regular network-on-chip (NoC) architecture and constructs a deadlock-free deterministic Routing Function such that the total communication energy is minimized. At the same time, the performance of the resulting communication system is guaranteed to satisfy the specified design constraints through bandwidth reservation. As the main theoretical contribution, we first formulate the problem of energy- and performance-aware mapping in a topological sense, and show how the Routing flexibility can be exploited to expand the solution space and improve the solution quality. An efficient branch-and-bound algorithm is then proposed to solve this problem. Experimental results show that the proposed algorithm is very fast, and significant communication energy savings can be achieved. For instance, for a complex video/audio application, 51.7% communication energy savings have been observed, on average, compared to an ad hoc implementation.
-
exploiting the Routing flexibility for energy performance aware mapping of regular noc architectures
Design Automation and Test in Europe, 2003Co-Authors: Jingcao Hu, Radu MarculescuAbstract:In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic Routing Function such that the total communication energy is minimized. At the same time, the performance of the resulting communication system is guaranteed to satisfy the specified constraints through bandwidth reservation. As the main contribution, we first formulate the problem of energy/performance aware mapping, in a topological sense, and show how the Routing flexibility can be exploited to expand the solution space and improve the solution quality. An efficient branch-and-bound algorithm is then described to solve this problem. Experimental results show that the proposed algorithm is very fast, and significant energy savings can be achieved. For instance, for a complex video/audio application, 51.7% energy savings have been observed, on average, compared to an ad-hoc implementation.
Jingcao Hu - One of the best experts on this subject based on the ideXlab platform.
-
Energy- And performance-aware mapping for regular NoC architectures
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2005Co-Authors: Jingcao Hu, Radu MarculescuAbstract:In this paper, we present an algorithm which automatically maps a given set of intellectual property onto a generic regular network-on-chip (NoC) architecture and constructs a deadlock-free deterministic Routing Function such that the total communication energy is minimized. At the same time, the performance of the resulting communication system is guaranteed to satisfy the specified design constraints through bandwidth reservation. As the main theoretical contribution, we first formulate the problem of energy- and performance-aware mapping in a topological sense, and show how the Routing flexibility can be exploited to expand the solution space and improve the solution quality. An efficient branch-and-bound algorithm is then proposed to solve this problem. Experimental results show that the proposed algorithm is very fast, and significant communication energy savings can be achieved. For instance, for a complex video/audio application, 51.7% communication energy savings have been observed, on average, compared to an ad hoc implementation.
-
exploiting the Routing flexibility for energy performance aware mapping of regular noc architectures
Design Automation and Test in Europe, 2003Co-Authors: Jingcao Hu, Radu MarculescuAbstract:In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic Routing Function such that the total communication energy is minimized. At the same time, the performance of the resulting communication system is guaranteed to satisfy the specified constraints through bandwidth reservation. As the main contribution, we first formulate the problem of energy/performance aware mapping, in a topological sense, and show how the Routing flexibility can be exploited to expand the solution space and improve the solution quality. An efficient branch-and-bound algorithm is then described to solve this problem. Experimental results show that the proposed algorithm is very fast, and significant energy savings can be achieved. For instance, for a complex video/audio application, 51.7% energy savings have been observed, on average, compared to an ad-hoc implementation.
Shinichi Kuribayashi - One of the best experts on this subject based on the ideXlab platform.
-
allocation of virtual firewall Functions in nfv based networks with minimum network cost
International Journal of Computer Networks & Communications, 2019Co-Authors: Shinichi KuribayashiAbstract:NFV-based network implements a variety of network Functions with software on general-purpose servers and this allows the network operator to select any capacity and location of network Functions without any physical constraints. It is essential for economical NFV-based network design to determine the place where each network Function should be located in the network and what its capacity should be. The authors proposed an algorithm of virtual Routing Function allocation in the NFV-based network for minimizing the network cost and provided effective allocation guidelines for virtual Routing Functions. This paper proposes the deployment algorithm of virtual firewall Function in addition to virtual Routing Function for minimizing the network cost. Our evaluation results have revealed the following: (1) Installing a packet filtering Function, which is a part of the firewall Function, in the sending-side area additionally can reduce wasteful transit bandwidth and Routing processing and thereby reduce the network cost. (2) The greater the number of packets filtered by packet filtering Function in the sending-side area, the more the reduction of network cost is increased. (3) The greater the bandwidth cost relative to the Routing Function cost, the greater the effect of statistical multiplexing on reducing the network cost. (4) The proposed algorithm would be approaching about 95% of the deployment with the optimal solution.
-
joint deployment of virtual Routing Function and virtual firewall Function in nfv based network with minimum network cost
Network-Based Information Systems, 2018Co-Authors: Kenichiro Hida, Shinichi KuribayashiAbstract:It is essential for economical NFV-based network design to determine the place where each network Function should be located in the network and what its capacity should be. The authors proposed an algorithm of virtual Routing Function allocation in the NFV-based network for minimizing the network cost, and provided effective allocation guidelines for virtual Routing Functions. This paper proposes the joint deployment algorithm of virtual Routing Function and virtual firewall Function for minimizing the network cost. Our evaluation results have revealed the following: (1) Installing a packet filtering Function, which is a part of the firewall Function, in the sending-side area additionally can reduce wasteful transit bandwidth and Routing processing and thereby reduce the network cost. (2) The greater the number of packets filtered by packet filtering Function in the sending-side area, the more the reduction of network cost is increased. (3) The proposed algorithm would be approaching about 95% of the deployment with the optimal solution.
Pierre Fraigniaud - One of the best experts on this subject based on the ideXlab platform.
-
a general theory for deadlock avoidance in wormhole routed networks
IEEE Transactions on Parallel and Distributed Systems, 1998Co-Authors: Eric Fleury, Pierre FraigniaudAbstract:Most machines of the last generation of distributed memory parallel computers possess specific routers which are used to exchange messages between nonneighboring nodes in the network. Among the several technologies, wormhole Routing is usually preferred because it allows low channel-setup time and reduces the dependency between latency and internode distance. However, wormhole Routing is very susceptible to deadlock because messages are allowed to hold many resources while requesting others. Therefore, designing deadlock-free Routing algorithms using few hardware facilities is a major problem for wormhole-routed networks. In this paper, we describe a general theoretical framework for the study of deadlock-free Routing Functions. We give a general definition of what can be a Routing Function. This definition captures many specific definitions of the literature (e.g., vertex dependent, input-dependent, source-dependent, path-dependent etc.). Using our definition, we give a necessary and sufficient condition which characterizes deadlock-free Routing Functions. Our theory embraces, at a high level, most of the theories related to deadlock avoidance in wormhole-routed networks previously derived in the literature. In particular, it applies not only to one-to-one Routing, but also to one-to-many Routing. The latter paradigm is used to solve the multicast problem with the path-based or tree-based facility.
K. Oguchi - One of the best experts on this subject based on the ideXlab platform.
-
design and verification of wavelength Routing Function in wdm networks using wavelength transfer matrix approach
Proceedings of SPIE, 2005Co-Authors: K Okada, K. OguchiAbstract:The wavelength transfer matrix is a powerful approach to designing and verifying the wavelength Routing needed for complicated WDM networks 1 . This paper first describes the wavelength transfer matrix, its basic form and some extensions. A full-mesh WDM PON system that can directly connect ONUs and an OLT is proposed and analyzed in terms of wavelength by using the wavelength transfer matrix method.
-
effective verification of wavelength Routing Function by wavelength transfer matrix method
IEEE Region 10 Conference, 2005Co-Authors: K. Oguchi, K OkadaAbstract:The wavelength transfer matrix is a powerful approach to design and verify the wavelength Routing needed for complicated wavelength Routing networks. This paper first describes the wavelength transfer matrix, the basic form and some extensions. The WDM PON networks proposed to date are analyzed in terms of wavelength by using the wavelength transfer matrix. The results show the method is effective and practical for designing complicated networks.
