{"title":"Advanced Topics on Embedded Computing","authors":"Keqiu Li","doi":"10.3233/JEC-2009-0101","DOIUrl":"https://doi.org/10.3233/JEC-2009-0101","url":null,"abstract":"This special issue consists of five manuscripts selected from the 2009 International Conference on Embedded Computing. All the papers took further review after extension. The first paper in this special issue is “A New Implementation Method of Timer for Periodic Tasks” by Zhigang Gao, Peifeng Zhang, Guojun Dai [1]. This work presents a new implementation of timer method for periodic tasks in real-time systems, called S-Method, which takes O (n) time overhead. While the traditional methods take O (","PeriodicalId":422048,"journal":{"name":"J. Embed. Comput.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122088930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Special issue of selected papers from EUC 2005","authors":"Youtao Zhang, Z. Shao","doi":"10.3233/JEC-2009-0073","DOIUrl":"https://doi.org/10.3233/JEC-2009-0073","url":null,"abstract":"This special issue includes the extended versions of seven best papers from the 2005 IFIP International Conference on Embedded And Ubiquitous Computing (EUC’2005), held in Nagasaki, Japan, in December 2005. The EUC 2005 conference included 114 papers from 376 submissions and provided the great opportunity to bring together engineers and researchers from academia, industry, and government to address a broad range of challenges and opportunities in the design and implementation of embedded and ubiquitous systems that impact every aspect of our daily lives. The selected seven papers take a snapshot of the state of the art research in the filed.","PeriodicalId":422048,"journal":{"name":"J. Embed. Comput.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128422084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A method to improve interrupt latency in real-time OS kernels","authors":"Hong Li, Qi Hu, Peifeng Zhang, Zhigang Gao","doi":"10.3233/JEC-2009-0106","DOIUrl":"https://doi.org/10.3233/JEC-2009-0106","url":null,"abstract":"Interrupt latency has great impact on the real time and predictability of real-time operating system kernels. In traditional implementation of real-time kernels, interrupts are frequently disabled in system service routines, critical sections, etc., which causes kernel interrupt latency. In this paper we propose a method called PIL (Predictive Interrupt Latency). PIL reduces interrupt latency by never disabling interrupts during any system service routines. Moreover, it makes interrupt latency vary little, which improves the predictability in the response time for external events. We have implemented the PIL method in an OSEK-compatible operating system - SmartOSEK OS. Experimental results show PIL improves real time and predictability of real-time systems with low time and space overheads.","PeriodicalId":422048,"journal":{"name":"J. Embed. Comput.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133146027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimizing parallelism for nested loops with iterational and instructional retiming","authors":"C. Xue, Z. Shao, Meilin Liu, Meikang Qiu, E. Sha","doi":"10.3233/JEC-2009-0076","DOIUrl":"https://doi.org/10.3233/JEC-2009-0076","url":null,"abstract":"Embedded systems have strict timing and code size requirements. Retiming is one of the most important optimization techniques to improve the execution time of loops by increasing the parallelism among successive loop iterations. Traditionally, retiming has been applied at instruction level to reduce cycle period for single loops. While multi-dimensional (MD) retiming can explore the outer loop parallelism, it introduces large overheads in loop index generation and code size due to loop transformation. In this paper, we propose a novel approach, that combines iterational retiming with instructional retiming to satisfy any given timing constraint by achieving full parallelism for iterations in a partition with minimal code size. The experimental results show that combining iterational retiming and instructional retiming, we can achieve 37% code size reduction comparing to applying iteration retiming alone.","PeriodicalId":422048,"journal":{"name":"J. Embed. Comput.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126791936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Durresi, V. Paruchuri, A. Durresi, L. Barolli, M. Takizawa
{"title":"A scalable anonymous protocol for heterogeneous wireless ad hoc networks","authors":"M. Durresi, V. Paruchuri, A. Durresi, L. Barolli, M. Takizawa","doi":"10.3233/JEC-2009-0080","DOIUrl":"https://doi.org/10.3233/JEC-2009-0080","url":null,"abstract":"Ensuring anonymity in wireless and hoc networks is a major security goal. Using traffic analysis, the attacker can compromise the network functionality by correlating data flow patterns to event locations/active areas. In this paper we present a novel Scalable Anonymous Protocol that hides the location of nodes and obscure the correlation between event zones and data flow from snooping adversaries. We quantify the anonymity strength of our protocol by introducing a new anonymity metric: Degree of Exposure Index. Our protocol is designed to offer flexible tradeoffs between degree of anonymity and communication-delay overhead.","PeriodicalId":422048,"journal":{"name":"J. Embed. Comput.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131076698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
