Sciweavers

674 search results - page 35 / 135
» The computational complexity of the parallel knock-out probl...
Sort
View
ICPPW
2005
IEEE
15 years 7 months ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde
IPPS
2000
IEEE
15 years 5 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
IPPS
2006
IEEE
15 years 7 months ago
A framework to develop symbolic performance models of parallel applications
Performance and workload modeling has numerous uses at every stage of the high-end computing lifecycle: design, integration, procurement, installation and tuning. Despite the trem...
Sadaf R. Alam, Jeffrey S. Vetter
HIPC
2004
Springer
15 years 6 months ago
Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction
Parasitic extraction techniques are used to estimate signal delay in VLSI chips. Inductance extraction is a critical component of the parasitic extraction process in which on-chip ...
Hemant Mahawar, Vivek Sarin, Ananth Grama
ICS
1993
Tsinghua U.
15 years 5 months ago
Dynamic Control of Performance Monitoring on Large Scale Parallel Systems
Performance monitoring of large scale parallel computers creates a dilemma: we need to collect detailed information to find performance bottlenecks, yet collecting all this data ...
Jeffrey K. Hollingsworth, Barton P. Miller