Results 201 to 210 of about 12,282 (248)

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.
Xiaodi Fan, Angel Saldivia, Pedro Soto, Jun Li   +3 more
openaire   +1 more source

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, Yukun Song, Duoli Zhang
openaire   +1 more source

Matrix Chain Multiplication

2018
This chapter is devoted to the study of matrix chain multiplication problem. For this problem, we consider different cost functions and present a multi-stage optimization procedure relative to a sequence of such functions.
Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov   +4 more
openaire   +1 more source

A heuristic for optimizing the multiplication of matrix chains

Proceedings of the 17th annual Southeast regional conference on - ACM-SE 17, 1979
A consequence of the associative property of matrix multiplication is that the product of n matrices can be calculated in (n-1)! ways. Different choices for the multiplication sequence can cause the numbers of scalar multiplications required to vary by several orders of magnitude.
Lionel E. Deimel, Tempe Ann Lampe
openaire   +1 more source

Exploiting inter-operation parallelism for matrix chain multiplication using MapReduce

The 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
openaire   +1 more source

Information Security Using Chains Matrix Multiplication

2012
Information technology is facing lots of problems, while transmitting sensitive data and confidential data due to rapid growth of technology. The sensitive data is intended to share between only authorized persons, not for all. Information security concentrates on sensitive knowledge pattern that can be exposed when extracting the data.
Ch. Rupa, P. S. Avadhani
openaire   +1 more source

Matrix chain multiplication via multi-way join algorithms in MapReduce

Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, 2012
In this paper, we translate the multiplication of several matrices into a multi-way join operation among several relations. Matrix multiplication is widely used for many graph algorithms, such as those that calculate the transitive closure. These algorithms benefit from the multi-way join operation because this operation reduces the number of binary ...
Jaeseok Myung, Sang-goo Lee
openaire   +1 more source

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, Suping Wu
openaire   +1 more source