Jean-Loup Baer and Tien-Fu Chen. Dynamic improvements of locality in virtual memory systems. IEEE Transactions on Software Engineering, March 1976. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dead-Block Prediction Dead-Block Correlating Prefetchers - Lai, al. (2001) (4 citations) (Correct)
....a wide spectrum of applications. There are a number of prefetcher proposals in the literature that target generalized memory access patterns [5,3] including strided accesses, and indirect accesses to linked data structures and arrays. These proposals primarily rely on miss address correlation [1] as a technique to predict and prefetch memory addresses. These prefetchers, which we refer to as Miss Correlating Prefetchers (MCPs) record a history of prior L1 cache miss addresses, and correlate the history to a subsequent miss to trigger a prefetch. Unfortunately, MCPs suffer from several ....
Jean-Loup Baer and Tien-Fu Chen. Dynamic improvements of locality in virtual memory systems. IEEE Transactions on Software Engineering, March 1976.
Locality of Reference, Patterns in Program Behavior, Memory.. - Wilson (Correct)
....to exploit this information, by grouping virtual memory pages on disk in an order that will improve locality for future accesses. By ordering pages on disk in a way that reflects dynamic access patterns, and using sequential prefetching, it may be possible to fetch more useful data per seek. In [BS76], Baer and Sager attempted to apply this principle in simulations of a virtual memory system. Their simulated virtual memory system regrouped data at eviction time, grouping the four least recently used pages together in a block. Unfortunately, the results were disappointing. However, on ....
Jean-Loup Baer and Gary R. Sager. Dynamic improvement of locality in virtual memory systems. IEEE Transactions on Software Engineering, SE-2(1):54--62, March 1976. 58
Address Translation and Storage Management for Persistent Object.. - Kakkad (1997) (Correct)
....recorded. When the pages are (eventually) paged 183 out, they can be written to disk in a new order that reflects the recent access ordering. If future access orderings are correlated with past orderings, then this enables a very convenient form of prefetching. In the mid 1970 s, Baer and Sager [BS76] simulated a prefetching policy that relied on reorganizing pages on disk using the order of initial accesses by the program. Unfortunately, their results were disappointing; even though preliminary measures of locality indicated that previous page fault orderings were a good indicator of ....
Jean-Loup Baer and Gary R. Sager. Dynamic Improvement of Locality in Virtual Memory Systems. IEEE Transactions on Software Engineering, SE-2(1):54--62, March 1976.
Markov Prediction for Adaptive Network Memory Prefetching - Bartels (1998) (Correct)
....and CPU speeds, these advanced Markov and Markov based prediction schemes have not been viable for use in prefetching from secondary storage to memory for many years. It is interesting to note, however, that a very basic Markov like predictor was analyzed for memory prefetching as early as 1976 [BS76] However, with the addition of a new network memory layer to the memory hierarchy, applying imperfect prediction and prefetching to the virtual memory system has become an important avenue of research. 2.2 Prediction by Partial Matching Prediction is a learning problem: recognizing patterns in ....
Jean-Loup Baer and Gary R. Sager. Dynamic Improvement of Locality in Virtual Memory Systems. IEEE Transactions on Software Engineering, v. SE-2, no. 1, Mar. 1976.
Overlapping Execution with Transfer Using Non-Strict.. - Krintz, Calder, Lee.. (1998) (10 citations) (Correct)
....locality of their code. For example, if procedures are referenced at approximately the same time, then they are placed on the same page. Attempts to understand and exploit reference patterns of code and data have resulted in such algorithms as least recently used page replacement (e.g. see [2, 13]) and Denning s working set model [5] More recently, as memory sizes have increased, interest has shifted to improving both temporal and spatial locality for all levels of memory. Many software techniques have been developed for improving instruction cache performance. Techniques such as basic ....
Jean-Loup Baer and Gary R. Sager. Dynamic improvement of locality in virtual memory systems. IEEE Transactions on Software Engineering, SE-2(1):54--62, March 1976.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC