Sciweavers

801 search results - page 5 / 161
» Minimal Locked Trees
Sort
View
EDBT
2000
ACM
15 years 1 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
CODES
2007
IEEE
15 years 3 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling
DBPL
2005
Springer
93views Database» more  DBPL 2005»
15 years 3 months ago
Minimizing Tree Automata for Unranked Trees
Wim Martens, Joachim Niehren
SIGMETRICS
2003
ACM
199views Hardware» more  SIGMETRICS 2003»
15 years 2 months ago
Data cache locking for higher program predictability
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristi...
Xavier Vera, Björn Lisper, Jingling Xue