Sciweavers

339 search results - page 34 / 68
» Reducing Memory Ordering Overheads in Software Transactional...
Sort
View
192
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
151
Voted
ISSTA
2006
ACM
15 years 9 months ago
Improving distributed memory applications testing by message perturbation
We present initial work on perturbation techniques that cause the manifestation of timing-related bugs in distributed memory Message Passing Interface (MPI)-based applications. Th...
Richard W. Vuduc, Martin Schulz, Daniel J. Quinlan...
USENIX
2008
15 years 5 months ago
Protection Strategies for Direct Access to Virtualized I/O Devices
Commodity virtual machine monitors forbid direct access to I/O devices by untrusted guest operating systems in order to provide protection and sharing. However, both I/O memory ma...
Paul Willmann, Scott Rixner, Alan L. Cox
154
Voted
CASES
2005
ACM
15 years 5 months ago
MTSS: multi task stack sharing for embedded systems
Out-of-memory errors are a serious source of unreliability in most embedded systems [22]. Applications run out of main memory because of the frequent difficulty of estimating the ...
Bhuvan Middha, Matthew Simpson, Rajeev Barua
120
Voted
ACSAC
2006
IEEE
15 years 9 months ago
Address Space Layout Permutation (ASLP): Towards Fine-Grained Randomization of Commodity Software
Address space randomization is an emerging and promising method for stopping a broad range of memory corruption attacks. By randomly shifting critical memory regions at process in...
Chongkyung Kil, Jinsuk Jun, Christopher Bookholt, ...