ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers
Full text PdfPdf (822 KB)
Source ACM Annual Conference/Annual Meeting archive
Proceedings of the 1966 21st national conference table of contents
Pages: 229 - 239  
Year of Publication: 1966
Author
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Citation Count: 20
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800256.810702
What is a DOI?

Warning: The download time has expired please click on the item to try again.


ABSTRACT

Since the computer operation when viewed as the execution of subroutines or instructions or logical subcommands is a discrete sequential process, its action or behavior can be predicted to a degree of certainty when sufficient knowledge is available about the structure of its information flow. Conventionally, the “look-ahead” function implies fetching the next set of instructions and their associated data and preparing ahead of time for their execution. We shall, however, broaden the concept to the anticipation of the next “event” of a specified type whether it is a functional subroutine, instruction or an input-output function. In some sense, one can consider “looking-ahead” as the anticipatory simulation of important events in the execution sequence. By anticipating the most probable events, their requirements can be preplanned and furnished, if possible, without stalling the program, e.g., by alerting I/O units, by providing memory space for the next set of subroutines to be executed, etc. This is particularly important in a multi-programmed, multi-processor environment


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C V RAMAMOORTHY Discrete system representation and analysis by generating functions of abstract graphs IEEE International Convention Record Part 6 1965
2
 
3
C V RAMAMOORTHY PhD Thesis Harvard University May 1964
4
 
5
C V RAMAMOORTHY Connectivity considerations of directed graphs representing sequential systems IEEE Trans Electronic Computers October 1965
6
 
7
M E CONWAY A multiprocessor system design Proceedings FJCC 1963

CITED BY  20