Analysis of Graphs by Connectivity Considerations
Journal of the ACM (JACM)
Communications of the ACM
Analysis of computational systems: Discrete Markov analysis of computer programs
ACM '65 Proceedings of the 1965 20th national conference
Static grouping of small objects to enhance performance of a paged virtual memory
ACM Transactions on Computer Systems (TOCS)
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
The working set model for program behavior
Communications of the ACM - Special 25th Anniversary Issue
Improving locality by critical working sets
Communications of the ACM
Automatic segmentation of cyclic program structures based on connectivity and processor timing
Communications of the ACM
Analysis of boolean program models for time-shared, paged environments
Communications of the ACM
The working set model for program behavior
Communications of the ACM
ACM '69 Proceedings of the 1969 24th national conference
Applying program restructuring to dataflow environments
SAC '86 Proceedings of the 1986 workshop on Applied computing
The effect of look-ahead paging in a virtual memory system as determined by simulation
ANSS '73 Proceedings of the 1st symposium on Simulation of computer systems
A critical overview of computer performance evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Schedule—constrained job scheduling in a multiprogrammed computer system
WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
The working set model for program behavior
SOSP '67 Proceedings of the first ACM symposium on Operating System Principles
Profile-directed restructuring of operating system code
IBM Systems Journal
System Segmentation for the Parallel Diagnosis of Computers
IEEE Transactions on Computers
Aspects of a Dynamically Adaptive Operating System
IEEE Transactions on Computers
On the Paging Performance of Array Algorithms
IEEE Transactions on Computers
A stochastic model for workflow QoS evaluation
Scientific Programming - Scientific Workflows
A structural theory of machine diagnosis
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Automatic program segmentation based on Boolean connectivity
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Segmentation and optimization of programs from cyclic structure analysis
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Evaluation techniques for storage hierarchies
IBM Systems Journal
Architecture-based software reliability modeling
Journal of Systems and Software
A VALUE BASED BUSINESS PROCESS MANAGEMENT NETWORK MODEL
Journal of Integrated Design & Process Science
Hi-index | 0.08 |
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