By Topic  Analysis of Parallel Algorithms for Matrix Chain
Product and Matrix Powers on Distributed Memory Systems  Sign In
Formats Non-Member Member $31 $13 Become an IEEE Member or
Subscribe to IEEE Xplore for exclusive pricing! close button
puzzle piece   Learn more about:  IEEE membership  IEEE Xplore
subscriptions  1 Author(s) Keqin Li ; New York State Univ., New
Paltz  Given N matrices A1, A2,...,AN of size NtimesN, the
matrix chain product problem is to compute
A1timesA2times...timesAN. Given an NtimesN matrix A, the matrix
powers problem is to calculate the first N powers of A, that is,
A, A2, A3,..., AN. We solve the two problems on distributed
memory systems (DMSs) with p processors that can support one-to-
one communications in T(p) time. Assume that the fastest
sequential matrix multiplication algorithm has time complexity
O(Nalpha), where the currently best value of a is less than
2.3755. Let p be arbitrarily chosen in the range
1lesplesNalpha+1/(log N)2. We show that the two problems can be
so