1147 search results - page 86 / 230 » Virtualizing Transactional Memory |
129
Voted
LCPC
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
113
click to vote
INFOCOM
2010
IEEE
15 years 3 days ago
2010
IEEE
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
100
click to vote
HIPEAC
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The interest in translation-based virtual execution environments (VEEs) is growing with the recognition of their importance in a variety of applications. However, due to ...
111
click to vote
RECOSOC
2007
15 years 3 months ago
2007
Code Compression has been shown to be efficient in minimizing the memory requirements for embedded systems as well as in power consumption reduction and performance improvement. I...
130
click to vote
CGO
2006
IEEE
15 years 5 months ago
2006
IEEE
Memory performance is an important design issue for contemporary systems given the ever increasing memory gap. This paper proposes a space-efficient Java object model for reducing...