Software TLB Management Method Based on Balanced Binary Tree
By:
References
- Marin G, Mellorcrummey J. Cross-architecture performance predictions for scientific applications using parameterized models[C]. measurement and modeling of computer systems, 2004, 32(1): 2-13.
- Boncz P, Manegold S, Kersten M L, et al. Database Architecture Optimized for the New Bottleneck: Memory Access[C]. very large data bases, 1999: 54-65.
- G.M. Adelson-Velsky, E.M. Landis, “An algorithm for the organization of information” 1962 30(1): 7-13
- Deb, Kalyanmoy, and Ram Bhushan Agrawal. “Simulated Binary Crossover for Continuous Search Space.” Complex Systems 1995.
- I. S. Jacobs and C. P. Bean, “Fine particles, thin films and exchange anisotropy,” in Magnetism, vol. III, G. T. Rado and H. Suhl, Eds. New York: Academic, 1963, pp. 271–350.
- M. Young, The Technical Writer’s Handbook. Mill Valley, CA: University Science, 1989.
- Talluri M, Hill M D. Surpassing the TLB performance of superpages with less operating system support[C]. architectural support for programming languages and operating systems, 1994, 29(11): 171-182.
- Sleator, Daniel D., and Robert E. Tarjan. “Self-adjusting binary search trees.” Journal of the ACM 32.3 1985
- Rajwar R, Herlihy M, Lai K K, et al. Virtualizing Transactional Memory[C]. international symposium on computer architecture, 2005, 33(2): 494-505.
- Menon A, Santos J R, Turner Y, et al. Diagnosing performance overheads in the xen virtual machine environment[C]. virtual execution environments, 2005: 13-23.
DOI: https://doi.org/10.21307/ijanmc-2020-037 | Journal eISSN: 2470-8038
Language: English
Page range: 50 - 57
Published on: Jan 11, 2021
Published by: Xi’an Technological University
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2021 Hongyu Chen, Li Zhao, Yuke Zhang, Jian Ai, published by Xi’an Technological University
This work is licensed under the Creative Commons Attribution 4.0 License.