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.
Approximate computing is a promising design paradigm for better performance and power efficiency. In this paper, we propose a power efficient framework for analog approximate computing with the emerging metal-oxide resistive switching random-access memory (RRAM) devices. A programmable RRAM-based approximate computing unit (RRAM-ACU ) is introduced first to accelerate approximated computation, and...
In many application domains, data are represented using large graphs involving millions of vertices and billions of edges. Graph exploration algorithms, such as breadth-first search (BFS), are largely dominated by memory latency and are challenging to process efficiently. In this paper, we present a reconfigurable hardware methodology for efficient parallel processing of large-scale graph exploration...
NVIDIA CUDA and ATI Stream are the two major general-purpose GPU (GPGPU) computing technologies. We implemented RankBoost, a web relevance ranking algorithm, on both NVIDIA CUDA and ATI Stream platforms to accelerate the algorithm and illustrate the differences between these two technologies. It shows that the performances of GPU programs are highly dependent on the utilization of GPU's hardware memory...
In this paper, we propose block-level replacement techniques for content-addressable memories. The CAM array is first divided into row banks and column banks. Then, for each divided array (the overlapped CAM cells of a row bank and a column bank), two redundant row blocks are added and reconfiguration is performed at the block level instead of the conventional word level. According to simulation results,...
We propose a highly scalable image coder based on Zero-blocks and Array structures, called S-EZBA. It achieves not only distortion scalability, resolution scalability, and region of interest (ROI) retrievability, but also much of cost saving. We use a new formation of the final bitstream to realize these properties. Comparing with S-SPECK, S-EZBA omits memory needed on distributing the coding bits...
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.