Performance and area aware replacement policy for GPU architecture

@article{Abadi2014PerformanceAA,
  title={Performance and area aware replacement policy for GPU architecture},
  author={Fatemeh Kazemi Hassan Abadi and Saeed Safari},
  journal={2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)},
  year={2014},
  pages={497-503}
}
Recent studies have shown that cache partitioning is an efficient technique to improve throughput in multi-core processors. The existing cache partitioning algorithms assume Least Recently Used (LRU) as underlying replacement policy. We propose old Tree-based PLRU on two-level caches with higher speed up or performance matching of LRU at GPUs. The algorithm is based on Pseudo LRU that uses binary tree to reduce area overhead. Also, it uses set-dueling to dynamically adapt its insertion and… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

" Nvidia Cuda Sdk 2 . 3

  • J. Meng, D. Tarjan, +8 authors Geng Daniel Liu
  • Proceedings of IEEE International Symposium on…
  • 2012

Similar Papers

Loading similar papers…