{"title":"Formal Schedulability Analysis and Simulation for AADL","authors":"Shenglin Gui, Lei Luo, Yun Li, Lijie Wang","doi":"10.1109/ICESS.2008.63","DOIUrl":"https://doi.org/10.1109/ICESS.2008.63","url":null,"abstract":"With rapid developments in science and technology, we now see the ubiquitous use of different types of safety-critical systems in our daily lives such as in avionics, consumer electronics, and medical systems. In such systems, unintentional design faults might result in injury or even death to human beings. To make sure that safety-critical systems are really safe, only using the traditional methods is not enough. Model-Driven Architecture (MDA) method is becoming the mainstream as the instrument of the people. Architecture Analysis and Design Language (AADL) is a modeling language standard brought forward by the Society of Automotive Engineers, Avionics Systems Division, et al, is becoming a research topic for many organizations and institutes. It is a kind of MDA method also. For safety-critical systems, we must verify all the important properties whatever the method we use. Among the properties, the schedulability problem is a very important problem in the real-time software. But, how to solve the schedulability problem in a practical AADL project is a new obstacle to us. In this paper, we use the linear hybrid automata to abstract the semantics of the software components explicitly, then try to use TIMES tool developed by Uppsala Univ and Furness tool developed by Fremont Associates, LLC to simulate the semantics of linear hybrid automata and the scheduling execution trace of AADL software components respectively. Finally, we compare the two methods and make a conclusion.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114244334","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":"Byzantine Fault Tolerance for Electric Power Grid Monitoring and Control","authors":"Wenbing Zhao, F. E. Villaseca","doi":"10.1109/ICESS.2008.13","DOIUrl":"https://doi.org/10.1109/ICESS.2008.13","url":null,"abstract":"The stability of the electric power grid is crucial to every nation's security and well-being. As revealed by a number of large-scale blackout incidents in North America, the data communication infrastructure for power grid is in urgent need of transformation to modern technology. It has been shown by extensive research work that such blackout could have been avoided if there were more prompt information sharing and coordination among the power grid monitoring and control systems. In this paper, we point out the need for Byzantine fault tolerance and investigate the feasibility of applying Byzantine fault tolerance technology to ensure high degree of reliability and security of power grid monitoring and control. Our empirical study demonstrated that Byzantine fault tolerant monitoring and control can easily sustain the 60 Hz sampling rate needed for supervisory control and data acquisition (SCADA) operations with sub-millisecond response time under the local-area network environment. Byzantine fault tolerant monitoring and control is also feasible under the wide-area network environment for power grid applications that demand sub-second reaction time.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122873107","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}
Weinan Chen, Y. Wang, Xiao-Wei Wang, Chenglian Peng
{"title":"A New Placement Approach to Minimizing FPGA Reconfiguration Data","authors":"Weinan Chen, Y. Wang, Xiao-Wei Wang, Chenglian Peng","doi":"10.1109/ICESS.2008.20","DOIUrl":"https://doi.org/10.1109/ICESS.2008.20","url":null,"abstract":"Dynamic reconfiguration for fine-grained architectures is still associated with significant reconfiguration costs. In this paper, a new placement algorithm is proposed to reduce the size of FPGA reconfiguration bitstream. The algorithm is modified on the existing placement algorithm within VPR. It introduces the CLBs configuration of the previous circuit into cost function to increase similarity of CLBs configuration for subsequent circuits at the layout level. By using difference-based partial reconfiguration design flow, the proposed approach is validated by experiments on Xilinx Virtex FPGA platform, and experimental results show that the size of reconfiguration bitstream can be reduced.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133572156","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":"Power Management for Real-Time Embedded Systems on Block-Partitioned Multicore Platforms","authors":"Xuan Qi, Dakai Zhu","doi":"10.1109/ICESS.2008.43","DOIUrl":"https://doi.org/10.1109/ICESS.2008.43","url":null,"abstract":"Power management has become a very important research area and various approaches have been proposed. As an energy-efficient architecture, chip multiprocessor (CMP) has been widely adopted by chip manufacturers. In this paper, we study power management schemes for real-time systems on block-partitioned multicore platforms, where the processing cores are grouped into different blocks and cores on one block share the same power supply voltage (thus have the same frequency). We evaluate the energy efficiency of different block configurations. Simulation results show that block-partitioned CMP has its inherent advantages to fulfill the goal of power efficiency and low design complexity for future CMPs.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122401591","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":"Design a High-Performance Just-In-Time Compiler for a J2ME JVM on XScale","authors":"Xiaohua Shi, Maozhong Jin, B. Cheng, Peng Guo","doi":"10.1109/ICESS.2008.55","DOIUrl":"https://doi.org/10.1109/ICESS.2008.55","url":null,"abstract":"The just-in-time compilers have been widely adopted in J2SE and J2ME virtual machines. However, it is a big challenge for a JIT compiler to generate high-quality native code under the tight time and memory constraints on embedded systems. This paper presents the framework and key optimizations of a JIT compiler we designed for Intelpsilas J2ME virtual machine, namely XORP, for XScaletrade architecture. We describe the bytecode-based optimizations, e.g. bytecode inlining, Array Bounds Check Elimination, Null Pointer Check Elimination, etc., and some key optimizations aimed at XScaletrade architecture, e.g. instruction scheduling, etc., in the XORP JIT. XORP is more than 15 times faster than the reference implementation of J2ME CLDC, KVM, for EEMBC, with a 350KB executable file, including interpreter, JIT compiler, GC and all other JVM components. Comparing with other high-performance J2ME JVMs, like JeodeK and CLDC-HI, XORP is also at least 69% faster than them.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"13 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122626321","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":"The Research and Implementation of Reconfigurable Processor Architecture for Block Cipher Processing","authors":"Z. Dai, Wei Li, Xiaohui Yang, Tao Chen, Qiao Ren","doi":"10.1109/ICESS.2008.24","DOIUrl":"https://doi.org/10.1109/ICESS.2008.24","url":null,"abstract":"In the block ciphers, though the operation is quite complex, there are a lot of similar characteristics including arithmetic unit, operation width, parallel data and ordinal implement. It is very suitable for designing ASIP (application specific instruction set processor) targeted at block ciphers. In this thesis, a reconfigurable processor architecture is proposed, At the mean time, in order to improve instruction level parallelism. This thesis put forward the instruction bundle structure based on VLIW architecture, which supports word and sub-word parallel processing. As to the design of cipher arithmetic units, we adopt a specific design which is reconfigurable, so as to make the architecture have instruction level reconfigurable function. Besides, In order to solve the bottleneck of storage and access, this thesis adopt clustered technology to design two separated register files to storage data and subkey. Furthermore, this scheme reduces energy and clock cycles. A number of algorithms were implemented successfully on the processor. The prototype is realized using Alterapsilas FPGA. Synthesis, placement and routing of processor have accomplished under 0.18 mum CMOS technology through design complier tool. Compared with other ASIP targeted at block cipher, the results prove that processor can achieve relatively high performance in block cipher algorithms processing.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131039280","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":"Reliability Demonstration Testing Method for Safety-Critical Embedded Applications Software","authors":"Zhidong Qin, Hui Chen, Youqun Shi","doi":"10.1109/ICESS.2008.76","DOIUrl":"https://doi.org/10.1109/ICESS.2008.76","url":null,"abstract":"In order to solve the problem that the fixed duration testing method, which based on the classical statistics, canpsilat satisfy the requirements of reliability testing for modern safety-critical embedded applications software due to the long testing duration, a hierarchical reliability demonstration approach was provided in this paper. The method unified architecture-based reliability modeling, maximum entropy principle and Bayesian inference. Numeral simulation shows that it is effective to reduce the testing duration without decreasing the confidence level for the testing results.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127981384","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":"Design of Fuzzy Feed-forward Decoupling System based on FPGA","authors":"Yongqiang Guo, Kang-ling Fang, Hongjun Zhou","doi":"10.1109/ICESS.2008.51","DOIUrl":"https://doi.org/10.1109/ICESS.2008.51","url":null,"abstract":"Coupling is a common phenomenon in process control system, which will decrease the performance of control systems. And what's worse, if the coupling is serious, the system can not work[1]. Therefore, it is significant to research decoupling in the fields of control theory and project practice. Nowadays, decoupling is always implemented by software. However, this method canpsilat satisfy the controlled plant for high speed because of bad real-time effect. Conversely, adopting the hardware decoupling could control the objects timely. There are many ways to realize decoupling by hardware, FPGA is an ideal method. FPGA is a kind of field programmable logical component, which adopts the EDA technology and uses hardware describing language as an expression of logic. It has many traits, such as shorter developing periods, higher speed, upgradeable online, and is suitable for teamwork. A kind of fuzzy feed-forward decoupling algorithm based on error[2] is applied in this paper. On one hand, with adopting fuzzy control, the algorithm does not rely on a mathematic model, and is able close to non-linearity. On the other hand, the speed of algorithm based on error is faster than the decoupling arithmetic based on output.Based on the analyses of a lot of coupling phenomenons, a kind of fuzzy feed-forward decoupling controller based on FPGA is designed in this paper. As a carrier with FPGA, the controller has smaller size, higher reliability, lower consumption and so on. With adopting the method of converting software idea to hardware circuit, the controller could improve the response speed. This paper chooses different plants as researching objects in the course of simulation and practice. According to the experimental results, the decoupling effect of the controller is obvious, which provides a feasible way for the development of the decoupling technology.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129168315","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":"Research on the Self-localization of Wireless Sensor Networks","authors":"Xirong Bao, Shi Zhang, Dingyu Xue","doi":"10.1109/ICESS.2008.33","DOIUrl":"https://doi.org/10.1109/ICESS.2008.33","url":null,"abstract":"Self-localization is a key function in wireless sensor networks (WSNs). Many applications and internal mechanisms require nodes to know their location. Based on two different application environments and from the view of anchor nodes density, this paper proposes two new algorithms for distributed cooperative localization: Centroid-based with Preplaced Beacon Localization and Centroid-based with Scalable Node Localization. Both of them are simulated and analyzed in a two-dimensional (2-D) space simulation model of Matlab.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114524851","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":"The Optimal Kalman Type State Estimator with Multi-Step Correlated Process and Measurement Noises","authors":"An-qiu Fu, Yunmin Zhu, Enbin Song","doi":"10.1109/ICESS.2008.54","DOIUrl":"https://doi.org/10.1109/ICESS.2008.54","url":null,"abstract":"In this paper, an optimal Kalman type recursive state estimator is presented for the discrete time random dynamic system when the process noise and measurement noise are two-step correlated. Then, we extend it to the more general case of the process noise and measurement noise being n-step correlated. Finally, we verify that the Kalman type filter equation with one-step correlated process noise and measurement noise is globally optimal in the sense that its performance is the same as that of the optimal Mean Square Error state estimation using all observations from initial time up to now.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125248345","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}