Sciweavers

2035 search results - page 143 / 407
» Working memory
Sort
View
128
Voted
CASES
2004
ACM
15 years 8 months ago
A post-compiler approach to scratchpad mapping of code
ScratchPad Memories (SPMs) are commonly used in embedded systems because they are more energy-efficient than caches and enable tighter application control on the memory hierarchy...
Federico Angiolini, Francesco Menichelli, Alberto ...
105
Voted
VLDB
2004
ACM
122views Database» more  VLDB 2004»
15 years 8 months ago
Cache-Conscious Radix-Decluster Projections
As CPUs become more powerful with Moore’s law and memory latencies stay constant, the impact of the memory access performance bottleneck continues to grow on relational operator...
Stefan Manegold, Peter A. Boncz, Niels Nes
141
Voted
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 8 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
POPL
2000
ACM
15 years 7 months ago
Type Systems for Distributed Data Structures
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
Ben Liblit, Alexander Aiken
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
15 years 7 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina