{"title":"一种节省空间的磁盘预取算法","authors":"Junseok Park, K. Koh","doi":"10.1109/ICCSA.2007.60","DOIUrl":null,"url":null,"abstract":"With the increased computational capability and memory space of modern hard disk drives, it became possible to employ smarter on-disk prefetching algorithms. In this paper, we propose a novel on-disk prefetching algorithm which estimates whether the blocks are worth prefetching based on history, and decides to do read-ahead or not for each read request. Our work does not require modifying the standard I/O interface such as SCSI interface. Through trace-driven simulations, we show that our algorithm exhibits superior performance in terms of prefetch efficiency than the existing on-disk prefetching algorithm under mixed-media workload.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"652 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Space-efficient On-disk Prefetching Algorithm\",\"authors\":\"Junseok Park, K. Koh\",\"doi\":\"10.1109/ICCSA.2007.60\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increased computational capability and memory space of modern hard disk drives, it became possible to employ smarter on-disk prefetching algorithms. In this paper, we propose a novel on-disk prefetching algorithm which estimates whether the blocks are worth prefetching based on history, and decides to do read-ahead or not for each read request. Our work does not require modifying the standard I/O interface such as SCSI interface. Through trace-driven simulations, we show that our algorithm exhibits superior performance in terms of prefetch efficiency than the existing on-disk prefetching algorithm under mixed-media workload.\",\"PeriodicalId\":386960,\"journal\":{\"name\":\"2007 International Conference on Computational Science and its Applications (ICCSA 2007)\",\"volume\":\"652 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Science and its Applications (ICCSA 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSA.2007.60\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSA.2007.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
With the increased computational capability and memory space of modern hard disk drives, it became possible to employ smarter on-disk prefetching algorithms. In this paper, we propose a novel on-disk prefetching algorithm which estimates whether the blocks are worth prefetching based on history, and decides to do read-ahead or not for each read request. Our work does not require modifying the standard I/O interface such as SCSI interface. Through trace-driven simulations, we show that our algorithm exhibits superior performance in terms of prefetch efficiency than the existing on-disk prefetching algorithm under mixed-media workload.