Listar Arquitectura de Computadores - (AC) por fecha de publicación
Mostrando ítems 21-40 de 205
-
Low-textured regions detection for improving stereoscopy algorithms
(2014-07-29)The main goal of stereoscopy algorithms is the calculation of the disparity map between two frames corresponding to the same scene, and captured simultaneously by two different cameras. The different position (disparity) ... -
Adaptive Partition Strategies for Loop Parallelism in Heterogeneous Architectures
(2014-07-30)This paper explores the possibility of efficiently using multicores in conjunction with multiple GPU accelerators under a parallel task programming paradigm. In particular, we address the challenge of extending a ... -
Paralelismo de datos en la obtención de Tablas de Control de Tráfico con información de llegada
(2014-09-24)Los semáforos se pueden controlar de forma dinámica a través de varias reglas que dictaminan el color del semáforo segun el número de vehículos a la espera. Estas reglas o acciones se recogen en lo que se conoce como ... -
Localizando partículas en un fluido a partir de holografías y computación de altas prestaciones
(2014-09-24)La tomografía se ha introducido recientemente en la velocimetría de fluidos para proporcionar información en tres dimensiones de la localización de partículas en el seno de fluidos. En concreto, algunos trabajos previos ... -
On the parallelization of a three-parametric log-logistic estimation algorithm
(2014-09-25)Networked telerobots transmit data from its sensors to the remote controller. To provide guarantees on the time requirements of these systems it is mandatory to keep the transmission time delays below a given threshold, ... -
CUVLE: Variable-Length Encoding on CUDA
(2014-10-14)Data compression is the process of representing information in a compact form, in order to reduce the storage requirements and, hence, communication bandwidth. It has been one of the critical enabling technologies for ... -
Scalability Analysis of Signatures in Transactional Memory Systems
(2014-10-29)Signatures have been proposed in transactional memory systems to represent read and write sets and to decouple transaction conflict detection from private caches or to accelerate it. Generally, signatures are implemented ... -
Optimizing DSP Circuits by a New Family of Arithmetic Operators
(2014-11-19)A new family of arithmetic operators to optimize the implementation of circuits for digital signal processing is presented. Thanks to use of a new technique which reduces the quantification errors, the proposed operators ... -
Clasificación Tisular en GPU: aceleración y optimizaciones
(Servicio de Publicaciones y Divulgación Científica, 2015)Desde hace una década, los procesadores gráficos o GPUs vienen ganando protagonismo en la computación de altas prestaciones, contribuyendo a la aceleración de miles de aplicaciones en multitud de áreas de la ciencia. Pero ... -
Reducing overheads of dynamic scheduling on heterogeneous chips
(arXiv.org (Cornell University Library), 2015-01-19)In recent processor development, we have witnessed the integration of GPU and CPUs into a single chip. The result of this integration is a reduction of the data communication overheads. This enables an efficient collaboration ... -
Runtime Aware Architectures; Barcelona Supercomputing Center at a glance
(2015-03-05)In the last few years, the traditional ways to keep the increase of hardware performance to the rate predicted by the Moore's Law have vanished. When uni-cores were the norm, hardware design was decoupled from the software ... -
Siting Multiple Observers for Maximum Coverage: An Accurate Approach
(2015-06-05)The selection of the minimal number of observers that ensures the maximum visual coverage over an area represented by a digital elevation model (DEM) have great interest in many elds, e.g., telecommunications, environment ... -
Improving Transactional Memory Performance for Irregular Applications
(2015-06-11)Transactional memory (TM) offers optimistic concurrency support in modern multicore archi- tectures, helping the programmers to extract parallelism in irregular applications when data dependence information is not available ... -
Robust tracking for augmented reality
(2015-06-17)In this paper a method for improving a tracking algorithm in an augmented reality application is presented. This method addresses several issues to this particular application, like marker-less tracking and color constancy ... -
Control y mejora de la coordinación entre asignaturas de una titulación universitaria
(2015-06-17)Entre las múltiples exigencias que impone el EEES, la mejora de la coordinación entre las asignaturas de una titulación es una de las que más preocupan, y se ha convertido en uno de los temas de debate más vivos en ... -
Hardware support for Local Memory Transactions on GPU Architectures
(2015-06-26)Graphics Processing Units (GPUs) are popular hardware accelerators for data-parallel applications, enabling the execution of thousands of threads in a Single Instruction - Multiple Thread (SIMT) fashion. However, the SIMT ... -
Simplified Floating-Point Units for High Dynamic Range Image and Video Systems
(2015-06-29)The upcoming arrival of high dynamic range image and video applications to consumer electronics will force the utilization of floating-point numbers on them. This paper shows that introducing a slight modification on ... -
Improving Fixed-Point Implementation of QR Decomposition by Rounding-to-Nearest
(2015-06-29)QR decomposition is a key operation in many current communication systems. This paper shows how to reduce the area of a fixed-point QR decomposition implementation based on Givens rotations by using a new number ... -
Generating order policies by SDP: non-stationary demand and service level constraints
(2015-07-06)Inventory control implies dynamic decision making. Therefore, dynamic programming seems an appropriate approach to look for order policies. For finite horizon planning, the implementation of service level constraints ... -
Heuristics for Longest Edge Selection in Simplicial Branch and Bound
(2015-07-06)Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative re nement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. ...