613 search results - page 31 / 123 » The Memory Fragmentation Problem: Solved |
116
click to vote
DEXAW
1999
IEEE
15 years 6 months ago
1999
IEEE
A system that saves a digital copy of every document that users copy, print, or fax, without asking the user, has recently been proposed. Referred to as the Infinite Memory Multif...
120
Voted
SEFM
2008
IEEE
15 years 9 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
129
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. Real-time main-memory databases are useful in real-time environments. They are often faster and provide more predictable execution of transactions than disk-based databas...
217
Voted
ISCA
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
114
Voted
WMPI
2004
ACM
15 years 8 months ago
2004
ACM
Abstract. In this paper, we propose a processor architecture with programmable on-chip memory for a high-performance SMP (symmetric multi-processor) node named SCIMA-SMP (Software ...