author = {Kenji Miyamoto},
title = {{Parallel Algorithms for Sparse Matrices in an Industrial Optimization Software}},
language = {english},
abstract = {Optimization problems have an important role in industry, and the finite element method is a popular solution to solve optimization problems numerically. The finite element method rely on linear algebra, high performance linear equation solvera are there important topic in applied science. In this thesis, we study the high performance forward/backward substitution method by means of parallel computing.We implement various solutions and benchmark each of them in detail on two computers with different hardware architectures; one is a shared memory multicore machine, and the other one is a multicore machine with virtual shared memory machine. We tried two programming models, MPI and POSIX threading, and find the difference of these programming models by run benchmarks on two computers. We achieve good speedup by integrating some solutions.},
year = {2008},
month = {July},
translation = {0},
school = {Internationaler Universitätslehrgang Informatics: Engineering & Management (ISI Hagenberg)},
length = {92}