کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
432932 689129 2006 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules
چکیده انگلیسی

This paper investigates the computation of matrix product on both partially pipelined and fully pipelined modular linear arrays. These investigations are guided by a constructive and unified approach for both target architectures. First, permissible affine input functions are identified by a set of necessary and sufficient conditions for various conflict avoidance. This first study also leads to complexity results. Then, algorithms whose performance represents an improvement over the best previously known bounds are exhibited.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Parallel and Distributed Computing - Volume 66, Issue 3, March 2006, Pages 323-333