0000000000005292
AUTHOR
Rafael Tornero
showing 6 related works from this author
Improving topological mapping on NoCs
2010
Networks-on-Chip (NoCs) have been proposed as an efficient solution to the complex communications on System-on-chip (SoCs). The design flow of network-on-chip (NoCs) include several key issues, and one of them is the decision of where cores have to be topologically mapped. This thesis proposes a new approach to the topological mapping strategy for NoCs. Concretely, we propose a new topological mapping technique for regular and irregular NoC platforms and its application for optimizing application specific NoC based on distributed and source routing.
A multi-agent system for obtaining dynamic origin/destination matrices on intelligent road networks
2012
Dynamic Origin/Destination matrices are one of the most important parameters for efficient and effective transportation system management. These matrices describe the vehicle flow between different points inside a region of interest for a given period of time. Usually, dynamic O/D matrices are estimated from link traffic counts, home interview and/or license plate surveys. Unfortunately, estimation methods take O/D flows as time invariant for a certain number of intervals of time, which cannot be suitable for some traffic applications. However, the advent of information and communication technologies (e.g., vehicle-to-infrastructure dedicated short range communications — V2I) to the transpo…
A multi-objective strategy for concurrent mapping and routing in networks on chip
2009
The design flow of network-on-chip (NoCs) include several key issues. Among other parameters, the decision of where cores have to be topologically mapped and also the routing algorithm represent two highly correlated design problems that must be carefully solved for any given application in order to optimize several different performance metrics. The strong correlation between the different parameters often makes that the optimization of a given performance metric has a negative effect on a different performance metric. In this paper we propose a new strategy that simultaneously refines the mapping and the routing function to determine the Pareto optimal configurations which optimize averag…
Distance Constrained Mapping to Support NoC Platforms Based on Source Routing
2010
Efficient NoC is crucial for communication among processing elements in a highly parallel processing systems on chip. Mapping cores to slots in a NoC platform and designing efficient routing algorithms are two key problems in NoC design. Source routing offers major advantages over distributed routing especially for regular topology NoC platforms. But it suffers from a serious drawback of overhead since it requires whole communication path to be stored in every packet header. In this paper, we present a core mapping technique which helps to achieve a mapping with the constraint over the path length. We have found that the path length constraint of just 50% is sufficient in most cases. We als…
A Communication-Aware Topological Mapping Technique for NoCs
2008
Networks---on---Chip (NoCs) have been proposed as a promising solution to the complex on-chip communication problems derived from the increasing number of processor cores. The design of NoCs involves several key issues, being the topological mapping (the mapping of the Intellectual Properties (IPs) to network nodes) one of them. Several proposals have been focused on topological mapping last years, but they require the experimental validation of each mapping considered. In this paper, we propose a communication-aware topological mapping technique for NoCs. This technique is based on the experimental correlation of the network model with the actual network performance, thus avoiding the need…
Computing Real-Time Dynamic Origin/Destination Matrices from Vehicle-to-Infrastructure Messages Using a Multi-Agent System
2012
Dynamic Origin/Destination matrices are one of the most important parameters for efficient and effective transportation system management. These matrices describe the vehicle flow between different points within a region of interest for a given period of time. Usually, dynamic O/D matrices are estimated from traffic counts provided by induction loop detectors, home interview and/or license plate surveys. Unfortunately, estimation methods take O/D flows as time invariant for a certain number of intervals of time, which cannot be suitable for some traffic applications. However, the advent of information and communication technologies (e.g., vehicle-to-infrastructure dedicated short range comm…