The Manchester prototype dataflow computer
Communications of the ACM - Special section on computer architecture
Cache coherence protocols: evaluation using a multiprocessor simulation model
ACM Transactions on Computer Systems (TOCS)
High-performance computer architecture
High-performance computer architecture
ACM Computing Surveys (CSUR)
Content Addressable Parallel Processors
Content Addressable Parallel Processors
Introduction to VLSI Systems
A preliminary architecture for a basic data-flow processor
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
| Hi-index | 0.00 |
The static data flow model of computation promises high performance from fine grained parallelism, but conventional token-driven static data flow architectures are inefficient in terms of memory bandwidth and microcycles required per operation. The associative template mechanism, a new application of associative techniques, employs specially configured content-addressable memories to provide efficient flow control for static data flow program execution. It supports static data flow semantics while exhibiting memory bandwidth and microcycle demands comparable to those of conventional uniprocessors. Associative diffusion, a second application of associative methods, provides communication between adjacent nodes of a mesh-connected network of associative-template-based processors. This mechanism achieves nearest-neighbor communication at speeds comparable to intra-node transactions by overlapping domains of associativity across boundaries between neighboring nodes. Together, associative templates and associative diffusion provide a token-free approach to static data flow computation.