Sciweavers

2303 search results - page 20 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
SC
1995
ACM
13 years 11 months ago
Parallel Matrix-Vector Product Using Approximate Hierarchical Methods
Matrix-vector products (mat-vecs) form the core of iterative methods used for solving dense linear systems. Often, these systems arise in the solution of integral equations used i...
Ananth Grama, Vipin Kumar, Ahmed H. Sameh
WSC
1997
13 years 8 months ago
Cloning: A Novel Method for Interactive Parallel Simulation
A new scheme for interactively testing what-if and alternative scenarios in parallel simulations is presented. Potential branches or choices can be specified interactively and in...
Maria Hybinette, Richard Fujimoto
HPDC
1994
IEEE
13 years 11 months ago
Network Partitioning of Data Parallel Computations
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning methodfor choos...
Jon B. Weissman, Andrew S. Grimshaw
ISPA
2004
Springer
14 years 27 days ago
A Scalable Low Discrepancy Point Generator for Parallel Computing
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
Kwong-Ip Liu, Fred J. Hickernell
ICCS
2003
Springer
14 years 22 days ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen