Software TLB Management Method Based on Balanced Binary Tree

[1]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.MarinGMellorcrummeyJCross-architecture performance predictions for scientific applications using parameterized models[C]measurement and modeling of computer systems200432121310.1145/1005686.1005691Search in Google Scholar

[2]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.BonczPManegoldSKerstenM LDatabase Architecture Optimized for the New Bottleneck: Memory Access[C]very large data bases19995465Search in Google Scholar

[3]G.M. Adelson-Velsky, E.M. Landis, “An algorithm for the organization of information” 1962 30(1): 7-13G.M.Adelson-VelskyE.M.Landis, “An algorithm for the organization of information1962301713Search in Google Scholar

[4]Deb, Kalyanmoy, and Ram Bhushan Agrawal. “Simulated Binary Crossover for Continuous Search Space.” Complex Systems 1995.DebKalyanmoy, and Ram BhushanAgrawal. “Simulated Binary Crossover for Continuous Search Space.”Complex Systems1995Search in Google Scholar

[5]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.I. S.Jacobs and C. P.Bean, “Fine particles, thin films and exchange anisotropy,” inMagnetism, vol. IIIG. T.Rado and H.Suhl, Eds.New YorkAcademic1963, pp.27135010.1016/B978-0-12-575303-6.50013-0Search in Google Scholar

[6]M. Young, The Technical Writer’s Handbook. Mill Valley, CA: University Science, 1989.M.YoungThe Technical Writer’s HandbookMill Valley, CAUniversity Science1989Search in Google Scholar

[7]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.TalluriMHillM DSurpassing the TLB performance of superpages with less operating system support[C]architectural support for programming languages and operating systems1994291117118210.1145/195473.195531Search in Google Scholar

[8]Sleator, Daniel D., and Robert E. Tarjan. “Self-adjusting binary search trees.” Journal of the ACM 32.3 1985SleatorDaniel D., and Robert E.Tarjan. “Self-adjusting binary search trees.”Journal of the ACM323198510.1145/3828.3835Search in Google Scholar

[9]Rajwar R, Herlihy M, Lai K K, et al. Virtualizing Transactional Memory[C]. international symposium on computer architecture, 2005, 33(2): 494-505.RajwarRHerlihyMLaiK KVirtualizing Transactional Memory[C]international symposium on computer architecture200533249450510.1145/1080695.1070011Search in Google Scholar

[10]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.MenonASantosJ RTurnerYDiagnosing performance overheads in the xen virtual machine environment[C]virtual execution environments2005132310.1145/1064979.1064984Search in Google Scholar