This study is an analysis of program behavior in a demand driven data flow environment to determine the existence of locality in such an environment. The motivation for performing such an analysis is to determine if a memory hierarchy is feasable for a demand driven data flow computer. Initially, demand driven computation is discussed, then a proposed model is covered in some detail. The type of instructions used in such a system are discussed with an explanation of each instruction's behavior. Finally, a locality analysis is performed by tracing the behavior of several executing programs in a demand driven data flow environment.Computing and Information Science
