Sparse Matrices in Matlab*P: Design and Implementation
نویسندگان
چکیده
Matlab*P is a flexible interactive system that enables computational scientists and engineers to use a high-level language to program cluster computers. The Matlab*P user writes code in the Matlab language. Parallelism is available via data-parallel operations on distributed objects and via task-parallel operations on multiple objects. Matlab*P can store distributed matrices in either full or sparse format. As in Matlab, most matrix operations apply equally to full or sparse operands. Here, we describe the design and implementation of Matlab*P’s sparse matrix support, and an application to a problem in computational fluid dynamics.
منابع مشابه
Distributed Sparse Matrices for Very High Level Languages
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinatorial algorithms. Parallel computing is becoming ubiquitous, specifically due to the advent of multi-core architectures. As existing VHLLs are adapted to emerging architectures, and new ones are conceived, one must ret...
متن کاملSparse Matrix Implementation in Octave
This paper discusses the implementation of the sparse matrix support with Octave. It address the algorithms that have been used, their implementation, including examples of using sparse matrices in scripts and in dynamically linked code. The octave sparse functions the compared with their equivalent functions with Matlab, and benchmark timings are calculated.
متن کامل. M S / 06 04 00 6 v 1 3 A pr 2 00 6 SPARSE MATRIX IMPLEMENTATION IN OCTAVE
This paper discusses the implementation of the sparse matrix support with Octave. It address the algorithms that have been used, their implementation, including examples of using sparse matrices in scripts and in dynamically linked code. The octave sparse functions the compared with their equivalent functions with Matlab, and benchmark timings are calculated.
متن کاملHigh-Performance Graph Algorithms from Parallel Sparse Matrices
Large–scale computation on graphs and other discrete structures is becoming increasingly important in many applications, including computational biology, web search, and knowledge discovery. High– performance combinatorial computing is an infant field, in sharp contrast with numerical scientific computing. We argue that many of the tools of high-performance numerical computing – in particular, ...
متن کاملHigh-level Interfaces for the Mad (matlab Automatic Differentiation) Package
Presently, the MAD Automatic Differentiation package for matlab comprises an overloaded implementation of forward mode AD via the fmad class. A key design feature of the fmad class is a separation of the storage and manipulation of directional derivatives into a separate derivvec class. Within the derivvec class, directional derivatives are stored as matrices (2-D arrays) allowing for the use o...
متن کامل