Sciweavers

93 search results - page 10 / 19
» Memory Placement Techniques for Parallel Association Mining
Sort
View
ISPASS
2007
IEEE
14 years 1 months ago
Simplifying Active Memory Clusters by Leveraging Directory Protocol Threads
Address re-mapping techniques in so-called active memory systems have been shown to dramatically increase the performance of applications with poor cache and/or communication beha...
Dhiraj D. Kalamkar, Mainak Chaudhuri, Mark Heinric...
GRID
2005
Springer
14 years 1 months ago
Differential checkpointing for reducing memory requirements in optimized SOAP deserialization
Abstract— Differential Deserialization (DDS) is a SOAP optimization technique wherein servers save checkpoints and parser states associated with portions of previously received m...
Nayef Abu-Ghazaleh, Michael J. Lewis
EUROPAR
2001
Springer
13 years 12 months ago
Performance of High-Accuracy PDE Solvers on a Self-Optimizing NUMA Architecture
High-accuracy PDE solvers use multi-dimensional fast Fourier transforms. The FFTs exhibits a static and structured memory access pattern which results in a large amount of communic...
Sverker Holmgren, Dan Wallin
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 4 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
11 years 10 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray