33 search results - page 2 / 7 » Worst-Case Optimal Tree Layout in a Memory Hierarchy |
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
As database application performance depends on the utilization of the memory hierarchy, smart data placement plays a central role in increasing locality and in improving memory ut...
ECOOP
2000
Springer
13 years 9 months ago
2000
Springer
Althoughthereisalargebodyofresearchonthetimeoverheadofobject oriented programs, there is little work on memory overhead. This paper takes an empirical approach to the study of this...
MICRO
2007
IEEE
13 years 11 months ago
2007
IEEE
Current on-chip block-centric memory hierarchies exploit access patterns at the fine-grain scale of small blocks. Several recently proposed techniques for coherence traffic reduct...