Sciweavers

143 search results - page 12 / 29
» A Reconfigurable Content Addressable Memory
Sort
View
WDAG
2005
Springer
104views Algorithms» more  WDAG 2005»
15 years 3 months ago
Polymorphic Contention Management
Abstract. In software transactional memory (STM) systems, a contention manager resolves conflicts among transactions accessing the same memory locations. Whereas atomicity and ser...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
GLOBECOM
2007
IEEE
15 years 4 months ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...
79
Voted
RECONFIG
2008
IEEE
140views VLSI» more  RECONFIG 2008»
15 years 4 months ago
Generalised Parallel Bilinear Interpolation Architecture for Vision Systems
Bilinear interpolation is widely used in computer vision for extracting pixel values for positions that lie off the pixel grid in an image. For each sub-pixel, the values of four ...
Suhaib A. Fahmy
CIIA
2009
14 years 10 months ago
Sharing and Protecting Networked Digital Life Memories
The increasing power of computers, increasing capacity of digital memory and wider availability of a great variety of input devices such as cameras and video recorders, has resulte...
Madjid Merabti
FPL
2008
Springer
107views Hardware» more  FPL 2008»
14 years 11 months ago
Scalable high-throughput SRAM-based architecture for IP-lookup using FPGA
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. However, this approach results in inefficient memory utilization. Due to available...
Hoang Le, Weirong Jiang, Viktor K. Prasanna