Abstract
A procedure is introduced to determine highly concurrent representation of linear algorithms. The technique replaces matrix/vector operations by sums of small-size triple matrix products. A specially dedicated array architecture performs each triple product without intermediate I/O operations. The highly concurrent representation is shown to be possible for any linear algorithm. The special architecture features dual-mode operation for processing elements and closed-loop data circulation. Both characteristics increase the flexibility and speed of the configuration. >
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
