Sciweavers

47 search results - page 1 / 10
» Towards an accurate performance modeling of parallel sparse ...
Sort
View
AAECC
2007
Springer
87views Algorithms» more  AAECC 2007»
13 years 5 months ago
Towards an accurate performance modeling of parallel sparse factorization
We present a simulation-based performance model to analyze a parallel sparse LU factorization algorithm on modern cached-based, high-end parallel architectures. We consider supern...
Laura Grigori, Xiaoye S. Li
IPPS
2005
IEEE
13 years 10 months ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...
JSSPP
2005
Springer
13 years 10 months ago
ScoPred-Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Benjamin J. Lafreniere, Angela C. Sodan
HPCA
2009
IEEE
14 years 5 months ago
Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
Lide Duan, Bin Li, Lu Peng
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...