Sciweavers

345 search results - page 32 / 69
» Effective memory protection using dynamic tainting
Sort
View
IJCAI
2007
14 years 11 months ago
An Information-Theoretic Analysis of Memory Bounds in a Distributed Resource Allocation Mechanism
Multiagent distributed resource allocation requires that agents act on limited, localized information with minimum communication overhead in order to optimize the distribution of ...
Ricardo M. Araujo, Luís C. Lamb
EUROPAR
1999
Springer
15 years 2 months ago
Annotated Memory References: A Mechanism for Informed Cache Management
Processor cycle time continues to decrease faster than main memory access times, placing higher demands on cache memory hierarchy performance. To meet these demands, conventional ...
Alvin R. Lebeck, David R. Raymond, Chia-Lin Yang, ...
DSN
2005
IEEE
15 years 3 months ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh
DLS
2010
204views Languages» more  DLS 2010»
14 years 7 months ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...
EMSOFT
2009
Springer
15 years 4 months ago
Adding aggressive error correction to a high-performance compressing flash file system
While NAND flash memories have rapidly increased in both capacity and performance and are increasingly used as a storage device in many embedded systems, their reliability has de...
Yangwook Kang, Ethan L. Miller