A study of memory references in a data flow environment

A study of memory references in a data flow environment " (1980). Retrospective Theses and Dissertations. Paper 7354. INFORMATION TO USERS This was produced from a copy of a document sent to us for microfilming. While the most advanced technological means to photograph and reproduce this document have been used, the quality is heavily dependent upon the quality of the material submitted. The following explanation of techniques is provided to help you understand markings or notations which may appear on this reproduction. 1. The sign or "target" for pages apparently lacking from the document photographed is "Missing Page(s)". If it was possible to obtain the missing page(s) or section, they are spliced into the film along with adjacent pages. This may have necessitated cutting through an image and duplicating adjacent pages to assure you of complete continuity. 2. When an image on the film is obliterated with a round black mark it is an indication that the film inspector noticed either blurred copy because of movement during exposure, or duplicate copy. Unless we meant to delete copyrighted materials that should not have been filmed, you will find a good image of the page in the adjacent frame. 3. When a map, drawing or chart, etc., is part of the material being photo­ graphed the photographer has followed a definite method in "sectioning" the material. It is customary to begin filming at the upper left hand comer of a large sheet and to continue from left to right in equal sections with small overlaps. If necessary, sectioning is continued again-beginning below the first row and continuing on until complete. 4. For any illustrations that cannot be reproduced satisfactorily by xerography, photographic prints can be purchased at additional cost and tipped into your xerographic copy. Requests can be made to our Dissertations Customer Services Department. 5. Some pages in any document may have indistinct print. In all cases we have filmed the best available copy.

[1]  C. Ramamoorthy,et al.  The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers , 1966, ACM '66.

[2]  Peter J. Denning,et al.  Experiments with program locality , 1899, AFIPS '72 (Fall, part I).

[3]  Peter J. Denning,et al.  A study of program locality and lifetime functions , 1975, SOSP.

[4]  Gordon Bell,et al.  C.mmp: a multi-mini-processor , 1972, AFIPS '72 (Fall, part II).

[5]  Harry Katzan,et al.  Storage hierarchy systems , 1971, AFIPS '71 (Spring).

[6]  Jean-Loup Baer,et al.  Dynamic Improvement of Locality in Virtual Memory Systems , 1976, IEEE Transactions on Software Engineering.

[7]  Patricia Johnson An introduction to vector processing , 1978 .

[8]  Jack B. Dennis,et al.  First version of a data flow procedure language , 1974, Symposium on Programming.

[9]  Thomas C. Lowe Automatic segmentation of cyclic program structures based on connectivity and processor timing , 1970, CACM.

[10]  Donald D. Chamberlin The "single-assignment" approach to parallel processing , 1972, AFIPS '71 (Fall).

[11]  Edward W. Ver Hoef,et al.  Automatic program segmentation based on Boolean connectivity , 1971, AFIPS '71 (Spring).

[12]  Donald J. Hatfield,et al.  Program Restructuring for Virtual Memory , 1971, IBM Syst. J..

[13]  Ian Watson,et al.  A prototype data flow computer with token labelling , 1899 .

[14]  Domenico Ferrari,et al.  Tailoring Programs to Models of Program Behavior , 1975, IBM J. Res. Dev..

[15]  Peter J. Denning,et al.  Virtual memory , 1970, CSUR.

[16]  Arvind,et al.  A computer capable of exchanging processing elements for time , 1976 .

[17]  Jack B. Dennis,et al.  A preliminary architecture for a basic data-flow processor , 1974, ISCA '75.

[18]  Domenico Ferrari,et al.  Improving locality by critical working sets , 1974, CACM.

[19]  L. G. Tesler,et al.  A language design for concurrent processes , 1899, AFIPS Spring Joint Computing Conference.

[20]  Stephen J. Allan,et al.  A Flow Analysis Procedure for the Translation of High-Level Languages to a Data Flow Language , 1980, IEEE Transactions on Computers.

[21]  Nirmal Jain Use of program structure information in virtual memory management. , 1975 .

[22]  Jack B. Dennis,et al.  VAL -- A Value-Oriented Algorithmic Language (Preliminary Reference Manual), , 1979 .

[23]  Alan P. Batson,et al.  Characteristics of program localities , 1976, CACM.

[24]  C. Retuadhas,et al.  Execution time behavior of certain high level language constructs on a feedback data flow architecture , 1979, COMPSAC.

[25]  V. M. Glushkov,et al.  Recursive Machines and Computing Technology , 1974, IFIP Congress.

[26]  Richard M. Russell,et al.  The CRAY-1 computer system , 1978, CACM.

[27]  Richard J. Swan,et al.  The implementation of the Cm* multi-microprocessor , 1899, AFIPS '77.

[28]  James E. Rumbaugh,et al.  A Data Flow Multiprocessor , 1977, IEEE Transactions on Computers.

[29]  Peter J. Denning,et al.  On modeling program behavior , 1972, AFIPS '72 (Spring).

[30]  Arvind,et al.  The (preliminary) Id report: an asynchronous programming language and computing machine , 1978 .

[31]  Samuel H. Fuller,et al.  Cm*: a modular, multi-microprocessor , 1977, AFIPS '77.

[32]  Jean-Loup Baer,et al.  Segmentation and optimization of programs from cyclic structure analysis , 1899, AFIPS '72 (Spring).