C. V. Ramamoorthy
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
- 1.C V RAMAMOORTHY Discrete system representation and analysis by generating functions of abstract graphs IEEE International Convention Record Part 6 1965Google Scholar
- 2.C V RAMAMOORTHY Discrete Markov analysis of computer programs Proceedings National Meeting of ACM 1965 Google ScholarDigital Library
- 3.C V RAMAMOORTHY PhD Thesis Harvard University May 1964Google Scholar
- 4.D E KNUTH Computer drawn flow charts Comm ACM September 1963 Google ScholarDigital Library
- 5.C V RAMAMOORTHY Connectivity considerations of directed graphs representing sequential systems IEEE Trans Electronic Computers October 1965Google Scholar
- 6.C V RAMAMOORTHY Analysis of graphs by connectivity considerations Journal A C M April 1966 Google ScholarDigital Library
- 7.M E CONWAY A multiprocessor system design Proceedings FJCC 1963Google Scholar
Index Terms
- The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers
Recommendations
Clairvoyance: look-ahead compile-time scheduling
CGO '17: Proceedings of the 2017 International Symposium on Code Generation and OptimizationTo enhance the performance of memory-bound applications, hardware designs have been developed to hide memory latency, such as the out-of-order (OoO) execution engine, at the price of increased energy consumption. Contemporary processor cores span a ...
Scaling the issue window with look-ahead latency prediction
ICS '04: Proceedings of the 18th annual international conference on SupercomputingIn contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide more ILP; however, future processor scaling demands threaten to limit the ...
Comments