Loading...
Loading...

Go to the content (press return)

Transformation of systolic algorithms for interleaving partitions

Author
Fernandez, A.; Llaberia, J.; Navarro, J.; Valero-Garcia, M
Type of activity
Presentation of work at congresses
Name of edition
International Conference on Application Specific Array Processors 1990
Date of publication
1990
Presentation's date
1991
Book of congress proceedings
Proceedings of the International Conference on Application Specific Array Processors
First page
56
Last page
71
DOI
https://doi.org/10.1109/ASAP.1991.238893 Open in new window
Repository
http://hdl.handle.net/2117/12947 Open in new window
Abstract
A systematic method to map systolizable problems onto multicomputers is presented in this paper. A systolizable problem is a problem for which it is possible to design a Systolic Algorithm. This method selects and transforms the Systolic Algorithm into a parallel algorithm with high granularity. The communications requirements are reduced and thus the performance can be increased. The proposed scheme requires a classification of dependences, and it is based in the interleaved execution of severa...
Citation
Fernandez, A. [et al.]. Transformation of systolic algorithms for interleaving partitions. A: International Conference on Application Specific Array Processors. "Int. Conference Application Specific Array Processors". 1990, p. 56-71.
Keywords
Performance evaluation, Systolic arrays
Group of research
CAP - High Performace Computing Group
ICARUS - Intelligent Communications and Avionics for Robust Unmanned Aerial Systems

Participants

Attachments