Development of a new prediction algorithm and a simulator for the Predictive Read Cache (PRC)

Download
Author
Altmisdort, F. Nadir
Date
1996-09Advisor
Fouts, Douglas J.
Second Reader
Terman, Frederick W.
Metadata
Show full item recordAbstract
Efforts to bridge the cycle-time gap between high-end microprocessors and low-speed main memories have led to a hierarchical approach in memory subsystem design. The predictive read cache (PRC) has been developed as an alternative way to overcome the speed discrepancy without incurring the hardware cost of a second-level cache. Although the PRC can provide an improvement over a memory hierarchy using only a first-level cache, previous studies have shown that its performance is degraded due to the poor locality of reference caused by program branches, subroutine calls, and context switches. This thesis develops a new prediction algorithm that allows the PRC to track the miss patterns of the first-level cache, even with programs exhibiting poor locality. It presents PRC design alternatives and hardware cost estimates for the implementation of the new algorithm. The architectural support needed from the underlying microprocessor is also discussed. The second part of the thesis involves the development of a memory hierarchy simulator and an address-trace conversion program to perform trace-driven simulations of the PRC. Using address traces captured from a SPARC-based computer system, the simulations show that the new prediction algorithm provides a significant improvement in the PRC performance. This makes the PRC ideal for embedded systems in space-based, weapons-based and portable/mobile computing applications.
Rights
Copyright is reserved by the copyright owner.Collections
Related items
Showing items related by title, author, creator and subject.
-
An algorithm for enumerating the near-minimum weight s-t cuts of a graph Ahmet Balcioglu
Balcioglu, Ahmet (Monterey, California. Naval Postgraduate School, 2000-12);We provide an algorithm for enumerating near-minimum weight s-t cuts in directed and undirected graphs, with applications to network interdiction and network reliability. "Near-minimum" means within a factor of l+epilson ... -
Implementation of the page fault frequency replacement algorithm.
Lancaster, Alexander Eugene Jr. (Monterey, California. Naval Postgraduate School, 1973-06);This paper investigates the implementation of the page fault frequency (PFF) replacement algorithm as the mechanism for selecting and replacing pages of programs loaded into the main memory of a multiprocessing, ... -
CLUSTER-BASED SPECTRAL-SPATIAL SEGMENTATION OF HYPERSPECTRAL IMAGERY
Kennedy, Sean M. (Monterey, CA; Naval Postgraduate School, 2019-09);In this thesis, a three-stage algorithm for performing unsupervised segmentation of hyperspectral imagery is developed and tested. Based on a data-model derived from common sources of error inherent in all imaging ...