{"title":"OpenVG路径和绘制算法在同步数据触发体系结构上的优化实现","authors":"Sheng Ma, Libo Huang, Zhiying Wang, Kui Dai","doi":"10.1109/NAS.2009.67","DOIUrl":null,"url":null,"abstract":"As a free application programming interface (API) for hardware-accelerated two-dimensional vector and raster graphics, OpenVG is becoming the standard for hardware development. This paper firstly proposes several optimization methods for OpenVG implementation, such as loop unrolling, operation transformation, function in lining, vectorization and address assignment, based on the hardware architecture and programming model of the Synchronous Data Triggered Architecture (SDTA). We then optimally realize the OpenVG path and paint algorithms on the SDTA with the direction of these methods and consideration of the algorithms’ characteristics. The analysis results show that the optimized OpenVG algorithms achieved 3-9 times speedups compared with original ones.","PeriodicalId":298759,"journal":{"name":"IEEE International Conference on Networking, Architecture and Storages","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Implementation of OpenVG Path and Paint Algorithms on Synchronous Data Triggered Architecture with Optimization\",\"authors\":\"Sheng Ma, Libo Huang, Zhiying Wang, Kui Dai\",\"doi\":\"10.1109/NAS.2009.67\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As a free application programming interface (API) for hardware-accelerated two-dimensional vector and raster graphics, OpenVG is becoming the standard for hardware development. This paper firstly proposes several optimization methods for OpenVG implementation, such as loop unrolling, operation transformation, function in lining, vectorization and address assignment, based on the hardware architecture and programming model of the Synchronous Data Triggered Architecture (SDTA). We then optimally realize the OpenVG path and paint algorithms on the SDTA with the direction of these methods and consideration of the algorithms’ characteristics. The analysis results show that the optimized OpenVG algorithms achieved 3-9 times speedups compared with original ones.\",\"PeriodicalId\":298759,\"journal\":{\"name\":\"IEEE International Conference on Networking, Architecture and Storages\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Networking, Architecture and Storages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAS.2009.67\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Networking, Architecture and Storages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2009.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Implementation of OpenVG Path and Paint Algorithms on Synchronous Data Triggered Architecture with Optimization
As a free application programming interface (API) for hardware-accelerated two-dimensional vector and raster graphics, OpenVG is becoming the standard for hardware development. This paper firstly proposes several optimization methods for OpenVG implementation, such as loop unrolling, operation transformation, function in lining, vectorization and address assignment, based on the hardware architecture and programming model of the Synchronous Data Triggered Architecture (SDTA). We then optimally realize the OpenVG path and paint algorithms on the SDTA with the direction of these methods and consideration of the algorithms’ characteristics. The analysis results show that the optimized OpenVG algorithms achieved 3-9 times speedups compared with original ones.