Data Routing : a Paradigm for E cient Data - Path Synthesis andCode
نویسندگان
چکیده
This paper describes a new and eeective approach to register and interconnect optimisation, which is applicable in a dual context : to reduce chip area in high-level synthesis, and to reduce resource load (and thus execution time) in retargetable code generation. The key idea is to carefully optimise the way in which data is transferred between functional units. The impact on high-level synthesis will be demonstrated with a practical design from the area of telecommunications.
منابع مشابه
Design Models and Data - Path Mappingfor Signal Processing Architectures
RT level architecture optimised RT level architecture layout Figure 1.1: Basic phases in the design trajectory. The goal of both tasks is to nd area e cient implementations meeting the stringent constraint on the duration of a single RT machine cycle, assumed during high-level synthesis. Physical design. This task involves the detailed layout generation of the data-paths, memories and controlle...
متن کاملA General Theory for Deadlock Avoidance in Wormhole-Routed Networks
Most machines of the last generation of distributed memory parallel computers possess speci c routers which are used to exchange messages between non-neighboring nodes in the network. Among the several technologies, wormhole routing is usually prefered because it allows low channel-setup time, and reduces the dependency between latency and inter-node distance. However, wormhole routing is very ...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملNew Distributed Multicast Routing and Its Performance Evaluation
With conventional dynamic routing algorithms, many query messages are required in a distributed environment for e cient multicast routing of any tra c volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an e cient multicast tree fo...
متن کاملDraft-lapukhov-segment-routing-large-dc.txt Use-cases for Segment Routing in Large-scale Data Centers Draft-lapukhov-segment-routing-large-dc-00
This document discusses ways in which segment routing (aka source routing) paradigm could be leveraged inside the data-center to improve application performance and network reliability. Specifically, it focuses on exposing path visibility to the host's networking stack and leveraging this to address a few well-known performance and reliability problems in data-center networks.
متن کامل