Sciweavers

6102 search results - page 668 / 1221
» Generating Optimizing Specializers
Sort
View
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 11 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
214
Voted
ICS
1994
Tsinghua U.
15 years 11 months ago
Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
Kathryn S. McKinley
215
Voted
FPL
2007
Springer
99views Hardware» more  FPL 2007»
15 years 11 months ago
Disjoint Pattern Enumeration for Custom Instructions Identification
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...
Pan Yu, Tulika Mitra
192
Voted
EDBT
2009
ACM
144views Database» more  EDBT 2009»
15 years 11 months ago
Efficient maintenance techniques for views over active documents
Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when moni...
Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
181
Voted
ECOOP
2006
Springer
15 years 11 months ago
Automatic Prefetching by Traversal Profiling in Object Persistence Architectures
Object persistence architectures support transparent access to persistent objects. For efficiency, many of these architectures support queries that can prefetch associated objects ...
Ali Ibrahim, William R. Cook