利用数据结构的增强来提高LRU页面替换算法的性能

C. C. Kavar, S. Parmar
{"title":"利用数据结构的增强来提高LRU页面替换算法的性能","authors":"C. C. Kavar, S. Parmar","doi":"10.1109/ICCCNT.2013.6726496","DOIUrl":null,"url":null,"abstract":"The process takes less time for handling instructions then would be speedy and efficient. The speed of the process is not only depends on architectural features and operational frequency, but also depends on the algorithm and data structure, which is used for that process. There are many page replacement algorithms such as least recently used (LRU), first-in-first-out (FIFO), Optimal and the combination of LRU and least frequently used (LFU) are available in memory management. We can improve the performance of page replacement algorithm either develop a new algorithm from scratch or using augmentation of data structure and algorithm design. In this paper we use augmented doubly circular link list, skip list, splay tree and hash table and apply all these on LRU page replacement algorithm. We implement all these augmented data structure with LRU page replacement algorithm and traced using Standard Performance Evaluation Corporation (SPEC) benchmark files. This paper show that augmentation of data structure can improve the performance of LRU page replacement algorithm.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improve the performance of LRU page replacement algorithm using augmentation of data structure\",\"authors\":\"C. C. Kavar, S. Parmar\",\"doi\":\"10.1109/ICCCNT.2013.6726496\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The process takes less time for handling instructions then would be speedy and efficient. The speed of the process is not only depends on architectural features and operational frequency, but also depends on the algorithm and data structure, which is used for that process. There are many page replacement algorithms such as least recently used (LRU), first-in-first-out (FIFO), Optimal and the combination of LRU and least frequently used (LFU) are available in memory management. We can improve the performance of page replacement algorithm either develop a new algorithm from scratch or using augmentation of data structure and algorithm design. In this paper we use augmented doubly circular link list, skip list, splay tree and hash table and apply all these on LRU page replacement algorithm. We implement all these augmented data structure with LRU page replacement algorithm and traced using Standard Performance Evaluation Corporation (SPEC) benchmark files. This paper show that augmentation of data structure can improve the performance of LRU page replacement algorithm.\",\"PeriodicalId\":6330,\"journal\":{\"name\":\"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCNT.2013.6726496\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCNT.2013.6726496","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

这个过程需要更少的时间来处理指令,然后将是快速和有效的。该过程的速度不仅取决于体系结构特征和操作频率,还取决于该过程所使用的算法和数据结构。在内存管理中有许多页面替换算法,如最近最少使用(LRU)、先进先出(FIFO)、最优以及LRU和最不常用(LFU)的组合。为了提高页面替换算法的性能,我们可以从零开始开发一种新的算法,也可以利用数据结构和算法设计的增强。本文将扩充双循环链表、跳跃表、展开树和哈希表应用于LRU页面替换算法。我们使用LRU页面替换算法实现所有这些增强的数据结构,并使用标准性能评估公司(SPEC)基准文件进行跟踪。本文表明,数据结构的增强可以提高LRU页面替换算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improve the performance of LRU page replacement algorithm using augmentation of data structure
The process takes less time for handling instructions then would be speedy and efficient. The speed of the process is not only depends on architectural features and operational frequency, but also depends on the algorithm and data structure, which is used for that process. There are many page replacement algorithms such as least recently used (LRU), first-in-first-out (FIFO), Optimal and the combination of LRU and least frequently used (LFU) are available in memory management. We can improve the performance of page replacement algorithm either develop a new algorithm from scratch or using augmentation of data structure and algorithm design. In this paper we use augmented doubly circular link list, skip list, splay tree and hash table and apply all these on LRU page replacement algorithm. We implement all these augmented data structure with LRU page replacement algorithm and traced using Standard Performance Evaluation Corporation (SPEC) benchmark files. This paper show that augmentation of data structure can improve the performance of LRU page replacement algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
“Multi-tenant SaaS cloud” Reduced order linear functional observers for large scale linear discrete-time control systems Multi pattern matching technique on fragmented and out-of-order packet streams for intrusion detection system Detection and tracking of moving objects by fuzzy textures Evacuation map generation using maze routing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1