Mohd Rohaizat Abdul Wahab, Mohd Yunus Sharum, M. T. Abdullah, Mat Rofa Bin Ismail
{"title":"采用比例切割策略的缓存平衡","authors":"Mohd Rohaizat Abdul Wahab, Mohd Yunus Sharum, M. T. Abdullah, Mat Rofa Bin Ismail","doi":"10.1109/ISCI.2011.5958971","DOIUrl":null,"url":null,"abstract":"Caching mechanism had been widely used in many applications particularly in CPU optimization, internet application, data structure etc. Our research in text processing reveals that caching mechanism is also applicable to solve performance problem of text analyzers. In this paper we describe the strategy called ‘proportionate cutting’ for balancing (maintaining) limited size cache. Our experiment shows that by proportionate cutting at 0.5 threshold's value gives good performance to the cache. This actually allows of using limited cache in text processing with high frequency words.","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cache balancing with proportionate cutting strategy\",\"authors\":\"Mohd Rohaizat Abdul Wahab, Mohd Yunus Sharum, M. T. Abdullah, Mat Rofa Bin Ismail\",\"doi\":\"10.1109/ISCI.2011.5958971\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Caching mechanism had been widely used in many applications particularly in CPU optimization, internet application, data structure etc. Our research in text processing reveals that caching mechanism is also applicable to solve performance problem of text analyzers. In this paper we describe the strategy called ‘proportionate cutting’ for balancing (maintaining) limited size cache. Our experiment shows that by proportionate cutting at 0.5 threshold's value gives good performance to the cache. This actually allows of using limited cache in text processing with high frequency words.\",\"PeriodicalId\":166647,\"journal\":{\"name\":\"2011 IEEE Symposium on Computers & Informatics\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Symposium on Computers & Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCI.2011.5958971\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Symposium on Computers & Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCI.2011.5958971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cache balancing with proportionate cutting strategy
Caching mechanism had been widely used in many applications particularly in CPU optimization, internet application, data structure etc. Our research in text processing reveals that caching mechanism is also applicable to solve performance problem of text analyzers. In this paper we describe the strategy called ‘proportionate cutting’ for balancing (maintaining) limited size cache. Our experiment shows that by proportionate cutting at 0.5 threshold's value gives good performance to the cache. This actually allows of using limited cache in text processing with high frequency words.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
