{"title":"嵌入式Java硬件加速器中数组数据的预取","authors":"Yi-Ruei Wu, Yu-Sheng Chen, J. Shann","doi":"10.1109/VDAT.2009.5158170","DOIUrl":null,"url":null,"abstract":"For improving the efficiency of a program, it is important to reduce stalls caused by memory access. Traditional programs usually spend much time on memory stalls when accessing lower-level memory, and so do Java programs. In order to reduce memory stall time, prefetching is a feasible solution. We observed some obvious properties of array access so that we could prefetch array data by taking advantage of these properties. We analyzed these properties and proposed a suitable array prefetching mechanism for embedded Java hardware accelerators so as to reduce the time spent on memory stalls. Our approach eliminates about 25% of array stall time on average and even up to 50% for some array-based programs.","PeriodicalId":246670,"journal":{"name":"2009 International Symposium on VLSI Design, Automation and Test","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Prefetching for array data in embedded Java hardware accelerator\",\"authors\":\"Yi-Ruei Wu, Yu-Sheng Chen, J. Shann\",\"doi\":\"10.1109/VDAT.2009.5158170\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For improving the efficiency of a program, it is important to reduce stalls caused by memory access. Traditional programs usually spend much time on memory stalls when accessing lower-level memory, and so do Java programs. In order to reduce memory stall time, prefetching is a feasible solution. We observed some obvious properties of array access so that we could prefetch array data by taking advantage of these properties. We analyzed these properties and proposed a suitable array prefetching mechanism for embedded Java hardware accelerators so as to reduce the time spent on memory stalls. Our approach eliminates about 25% of array stall time on average and even up to 50% for some array-based programs.\",\"PeriodicalId\":246670,\"journal\":{\"name\":\"2009 International Symposium on VLSI Design, Automation and Test\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Symposium on VLSI Design, Automation and Test\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VDAT.2009.5158170\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Symposium on VLSI Design, Automation and Test","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VDAT.2009.5158170","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Prefetching for array data in embedded Java hardware accelerator
For improving the efficiency of a program, it is important to reduce stalls caused by memory access. Traditional programs usually spend much time on memory stalls when accessing lower-level memory, and so do Java programs. In order to reduce memory stall time, prefetching is a feasible solution. We observed some obvious properties of array access so that we could prefetch array data by taking advantage of these properties. We analyzed these properties and proposed a suitable array prefetching mechanism for embedded Java hardware accelerators so as to reduce the time spent on memory stalls. Our approach eliminates about 25% of array stall time on average and even up to 50% for some array-based programs.