|
|
October 5-12, 2008, Novosibirsk, Russia
|
SUBSECTION |
Chairman: V.I. Kostin
This
subsection is organized within the framework of the section “Computational Mathematics and Mathematical Modeling”
under the aegis of Intel Corporation.
The subsection will consider problems of computational algorithms for shared memory build and usage on multicore processors (including hybrid OpenMP/MPI algorithms), software development for support and optimization of such computations (libraries, compilers, analyzers etc.) and computations’ organization on platforms that use graphics processing units.
The subsection includes the following topics:
-
efficient algorithms of computational mathematics for multicore processors;
-
efficient solving of complex computational problems on multicore platforms;
-
software support of efficient computations on multicore processors (libraries, compilers, analyzers etc.);
-
efficient computations on architectures with GPU/GPGPU.
Given presentations
Chuvelev M., Kazakov S.
High performance dense linear algebra in Intel®
MKL
Gladkikh V. S.
Optimizing the operations with sparse matrices on
Intel® architecture
Glinsky B. M., Kuchin N. V., Avdeev A.
V., Samofalov V. V.
Joint SB RAS -
Intel competency center for high performance computing
Gvozdev E.
Intel Math Libraries testing
and validation methodologies
Kirillov S.
The use of finite fields GF(256) in the Performance Primitives
Intel® IPP
Kobotov A. V.
Efficient dynamic parallelization for
linear algebra algorithms
Kostin V. I.
Intel® Math Kernel Library (Intel®
MKL)
Preis S. V., Narayanaswamy R.
Use of transactional memory to simplify
shared-memory parallel programming
Solovev S. A.,
Pudov S. G.
PARDISO - Parallel direct
solver to solve SLAE on shared memory
architectures
Zotkevich A. A.
Implementation of a laminar flame on a multicore processor