10805 search results - page 355 / 2161 » Mapping Computation with No Memory |
247
click to vote
ARC
2010
Springer
16 years 1 months ago
2010
Springer
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
239
click to vote
AINA
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
161
click to vote
ICPP
2008
IEEE
16 years 1 months ago
2008
IEEE
—Transactional Memory (TM) takes responsibility for concurrent, atomic execution of labeled regions of code, freeing the programmer from the need to manage locks. Typical impleme...
208
click to vote
SP
2008
IEEE
16 years 1 months ago
2008
IEEE
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
179
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...