Sciweavers

593 search results - page 109 / 119
» An approach to benchmarking configuration complexity
Sort
View
ASPLOS
2012
ACM
12 years 4 months ago
Aikido: accelerating shared data dynamic analyses
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...
Marek Olszewski, Qin Zhao, David Koh, Jason Ansel,...
BMCBI
2010
129views more  BMCBI 2010»
13 years 9 months ago
Automatic prediction of catalytic residues by modeling residue structural neighborhood
Background: Prediction of catalytic residues is a major step in characterizing the function of enzymes. In its simpler formulation, the problem can be cast into a binary classific...
Elisa Cilia, Andrea Passerini
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
14 years 9 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
LCTRTS
2010
Springer
14 years 3 months ago
Operation and data mapping for CGRAs with multi-bank memory
Coarse Grain Reconfigurable Architectures (CGRAs) promise high performance at high power efficiency. They fulfil this promise by keeping the hardware extremely simple, and movi...
Yongjoo Kim, Jongeun Lee, Aviral Shrivastava, Yunh...
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 years 3 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...