Sciweavers

2479 search results - page 167 / 496
» A Computational Theory of Working Memory
Sort
View
DAC
2007
ACM
16 years 4 months ago
A Self-Tuning Configurable Cache
The memory hierarchy of a system can consume up to 50% of microprocessor system power. Previous work has shown that tuning a configurable cache to a particular application can red...
Ann Gordon-Ross, Frank Vahid
137
Voted
ICDM
2006
IEEE
147views Data Mining» more  ICDM 2006»
15 years 9 months ago
Adaptive Parallel Graph Mining for CMP Architectures
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
Gregory Buehrer, Srinivasan Parthasarathy, Yen-Kua...
130
Voted
CASES
2004
ACM
15 years 9 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 ...
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