Based on a statistical analysis of actual computer program address traces, some results are presented of a study aimed at deriving empirically valid stochastic models for program reference patterns in a computer system operating under demand paging. For the address traces examined, a semi-Markov model for the (univariate) point process of page exceptions is formulated and found to be an adequate characterization of the data
Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the ti...
The trend in computer architecture is that processor speeds are increasing rapidly compared to memor...
Improving cache performance requires understanding cache behavior. However, measuring cache performa...
This paper is an analysis of program address trace data in a demand-paged computer system with a thr...
This paper investigates the questions of what statistical information about a memory request sequenc...
In demand paging virtual memory systems, the page fault rate of a process varies with the number of ...
When the parameters of a simple stochastic model of the memory referencing behavior of computer prog...
Projet MEVALIn this paper we propose a stochastic model of the sequence of memory references generat...
The locality of reference in program behavior has been studied and modeled extensively because of it...
A program's working set W(t, T) at time t is the set of distinct pages among the T most recentl...
Past studies of memory interference in multiprocessor systems have generally assumed that the refere...
ABSTRACT. The stochastic features of penetration attempts of computer virus are re-vealed. By studyi...
The article of record as published may be located at http://dx.doi.org/10.1214/13-AOAS703A novel app...
Current processors employ aggressive prediction mechanisms to improve performance and reduce power. ...
Because dynamic memory management is an important part of a large class of computer programs, high-p...
Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the ti...
The trend in computer architecture is that processor speeds are increasing rapidly compared to memor...
Improving cache performance requires understanding cache behavior. However, measuring cache performa...
This paper is an analysis of program address trace data in a demand-paged computer system with a thr...
This paper investigates the questions of what statistical information about a memory request sequenc...
In demand paging virtual memory systems, the page fault rate of a process varies with the number of ...
When the parameters of a simple stochastic model of the memory referencing behavior of computer prog...
Projet MEVALIn this paper we propose a stochastic model of the sequence of memory references generat...
The locality of reference in program behavior has been studied and modeled extensively because of it...
A program's working set W(t, T) at time t is the set of distinct pages among the T most recentl...
Past studies of memory interference in multiprocessor systems have generally assumed that the refere...
ABSTRACT. The stochastic features of penetration attempts of computer virus are re-vealed. By studyi...
The article of record as published may be located at http://dx.doi.org/10.1214/13-AOAS703A novel app...
Current processors employ aggressive prediction mechanisms to improve performance and reduce power. ...
Because dynamic memory management is an important part of a large class of computer programs, high-p...
Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the ti...
The trend in computer architecture is that processor speeds are increasing rapidly compared to memor...
Improving cache performance requires understanding cache behavior. However, measuring cache performa...