Sciweavers

2303 search results - page 131 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
IPPS
2007
IEEE
15 years 9 months ago
Pipelining Tradeoffs of Massively Parallel SuperCISC Hardware Functions
Parallel processing using multiple processors is a well-established technique to accelerate many different classes of applications. However, as the density of chips increases, ano...
Colin J. Ihrig, Justin Stander, Alex K. Jones
LCPC
1995
Springer
15 years 6 months ago
Piecewise Execution of Nested Data-Parallel Programs
Abstract. The technique of flattening nested data parallelism combines all the independent operations in nested apply-to-all constructs and generates large amounts of potential pa...
Daniel W. Palmer, Jan Prins, Siddhartha Chatterjee...
PROCEDIA
2010
105views more  PROCEDIA 2010»
15 years 1 months ago
Improvement of parallelization efficiency of batch pattern BP training algorithm using Open MPI
The use of tuned collective’s module of Open MPI to improve a parallelization efficiency of parallel batch pattern back propagation training algorithm of a multilayer perceptron...
Volodymyr Turchenko, Lucio Grandinetti, George Bos...
101
Voted
CEC
2005
IEEE
15 years 9 months ago
Parallel evolutionary algorithms on graphics processing unit
Evolutionary Algorithms (EAs) are effective and robust methods for solving many practical problems such as feature selection, electrical circuits synthesis, and data mining. Howeve...
Man Leung Wong, Tien-Tsin Wong, Ka-Ling Fok
IPPS
2006
IEEE
15 years 9 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...