Eigenvalues of LRU via a linear algebraic approach
| Autor: | Vijay G. Subramanian, Dengwang Tang |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Hardware_MEMORYSTRUCTURES
Markov chain Applied Mathematics 020206 networking & telecommunications 02 engineering and technology Management Science and Operations Research Industrial and Manufacturing Engineering Computer Science::Performance Algebra Computer Science::Hardware Architecture Chain (algebraic topology) Scheme (mathematics) Linear algebra 0202 electrical engineering electronic engineering information engineering Cache Algebraic number Cache algorithms Software Eigenvalues and eigenvectors Mathematics |
| Zdroj: | Operations Research Letters. 46:193-198 |
| ISSN: | 0167-6377 |
| DOI: | 10.1016/j.orl.2017.12.008 |
| Popis: | In this short paper we analyze the Markov Chain associated with Least Recently Used (LRU) cache replacement scheme. The eigenvalues and their multiplicities of this chain are determined using basic linear algebra along with induction. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect