The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Placement is the one of the important step in the Field Programmable Gate Array (FPGA) design flow. A successful placement provides complete and optimal routing for the circuit that is to be configured on the FPGA. In this paper an efficient placement algorithm based on Particle Swarm Optimization (PSO), PSO_Placer, is proposed. The proposed PSO based Placement algorithm focuses on minimizing the...
We have solved a problem of finding the shortest node-disjoint pair of paths that can share resilient arcs. It is assumed that a network consists of a set of nodes and a set of arcs. Moreover, a number of available arcs are resilient. Our goal is to find the shortest pair of paths such that they share only those nodes that are incident to shared resilient arcs. Furthermore, we assume that the resulting...
In this paper a BISR architecture for embedded memories is presented. The proposed scheme utilises a multiple bank cache-like memory for repairs. Statistical analysis is used for minimisation of the total resources required to achieve a very high fault coverage. Simulation results show that the proposed BISR scheme is characterised by high efficiency and low area overhead, even for high defect densities...
In this article, we propose a general-purpose disaster support system based on generalized (multiplicatively-weighted order-k Minkowski-metric) Voronoi diagrams. The proposed system is capable of handling disasters (or emergency units) having different weights in the complete order from 1 to k in the three popular Minkowski metrics (Euclidean, Manhattan and Maximum distance space). The proposed model...
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging...
In this paper, we introduce a pricing model that ensures efficient resource allocation that provides guaranteed quality of service while maximizing profit in multiservice networks. Specifically, a dynamic allocation policy is examined that relies on online measurements while each service class operates under a probabilistic bound delay constraint. We present a rigorous analysis of the properties of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.