摘要
本文介绍了红黑树在Linux内核下的应用,主要讨论了红黑树在Linux内核中对虚拟内存区域管理的实现。Linux内核中,虚拟内存区域的起始地址存储在红黑树的节点中,红黑树的高效操作使虚拟内存区域的删除、查找和插入的时间复杂度为O(logn)。
The paper introduces that the Red-Black tree is used in Linux kernel and discusses laow to accomplish the Red-Black tree in arranging virtual memory area .In Linux kemel ,the starting address of VAM are stored in nodes of Red-Black tree,thus ,the high performance of effectively operating Red-Black tree makes the time complexity of deleting,serching and inserting the VAM become O(logn).
出处
《科技信息》
2013年第23期91-91,102,共2页
Science & Technology Information