{"title":"实时系统嵌入式应用的低功耗数据结构设计","authors":"Linhua Jiang, Chao Peng, Haibin Cai, Yixiang Chen, Xiaodong Chen","doi":"10.1109/ISORCW.2012.13","DOIUrl":null,"url":null,"abstract":"In the widely used real-time and embedded systems, resources such as memory footprint, energy, are very limited. We try to find solutions -- in the context of data structure design- that are memory efficient and low power consumption in memory usage. We analyze various existing and creative new data structure implementations of a specific embedded application. Low memory cost, data accesses and power consumption are our main criteria during our data structure explorations. 2D and 3D Pareto curves are used to present the trade-off points of different data structure implementations. Thus, the relative optimal data structures can be discovered within the real-time constraints of the application.","PeriodicalId":408357,"journal":{"name":"2012 IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Low Power Consumption Data Structure Design for Embedded Applications in Real-Time Systems\",\"authors\":\"Linhua Jiang, Chao Peng, Haibin Cai, Yixiang Chen, Xiaodong Chen\",\"doi\":\"10.1109/ISORCW.2012.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the widely used real-time and embedded systems, resources such as memory footprint, energy, are very limited. We try to find solutions -- in the context of data structure design- that are memory efficient and low power consumption in memory usage. We analyze various existing and creative new data structure implementations of a specific embedded application. Low memory cost, data accesses and power consumption are our main criteria during our data structure explorations. 2D and 3D Pareto curves are used to present the trade-off points of different data structure implementations. Thus, the relative optimal data structures can be discovered within the real-time constraints of the application.\",\"PeriodicalId\":408357,\"journal\":{\"name\":\"2012 IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISORCW.2012.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORCW.2012.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low Power Consumption Data Structure Design for Embedded Applications in Real-Time Systems
In the widely used real-time and embedded systems, resources such as memory footprint, energy, are very limited. We try to find solutions -- in the context of data structure design- that are memory efficient and low power consumption in memory usage. We analyze various existing and creative new data structure implementations of a specific embedded application. Low memory cost, data accesses and power consumption are our main criteria during our data structure explorations. 2D and 3D Pareto curves are used to present the trade-off points of different data structure implementations. Thus, the relative optimal data structures can be discovered within the real-time constraints of the application.