DocumentCode
2218597
Title
Cache memories in dataflow architecture
Author
Kavi, K.M. ; Hurson, A.R.
Author_Institution
Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA
fYear
1995
fDate
25-28 Oct 1995
Firstpage
182
Lastpage
189
Abstract
The recent advance in dataflow processing - to combine the dataflow paradigm with the control flow paradigm - has brought out many new challenging issues. This hybrid organization has made it possible to study familiar control flow concepts within the framework of the dataflow architecture. The concept of cache memory has proven its effectiveness in the von Neumann architecture due to the spatial and temporal localities which govern the organization of the conventional programming environment. A dataflow paradigm, does not imply to the locality. However, dataflow programs can be reordered to enhance the locality of instruction references. This can be achieved by careful partitioning of a dataflow program into vertical layers of data dependent instructions, and proper distribution and allocation of the recurrence portions of the dataflow program. Enhancing the locality of data references in flow architecture is a more challenging problem. This paper studies the design of instruction, data (operand) and I-Structure cache memories. The performance results obtained using various benchmark programs are presented and analyzed
Keywords
cache storage; data flow computing; I-Structure cache memories; cache memory; data cache; dataflow architecture; dataflow programs; instruction cache; Cache memory; Computer architecture; Concurrent computing; Delay; Memory architecture; Parallel processing; Processor scheduling; Transistors; Ultra large scale integration; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on
Conference_Location
San Antonio, TX
ISSN
1063-6374
Print_ISBN
0-81867195-5
Type
conf
DOI
10.1109/SPDP.1995.530682
Filename
530682
Link To Document