1147 search results - page 130 / 230 » Virtualizing Transactional Memory |
127
click to vote
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
129
click to vote
CASES
2010
ACM
14 years 11 months ago
2010
ACM
Dynamic binary translators (DBTs) are becoming increasingly important because of their power and flexibility. However, the high memory demands of DBTs present an obstacle for all ...
138
click to vote
POPL
1999
ACM
15 years 6 months ago
1999
ACM
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, ...
131
click to vote
CASES
2007
ACM
15 years 5 months ago
2007
ACM
ABSTRACT This paper presents the first scratch-pad memory allocation scheme that requires no compiler support for interpreted-language based applications. A scratch-pad memory (SPM...
203
click to vote
HPCA
1999
IEEE
15 years 6 months ago
1999
IEEE
Symmetric multiprocessors (SMPs) connected with low-latency networks provide attractive building blocks for software distributed shared memory systems. Two distinct approaches hav...