Stream Algorithms and Architecture
Name
MIT-LCS-TM-636.pdf
Size
3.82 MB
Format
Adobe PDF
Checksum (MD5)
d62288d9fa820ae4ba4371cc0ebe9833
Author(s)
Henry, Hoffman
Strumpen, Volker
Agarwal, Anant
Date Issued
March 2003
Series/Report no.
MIT-LCS-TM-636
Abstract
Wire-exposed, programmable microarchitectures including Trips [11]], Smart Memories [8], and Raw [13] offer an opportunity to schedule instruction execution and data movement explicitly. This paper proposes stream algorithms, which, along with a decoupled systolic architecture, provide an excellent match for the physical and technological constraints of single-chip tiles architectures. Stream algorithms enable programmed systolic computations for different problem sizes, without incurring the cost of memory accesses. To that end, we decouple memory accesses from computation and move the memory accesses off the critical path. By structuring computations in systolic phases, and deferring memory accesses to dedicated memory processors, stream algorithms can solve many regular problems with varying sizes on a constant-sized tiled array. Contrary to common sense, the compute efficiency of stream algorithms increases as we increase the number of processing elements. In particular, we show that the compute efficiency of stream algorithms can approach 100% asymptotically, that is for large numbers of processors and appropriate problem size.
Persistent DSpace Link
