Show simple item record

dc.contributor.advisorThoreson, Sharilyn A.
dc.contributor.authorSchneider, Robert Jeffrey
dc.date.accessioned2015-08-27T16:05:48Z
dc.date.available2015-08-27T16:05:48Z
dc.date.issued1983-07-01
dc.identifier.urihttps://hdl.handle.net/11244/16411
dc.description.abstractThis 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.
dc.formatapplication/pdf
dc.languageen_US
dc.publisherOklahoma State University
dc.rightsCopyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material.
dc.titleDemand Driven Data Flow Environment for a Locality Study
dc.typetext
dc.contributor.committeeMemberHedrick, George E.
dc.contributor.committeeMemberAli, Mahir S.
osu.filenameThesis-1983-S359d.pdf
osu.accesstypeOpen Access
dc.description.departmentComputing and Information Sciences
dc.type.genreThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record