2011 | OriginalPaper | Buchkapitel
Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions
verfasst von : Igor Chikalov, Shahid Hussain, Mikhail Moshkov
Erschienen in: SOFSEM 2011: Theory and Practice of Computer Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we present a methodology to optimize matrix chain multiplication sequentially relative to different cost functions such as total number of scalar multiplications, communication overhead in a multiprocessor environment, etc. For
n
matrices our optimization procedure requires
O
(
n
3
) arithmetic operations per one cost function. This work is done in the framework of a dynamic programming extension that allows sequential optimization relative to different criteria.