Results 231 to 240 of about 3,122,051 (263)

Coded Matrix Chain Multiplication

2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS), 2021
The matrix multiplication is a fundamental building block in many machine learning models. As the input matrices may be too large to be multiplied on a single server, it is common to split input matrices into multiple submatrices and execute the multiplications on different servers.
Pedro Soto
exaly   +3 more sources

Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product

IEEE Transactions on Computers, 1981
The error complexity analysis of three algorithms for matrix multiplication and matrix chain product has been given. It is shown that the usual inner product type algorithm is by far the best algorithm for simple matrix multiplication or matrix chain product in terms of minimal basic term growth and minimal error complexities, the latter being ...
Nai-Kuan Tsao
exaly   +2 more sources

Exploiting inter-operation parallelism for matrix chain multiplication using MapReduce

Journal of Supercomputing, 2013
In this paper, we address the matrix chain multiplication problem, i.e., the multiplication of several matrices. Although several studies have investigated the problem, our approach has some different points. First, we propose MapReduce algorithms that allow us to provide scalable computation for large matrices.
Jaeseok Myung, Sang-goo Lee
exaly   +3 more sources

A chain-multiplier for large scale matrix multiplication

2017 IEEE 12th International Conference on ASIC (ASICON), 2017
Matrix operation has high time complexity and traditional serial algorithm is less efficient. In the existing design of matrix multiplication, systolic array and other methods are usually used for hardware acceleration. But as the scale of matrix computing increases, the “storage wall” problem caused by data throughput bandwidth has become the ...
Can Wei, Yu-Kun Song, Duoli Zhang
exaly   +2 more sources

On Efficient Large Sparse Matrix Chain Multiplication

Proceedings of the ACM on Management of Data
Sparse matrices are often used to model the interactions among different objects and they are prevalent in many areas including e-commerce, social network, and biology. As one of the fundamental matrix operations, the sparse matrix chain multiplication (SMCM) aims to efficiently multiply a chain of sparse matrices, which has found various real-world ...
Wensheng Luo, Chenhao Ma
exaly   +3 more sources

Dynamic Programming Parallelization of Matrix Chain Multiplication on GPU: A Comparative Study

Advances in Intelligent Systems and Computing, 2016
The dynamic programming paradigm involves various important optimization problems. The set of optimization problems includes optimal binary search tree, longest common subsequence, binary knapsack, Matrix chain multiplication (MCM), and many more. In dynamic programming problems, the MCM of n matrices comprises the computation of the parenthesization ...
Tausif Diwan, S. R. Sathe
exaly   +2 more sources

Parallel research on matrix chain multiplication problem based on multi-core

2011 International Conference on Consumer Electronics, Communications and Networks (CECNet), 2011
Now the computer is developing towards the multi-core and multi-CPU, but some quintessence serial algorithm can not be well transplanted to multi-core computer, so it's necessary to make parallel analysis and improvement on the original serial algorithm.
Hongyi Li
exaly   +2 more sources

Design and implementation of GPU-based matrix chain multiplication using C++AMP

2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT), 2017
Matrix Chain Multiplication is one of the optimization problems widely used in graph algorithms, signal processing and network industry. The Matrix Chain multiplication is the process of multiplying number of nxn matrices cumulatively, where n is the size of the matrix.
K Shyamala
exaly   +2 more sources