Sciweavers

2035 search results - page 53 / 407
» Working memory
Sort
View
SPAA
2005
ACM
15 years 8 months ago
Efficient algorithms for verifying memory consistency
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
Chaiyasit Manovit, Sudheendra Hangal
DATE
2000
IEEE
140views Hardware» more  DATE 2000»
15 years 7 months ago
Resolution of Dynamic Memory Allocation and Pointers for the Behavioral Synthesis from C
-- One of the greatest challenges in C/C++-based design methodology is to efficiently map C/C++ models into hardware. Many of the networking and multimedia applications implemente...
Luc Séméria, Koichi Sato, Giovanni D...
ADC
2000
Springer
326views Database» more  ADC 2000»
15 years 7 months ago
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
Hongjun Lu, Yuet Yeung Ng, Zengping Tian
ICS
2003
Tsinghua U.
15 years 8 months ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas
ISSTA
2010
ACM
15 years 6 months ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder