Sciweavers

601 search results - page 111 / 121
» Lattice-based memory allocation
Sort
View
IWMM
1998
Springer
130views Hardware» more  IWMM 1998»
13 years 11 months ago
Comparing Mostly-Copying and Mark-Sweep Conservative Collection
Many high-level language compilers generate C code and then invoke a C compiler for code generation. To date, most of these compilers link the resulting code against a conservativ...
Frederick Smith, J. Gregory Morrisett
LCR
2000
Springer
129views System Software» more  LCR 2000»
13 years 11 months ago
Run-Time Support for Distributed Sharing in Typed Languages
We present a new run-time system for typed programming languages that supports object sharing in a distributed system. The key insight in this system is that the ability to distin...
Y. Charlie Hu, Weimin Yu, Alan L. Cox, Dan S. Wall...
ICS
1995
Tsinghua U.
13 years 11 months ago
A Data Cache with Multiple Caching Strategies Tuned to Different Types of Locality
Current data cache organizations fail to deliver high performance in scalar processors for many vector applications. There are two main reasons for this loss of performance: the u...
Antonio González, Carlos Aliagas, Mateo Val...
LCTRTS
2010
Springer
13 years 9 months ago
An efficient code update scheme for DSP applications in mobile embedded systems
DSP processors usually provide dedicated address generation units (AGUs) to assist address computation. By carefully allocating variables in the memory, DSP compilers take advanta...
Weijia Li, Youtao Zhang
PODS
2009
ACM
124views Database» more  PODS 2009»
14 years 8 months ago
Indexing uncertain data
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Y...