Sciweavers

26 search results - page 3 / 6
» Compressible memory data structures for event-based trace an...
Sort
View
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 6 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
13 years 11 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
PPOPP
2003
ACM
13 years 11 months ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra
DSD
2010
IEEE
161views Hardware» more  DSD 2010»
13 years 6 months ago
Design of Trace-Based Split Array Caches for Embedded Applications
—Since many embedded systems execute a predefined set of programs, tuning system components to application programs and data is the approach chosen by many design techniques to o...
Alice M. Tokarnia, Marina Tachibana
SIGOPS
2010
162views more  SIGOPS 2010»
13 years 4 months ago
Visual and algorithmic tooling for system trace analysis: a case study
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
Wim De Pauw, Steve Heisig