检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:邹彦良 殷树 ZOU Yaniang;YIN Shu(School of Information Science and Technology,ShanghaiTech University,Shanghai 201210,China;Shanghai Institute of Microsystem and Information Technology,Chinese Academy of Sciences,Shanghai 200050,China;University of Chinese Academy of Sciences,Beijing 100049,China)
机构地区:[1]上海科技大学信息科学与技术学院,上海201210 [2]中国科学院上海微系统与信息技术研究所,上海200050 [3]中国科学院大学,北京100049
出 处:《国防科技大学学报》2024年第2期215-223,共9页Journal of National University of Defense Technology
基 金:中国博士后科学基金资助项目(2015M572708);上海科技大学启动基金资助项目(2017F020300001)。
摘 要:为解决Linux内核传统路径检索日益凸显的开销问题,提出Staged Lookup以加速路径检索,通过动态缓存热目录来减少文件访问的时延。Staged Lookup的核心在于缓存频繁使用的目录项,从而避免从根节点重复遍历路径。不同于从根结点开始的检索操作,Staged Lookup扩展了搜索策略,允许从最近缓存的目录项向后或向前进行路径检索。在Linux内核版本3.14和5.4上部署Staged Lookup的原型,并开展实际系统测试。实验数据显示,相比于传统的路径检索方式,Staged Lookup能实现高达46.9%的性能提升。To solve the increasingly prominent cost of traditional path lookup strategy in the Linux kernel,Staged Lookup was proposed to accelerate path lookup by dynamically caching hot directories to reduce file access latency.The essence of Staged Lookup lay in caching frequently used directory entries,thus avoiding the repetitive traversal of paths from the root node.Unlike the retrieval operations that start from the root node,Staged Lookup expanded the search strategy to allow for forward or backward path lookup from the most recently cached directory entry.A prototype of Staged Lookup was deployed on Linux kernel versions 3.14 and 5.4 and subjected to real system tests.Experimental data indicates that Staged Lookup can achieve performance improvements of up to 46.9%compared to traditional path lookup methods.
分 类 号:TP31[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7