The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2007 vol.18)
pp: 865-878
Keqin Li , IEEE
ABSTRACT
<p><b>Abstract</b>—Given <tmath>N</tmath> matrices <tmath>A_{1}, A_{2}, \ldots, A_{N}</tmath> of size <tmath>N \times N</tmath>, the matrix chain product problem is to compute <tmath>A_{1} \times A_{2} \times \cdots \times A_{N}</tmath>. Given an <tmath>N \times N</tmath> matrix <tmath>A</tmath>, the matrix powers problem is to calculate the first <tmath>N</tmath> powers of <tmath>A</tmath>, that is, <tmath>A, A^{2}, A^{3}, \ldots, A^{N}</tmath>. We solve the two problems on distributed memory systems (DMSs) with <tmath>p</tmath> processors that can support one-to-one communications in <tmath>T(p)</tmath> time. Assume that the fastest sequential matrix multiplication algorithm has time complexity <tmath>O(N^{\alpha})</tmath>, where the currently best value of <tmath>\alpha</tmath> is less than 2.3755. Let <tmath>p</tmath> be arbitrarily chosen in the range <tmath>1 \leq p \leq N^{\alpha + 1}/(\log N)^{2}</tmath>. We show that the two problems can be solved by a DMS with <tmath>p</tmath> processors in <tmath>T_{\rm chain}(N,p) = </tmath><tmath>O({\frac{N^{\alpha + 1}}{p}} + T(p)(({\frac{N^{2(1 + 1/\alpha)}}{p^{2/\alpha}}})</tmath><tmath>(\log^{+}{\frac{p}{N}})^{1 - 2/\alpha} + \log^{+}({\frac{p\log N}{N^{\alpha}}})\log N))</tmath> and <tmath>T_{\rm power}(N,p) = O({\frac{N^{\alpha + 1}}{p}} + T(p)(({\frac{N^{2(1 + 1/\alpha)}}{p^{2/\alpha}}})(\log^{+}</tmath><tmath>{\frac{p}{2\log N}})^{1 - 2/\alpha}+ (\log N)^{2}))</tmath> times, respectively, where the function <tmath>\log^{+}</tmath> is defined as follows: <tmath>\log^{+}x = \log x</tmath> if <tmath>x \geq 1</tmath> and <tmath>\log^{+}x = 1</tmath> if <tmath>0 < x < 1</tmath>. We also give instantiations of the above results on several typical DMSs and show that computing matrix chain product and matrix powers are fully scalable on distributed memory parallel computers (DMPCs), highly scalable on DMSs with hypercubic networks, and not highly scalable on DMSs with mesh and torus networks.</p>
INDEX TERMS
Cost optimality, distributed memory parallel computer, distributed memory system, dynamic processor allocation, hypercubic network, matrix chain product, matrix multiplication, matrix power, mesh, scalability, speedup, torus.
CITATION
Keqin Li, "Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems", IEEE Transactions on Parallel & Distributed Systems, vol.18, no. 7, pp. 865-878, July 2007, doi:10.1109/TPDS.2007.1027
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool