Advances in Parallel Partitioning, Load Balancing and Matrix Ordering for Scientific Computing
نویسندگان
چکیده
We summarize recent advances in partitioning, load balancing, and matrix ordering for scientific computing performed by members of the CSCAPES SciDAC institute.
منابع مشابه
The Zoltan and Isorropia parallel toolkits for combinatorial scientific computing: Partitioning, ordering and coloring
Partitioning and load balancing are important problems in scientific computing that can be modeled as combinatorial problems using graphs or hypergraphs. The Zoltan toolkit was developed primarily for partitioning and load balancing to support dynamic parallel applications, but has expanded to support other problems in combinatorial scientific computing, including matrix ordering and graph colo...
متن کاملA PERFORMANCE STUDY OF SPARSE CHOLESKY FACTORIZATION ON INTEL iPSC/860
The problem of Cholesky factorization of a sparse matrix has been very well investigated on sequential machines. A number of efficient codes exist for factorizing large unstructured sparse matrices, for example, codes from Harwell Subroutine Library [4] and Sparspak [7]. However, there is a lack of such efficient codes on parallel machines in general, and distributed memory machines in particul...
متن کاملLoad Balancing Problem for Parallel Computers with Distributed Memory
This paper deals with load balancing of parallel algorithms for distributedmemory computers. The parallel versions of BLAS subroutines for matrix-vector product and LU factorization are considered. Two task partitioning algorithms are investigated and speed-ups are calculated. The cases of homogeneous and heterogeneous collections of computers/processors are studied, and special partitioning al...
متن کاملParallel Computing for Nonlinear Dynamic Finite Element Structural Analysis with General Sparse Matrix Technology
The principal objective of this research is to reduce the elapsed time of largescale nonlinear dynamic structural finite element analysis using parallel computing techniques. The major tasks and contributions of this research are: (a) employing the general sparse matrix technique to reduce the computing time and storage requirements for both sequential and parallel substructure analysis (b) emp...
متن کاملPartitioning and Load Balancing for Emerging Parallel Applications and Architectures
An important component of parallel scientific computing is partitioning – the assignment of work to processors. This assignment occurs at the start of a computation (“static” partitioning). Often, reassignment also is done during a computation (“dynamic” partitioning) to redistribute work as the computation changes. The goal of partitioning is to assign work to processors in a way that minimize...
متن کامل