{"title":"Adaptive Cache Allocation with Prefetching Policy over End-to-End Data Processing","authors":"H. Qin, Li Zhu","doi":"10.4236/JSIP.2017.83010","DOIUrl":null,"url":null,"abstract":"With the speed gap between storage system access and processor computing, \nend-to-end data processing has become a bottleneck to improve the total performance \nof computer systems over the Internet. Based on the analysis of data \nprocessing behavior, an adaptive cache organization scheme is proposed with \nfast address calculation. This scheme can make full use of the characteristics \nof stack space data access, adopt fast address calculation strategy, and reduce \nthe hit time of stack access. Adaptively, the stack cache can be turned off from \nbeginning to end, when a stack overflow occurs to avoid the effect of stack \nswitching on processor performance. Also, through the instruction cache and \nthe failure behavior for the data cache, a prefetching policy is developed, \nwhich is combined with the data capture of the failover queue state. Finally, \nthe proposed method can maintain the order of instruction and data access, \nwhich facilitates the extraction of prefetching in the end-to-end data processing.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"55 1","pages":"152-160"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Hiding and Multimedia Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4236/JSIP.2017.83010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0
Abstract
With the speed gap between storage system access and processor computing,
end-to-end data processing has become a bottleneck to improve the total performance
of computer systems over the Internet. Based on the analysis of data
processing behavior, an adaptive cache organization scheme is proposed with
fast address calculation. This scheme can make full use of the characteristics
of stack space data access, adopt fast address calculation strategy, and reduce
the hit time of stack access. Adaptively, the stack cache can be turned off from
beginning to end, when a stack overflow occurs to avoid the effect of stack
switching on processor performance. Also, through the instruction cache and
the failure behavior for the data cache, a prefetching policy is developed,
which is combined with the data capture of the failover queue state. Finally,
the proposed method can maintain the order of instruction and data access,
which facilitates the extraction of prefetching in the end-to-end data processing.