Sciweavers

548 search results - page 64 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
ICCD
2001
IEEE
140views Hardware» more  ICCD 2001»
15 years 11 months ago
Cost-effective Hardware Acceleration of Multimedia Applications
General-purpose microprocessors augmented with SIMD execution units enhance multimedia applications by exploiting data level parallelism. However, supporting/overhead related inst...
Deependra Talla, Lizy Kurian John
MICRO
2009
IEEE
168views Hardware» more  MICRO 2009»
15 years 8 months ago
Ordering decoupled metadata accesses in multiprocessors
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
Hari Kannan
LFP
1994
129views more  LFP 1994»
15 years 3 months ago
Static Dependent Costs for Estimating Execution Time
We present the rst system for estimating and using datadependent expression execution times in a language with rst-class procedures and imperative constructs. The presence of rst-...
Brian Reistad, David K. Gifford
BTW
2007
Springer
154views Database» more  BTW 2007»
15 years 8 months ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...
CIDR
2003
147views Algorithms» more  CIDR 2003»
15 years 3 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe