Kota Ishibashi, Kotaro Yokoyama, Myungryun Yoo, T. Yokoyama
{"title":"A Real-Time Operating System with Location-Transparent Shared Resource Management for Multi-core Processors","authors":"Kota Ishibashi, Kotaro Yokoyama, Myungryun Yoo, T. Yokoyama","doi":"10.1109/ICESS.2016.25","DOIUrl":"https://doi.org/10.1109/ICESS.2016.25","url":null,"abstract":"This paper presents a real-time operating system (RTOS) that supports location-transparent shared resource management for multi-core embedded control systems. We modify the Multiprocessor Stack Resource Policy (MSRP) for the fixed priority scheduling of OSEK OS and extend an OSEK OS to provide location-transparent resource management based on the modified MSRP. Application tasks access local (intra-core) shared resources and inter-core shared resources using the same system calls. The RTOS also provides location-transparent inter-core and inter-node task management and event control. We have also confirmed that the performance of the RTOS is acceptable for practical embedded control systems.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124243310","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":"Analysis on Operating Model of Station-Less Shared Traffic System Based on Genetic Algorithm","authors":"Hong Li, Chen Wu, Zhengfeng Zhang, Guoqing Yang","doi":"10.1109/ICESS.2016.36","DOIUrl":"https://doi.org/10.1109/ICESS.2016.36","url":null,"abstract":"The station-less shared traffic system removes the restriction on rental and return at the predetermined stations. How to minimize the cost of vehicle maintenance and dispatch remains a big concern. This paper proposes a genetic algorithm based on the features of station-less shared traffic system to optimize the multi-objective problem to achieve minimized system deviation and cost, by redesigning coding method and fitness function. We took it into practice in the operation of smart cars in Zijingang Campus of Zhejiang University, making a schema which has the minimum deviation 6.2 and has at least 17.29% cost cut over other schemas having the same deviation.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122606884","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":"RandMap: Wear Level for Phase Change Memory Based on Layer-Based Random Mapping","authors":"W. Liu, Jia-Ju Bai, Yuping Wang","doi":"10.1109/ICESS.2016.28","DOIUrl":"https://doi.org/10.1109/ICESS.2016.28","url":null,"abstract":"Phase change memory (PCM) is a new kind of non-volatile storage. Compared to traditional memory, it has many advantages, such like lower-energy use, higher density and better scalability. PCM is supposed to replace DRAM and become the next generation of memory in embedded systems. However, PCM still has some disadvantages, such as the limitation of writing times. Although some approaches have been proposed to relieve these disadvantages, they can not well resist the malicious wear attacks. In this paper, we propose a practical approach named RandMap to achieve wear level in PCM. RandMap separates PCM into layers, and each layer uses its own random mapping table to achieve wear level when converting the logic address to physical address. When the writing time of a layer reaches the threshold, its random mapping table will be updated immediately. RandMap can implement wear level and enhance the ability of resisting malicious wear attacks, and it is available for large-size PCM. Our evaluation on SPEC2000 and SPEC2006 benchmarks shows that RandMap can improve the wear-level effect to 77.2% compared to previous approaches, and it can support the PCM size up to 16GB.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114297373","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}
Pengfei Yang, Quan Wang, Wei Li, Zhibin Yu, Hongwei Ye
{"title":"A Fault Tolerance NoC Topology and Adaptive Routing Algorithm","authors":"Pengfei Yang, Quan Wang, Wei Li, Zhibin Yu, Hongwei Ye","doi":"10.1109/ICESS.2016.20","DOIUrl":"https://doi.org/10.1109/ICESS.2016.20","url":null,"abstract":"The congestion in any regions or the faults in routing nodes, communication links and processing elements(PEs) will affect the NoC performance seriously in the multiprocessor system-on-chip (MPSoC) based on network on chip (NoC). In this paper, the NoC topology is designed which the fault tolerance function is enabled. Its dual-port network interface (NI) makes the key PE have two links with network at least, which can ensure high reliability of the system. The adaptive fault tolerant routing algorithm is also designed that could sense congestion on the network, and the routing nodes can well sense the congestion regions or error nodes on the network to work around the issues effectively. Experiment results demonstrate that the design proposed in this paper can ensure normal network communication and good system performance even if the congestion in routing nodes, communication links, processing elements, or any regions occurs.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132359704","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}
Quan Wang, Pengfei Yang, Yuanyuan Jiang, Ling Huang, Geyi Zhang
{"title":"A Topology Structure Repair Algorithm for Triangular Mesh Model","authors":"Quan Wang, Pengfei Yang, Yuanyuan Jiang, Ling Huang, Geyi Zhang","doi":"10.1109/ICESS.2016.23","DOIUrl":"https://doi.org/10.1109/ICESS.2016.23","url":null,"abstract":"Triangular mesh model built by existing surface reconstruction methods still have issues such as dislocation, serial hole, stitching and multilateral collinear. The model existing above-mentioned defects cannot generate standard STL file for 3D printing. To solve these problems, this paper propose a topology structure repair method for triangular mesh model, which containing four types detailed solutions targeting different topology errors. Moreover, in order to improve the effectiveness and superiority, we design a global error connected region and correlative data structure, which can achieve the aim of rapid detection and repair for different topology errors. The experiment results demonstrate that the method is effective in repairing irrational triangular mesh models.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133331499","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":"Proposing a Highly Reliable Real-Time Operating System for a Processor with a Fault Self-Detecting Mechanism","authors":"Hiroki Saito, Yoichi Tomioka, J. Kitamichi","doi":"10.1109/ICESS.2016.9","DOIUrl":"https://doi.org/10.1109/ICESS.2016.9","url":null,"abstract":"Presently, failures and malfunctions of embedded systems can cause serious problems. A highly safe and reliable system requires the ability to deal with failure and malfunction. Furthermore, the sophistication and complexity of real-time systems are increasing with the evolution of technology. We propose a highly reliable real-time operating system (RTOS). The proposed RTOS has a fault detection function for the MicroController Unit (MCU) for real-time applications. This paper reports on the development of an extended function and a fault detection function for RTOS for high-reliability systems. A self-test function of a system and a function that improves the reliability of the MCU are offered. Application Programming Interfaces (APIs) have been developed for fault detection. By developing and running application programs on the system with the developed RTOS, we confirm that the developed RTOS startups and switches multi-tasks and executes cyclic tasks by external timer interrupts. The fault detection function is evaluated using developed application programs. By evaluating the results, we confirm the reliability of the system by the self-test function.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133252190","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":"An Improved BLP Model with More Flexibility","authors":"Pengfei Yang, Quan Wang, Xin Mi, Jingwei Li","doi":"10.1109/ICESS.2016.32","DOIUrl":"https://doi.org/10.1109/ICESS.2016.32","url":null,"abstract":"BLP model is a classic security access control model, but its strict rules greatly limit practicality and flexibility of the model. An improved access model with much more flexibility than BLP model is proposed in this paper. Each subject of the model is assigned with a security level range and the security level can be modified according to the content of object dynamically. Comparing with traditional BLP model, the improved model manages a series of security levels which are distinguished by the security level of content been read. The subject can get the security level of each content segment, these contents formed the security level range with the security level of subject together. The improved model is secure because each content segment is meets the state transition functions of traditional BLP model. Eventually, an example is given to show that the improved model is more flexibility than Ott model.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129493872","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}
Yan Shen, Qixin Xu, Jie Zhang, Rong Zhang, Junke Li
{"title":"Target Tracking with Energy Efficiency Using Robotic Fish-based Sensor Networks","authors":"Yan Shen, Qixin Xu, Jie Zhang, Rong Zhang, Junke Li","doi":"10.1109/ICESS.2016.21","DOIUrl":"https://doi.org/10.1109/ICESS.2016.21","url":null,"abstract":"The achievements in underwater robotics and Wireless Sensor Networks make it possible to explore aquatic environment further. Target tracking which combines the mobility of underwater robotics with sensor networks has become an important application area in aquatic environment. This paper employs a Robotic Fish-based Sensor Network (RFSN) as mobile sensing platform to realize the target tracking. In order to guarantee the quality of the tracking, maintain the network connectivity, and consume as litter energy as possible, a novel approach for the target t racking is proposed. First, a locomotion model of fish is built by employing Lighthill's large-amplitude elongated-body theory and airfoil theory. Second, we define three functions with respect to the bias of the caudal fin based on the robotic fish dynamic characteristics and Kalman Filtering, which are the tracking quality function, the RFSN connectivity status function, and energy consumption function. Subsequently, the tracking problem can be transformed to a multi-objective optimization problem so that we get the individual control input of the fish which decides the fish how to swim. The simulation results show the effectiveness of our approach.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123738675","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}
Junke Li, Bing Guo, Yan Shen, Deguang Li, Yanhui Huang
{"title":"Low-Energy Kernel Scheduling Approach for Energy Saving","authors":"Junke Li, Bing Guo, Yan Shen, Deguang Li, Yanhui Huang","doi":"10.1109/ICESS.2016.29","DOIUrl":"https://doi.org/10.1109/ICESS.2016.29","url":null,"abstract":"To cope with the increasing scale of data, GPU (Graphic Processing Unit) is integrated with more and more cores to improve processing performance. High performance, however, is at the expense of sustained power consumption. Although current GPUs support concurrent kernel execution to relieve this problem, hardware resource utilization, category of kernels and the order of concurrent kernels issued to GPU will significantly impact on energy consumption of concurrent multi-kernels execution. An approach for considering these factors is presented, with the goal of reducing energy consumption by selecting appropriate kernels to be executed concurrently. Experiments show our proposed approach is effective and the results show that our approach can achieve maximum energy saving by 20.76% compared with sequential execution and can get maximum energy saving by 11.27% to typical approach.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122208025","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 Fault-Tolerant L1 Cache with Predictable Performance by Virtual Filter Cache","authors":"Huang Zhi-Bin, Hua-Dong Ma, Zhou Feng, Ding Yi","doi":"10.1109/ICESS.2016.31","DOIUrl":"https://doi.org/10.1109/ICESS.2016.31","url":null,"abstract":"The Subblock-Disabling schemes have obviousadvantages on delays overhead and capacity loss. However, theexistence of cache line \"holes\" triggers abundant false hits andthe utilization of available cache capacity is low. A subblockdisablingbased no-collision set-level mending cache architectureVFCcache suited for low set-associative L1 cache is proposed. AnAdditional Tag Array is added and VFCcache is logically dividedinto two parts, MainCache and Virtual Filter Cache (VFC). Theno-collision set-level mending mechanism maybe causes thedivergence of practical associativity and faulty sets. VFC canmask these faulty sets, alleviate such divergence and make theperformance predictable. According to the experiments in Simics, the performance has an increase of 11.73% compared to theBuddy Cache for a 32KB 4-way L1 cache with a failureprobability of 0.004. The average miss rate of the L1-D has adecrease of 5.20% and that of the L1-I has a decrease of 5.02%for 29 benchmarks from SPEC CPU2000/2006 in comparisonwith Buddy Cache.","PeriodicalId":444985,"journal":{"name":"2016 13th International Conference on Embedded Software and Systems (ICESS)","volume":"47 9-10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114033569","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}