Preview

Translation lookaside buffer management

https://doi.org/10.21122/2309-4923-2019-4-20-24

Abstract

This paper focuses on the Translation Lookaside Buffer (TLB) management as part of memory management. TLB is an associative cache of the advanced processors, which reduces the overhead of the virtual to physical address translations. We consider challenges related to the design of the TLB management subsystem of the OS kernel on the example of the IA-32 platform and propose a simple model of complete and consistent policy of TLB management. This model can be used as a foundation for memory management subsystems design and verification.

About the Author

Y. I. Klimiankou
Belarusian State University of Informatics and Radioelectronics
Belarus
Software Engineer


References

1. Intel Corporation. IA-32 Intel Architecture Software Developer’s Manual. Volume 3: System Programming Guide. 245472–007. 2002.

2. Seal D. ARM Architecture Reference Manual. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2nd ed., 2000. ISBN 0201737191.

3. MIPS Technologies. MIPS32 Architecture for Programmers Volume III: The MIPS32 Privileged Resource Architecture, 0.95 ed., 2001.

4. Bryant R., O’Hallaron D. Computer systems: a programmer’s perspective. Prentice Hall, 2003. ISBN 9780130340740.

5. Mosberger D., Eranian S. IA-64 Linux Kernel: Design and Implementation. Prentice Hall PTR, Upper Saddle River, NJ, USA, 2001. ISBN 0130610143.

6. Gorman M. Understanding the Linux Virtual Memory Manager. Prentice Hall PTR, Upper Saddle River, NJ, USA, 2004. ISBN 0131453483.

7. Klimiankou Y. M-M/S-CD Memory Management: Conceptual and System Models – In: 2017 Ivannikov ISPRAS Open Conference (ISPRAS), 2017 – pp. 51–57.


Review

For citations:


Klimiankou Y.I. Translation lookaside buffer management. «System analysis and applied information science». 2019;(4):20-24. https://doi.org/10.21122/2309-4923-2019-4-20-24

Views: 838


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2309-4923 (Print)
ISSN 2414-0481 (Online)