Sciweavers

4747 search results - page 903 / 950
» Shuffle Memory System
Sort
View
ANCS
2007
ACM
15 years 1 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
ANCS
2007
ACM
15 years 1 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
PODC
2010
ACM
15 years 1 months ago
On asymmetric progress conditions
Wait-freedom and obstruction-freedom have received a lot of attention in the literature. These are symmetric progress conditions in the sense that they consider all processes as b...
Damien Imbs, Michel Raynal, Gadi Taubenfeld
FCCM
2007
IEEE
122views VLSI» more  FCCM 2007»
15 years 1 months ago
Reconfigurable Computing Cluster (RCC) Project: Investigating the Feasibility of FPGA-Based Petascale Computing
While medium- and large-sized computing centers have increasingly relied on clusters of commodity PC hardware to provide cost-effective capacity and capability, it is not clear th...
Ron Sass, William V. Kritikos, Andrew G. Schmidt, ...
HOTOS
2007
IEEE
15 years 1 months ago
HotComments: How to Make Program Comments More Useful?
Program comments have long been used as a common practice for improving inter-programmer communication and code readability, by explicitly specifying programmers' intentions ...
Lin Tan, Ding Yuan, Yuanyuan Zhou