Search results for "Electronic Design Automation"
showing 10 items of 118 documents
Models and solution methods for the uncapacitatedr-allocationp-hub equitable center problem
2017
Hub networks are commonly used in telecommunications and logistics to connect origins to destinations in situations where a direct connection between each origin–destination (o-d) pair is impractical or too costly. Hubs serve as switching points to consolidate and route traffic in order to realize economies of scale. The main decisions associated with hub-network problems include (1) determining the number of hubs (p), (2) selecting the p-nodes in the network that will serve as hubs, (3) allocating non-hub nodes (terminals) to up to r-hubs, and (4) routing the pairwise o-d traffic. Typically, hub location problems include all four decisions while hub allocation problems assume that the valu…
Backoff Hardware Architecture for Inter-FPGA Traffic Management
2017
International audience; Multi-FPGA platforms are considered to be the mostappropriate experimental way to emulate a large Multi-ProcessorSystem-on-Chip based on a Network-on-Chip. However, theuse of a Network-on-Chip in several FPGAs requires inter-FPGA communication links to replace intra-FPGA links betweenrouters. As the ratio of the logic capacity to the number of IOsonly increases slowly with each generation of FPGA, IOs inFPGA are becoming a scare resource. And as there are morerouters than IOs, using a Network-on-Chip requires sharinginter-FPGA links between routers, and sharing an external linkcan lead to bottlenecks. Here, we evaluate the inter-FPGA trafficmanagement using a backoff…
Evaluation of routing policies using an interval-valued TOPSIS approach for the allocation rules
2021
Abstract The success of warehouse management in a supply chain widely depends on an efficient and effective retrieve of customer orders, which is known as the picking process. This paper investigates various routing policies of pickers under two different allocation methods of items in a warehouse of fixed layout, and evaluates their performance in terms of the resulting travel distance by means of a simulation approach. The allocation strategies taken into account are the random storage and a multi-criteria approach, called Interval-Value TOPSIS (IV-T), which is expressively proposed in this paper as a new way to solve the storage allocation problem of items in a warehouse. Because of the …
Contributions to the analysis and design of all-inductive filters with dielectric resonators
2003
In this work, three modern full-wave methods will be employed for the accurate analysis and efficient design of a novel family of all-inductive filters loaded with dielectric resonators. These techniques are the bi-orthonormal-basis combined with the orthonormal-basis method, the hybrid mode-matching/spectral method, and, finally, the BI-RME (Boundary Integral-Resonant Mode Expansion) method. Then, two prototypes of band-pass filters have been designed in this work using a CAD tool developed in the research groups implicated in this manuscript. The procedure described in this paper only involves a limited number of actual physical parameters at each step so that it is computationally very e…
An Adaptive Routing Mechanism for Efficient Resource Discovery in Unstructured P2P Networks
2005
The widespread adoption of large-scale decentralized peer-to-peer (P2P) systems imposes huge challenges on distributed search and routing. Decentralized and unstructured P2P networks are very attractive because they require neither centralized directories, nor precise control over network topology or data placement. However their search mechanisms are extremely unscalable, generating large loads on the network participants. In this paper, to address this major limitation, we propose and evaluate the adoption of an innovative algorithm for routing user queries. The proposed approach aims at dynamically adapting the network topology to peer interests, on the basis of query interactions among …
A Novel Fault-Tolerant Routing Technique for Mesh-of-Tree based Network-on-Chip Design
2018
Due to the increase in the number of processing elements in System-on-Chips (SoCs), communication between the cores is becoming complex. A solution to this issue in SoCs gave rise to a new paradigm called Network-on-Chips (NoCs). In NoCs, communication between different cores is achieved using packet based switching techniques. In the deep sub-micron technology, NoCs are more susceptible to different kinds of faults which can be transient, intermittent and permanent. These faults can occur at any component of NoCs. This paper presents a novel Fault-Tolerant Routing (FTR) technique for Mesh-of-Tree (MoT) topology in the presence of router faults. The proposed technique is compared with routi…
Fault Tolerant Routing Methodology for Mesh-of-Tree based Network-on-Chips using Local Reconfiguration
2018
Increase in the processing elements in a System-on- Chip (SoC) has led to an increasing complexity between the cores in the entire network. This communication bottleneck led to rise in the new paradigm called Network-on-Chip (NoC). These NoC are very much susceptible to various types of faults which can be transient, intermittent or permanent. This paper presents a fault-tolerant routing technique which can route the packets from a source to a destination in presence of permanent faults in the leaf routers of Mesh-of-Tree topology where cores are connected. This is achieved by using reconfiguration in the local ports of the leaf routers by inserting multiplexers as a layer between the leaf …
A self-routing protocol for distributed consensus on logical information
2010
In this paper, we address decision making problems, depending on a set of input events, with networks of dynamic agents that have partial visibility of such events. Previous work by the authors proposed so-called logical consensus approach, by which a network of agents, that can exchange binary values representing their local estimates of the events, is able to reach a unique and consistent decision. The approach therein proposed is based on the construction of an iterative map, whose computation is centralized and guaranteed under suitable conditions on the input visibility and graph connectivity. Under the same conditions, we extend the approach in this work by allowing the construction o…
I-RP: Interference Aware Routing Protocol for WBAN
2018
The Wireless Body Sensor Networks (WBSN) have witnessed tremendous research interest because of their wide range of applications (medical and non-medical) in order to improve the quality of life. The healthcare applications of WBSN demands dissemination of patient’s data, reliably and in a timely manner. For this purpose, medical teams may use real-time applications for disseminating critical data such as blood pressure, ECG, and EEG. The critical data packets are highly delay sensitive that must reach intended destination within time constraints. Due to the exchange of real-time and multi-media data, some nodes or links may experience the significant level of interference in the network. C…
RBCR: a Relay-Based Cooperative Routing Protocol for Cooperative Wireless Sensor Network
2011
International audience; In wireless sensor networks several constraints decrease communications performances. The main objective of this paper is to present a multi-objective routing algorithm RBCR that computes routing path based on the energy consumption and channel qualities. Additionally, the channel qualities are evaluated based on the presence of relay nodes. Compared to AODV and AODV associated to a cooperative MAC protocol, RBCR provides better performances.