{"title":"Hardware Supported Marking for Common Garbage Collections","authors":"S. Kawamura, Tomoaki Tsumura","doi":"10.1109/CANDAR.2016.0073","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0073","url":null,"abstract":"Many mobile systems have to achieve both high performance and low memory usage, and the total performance of such the systems can be largely affected by the effectiveness of GC. Hence, the recent popularization of mobile devices makes the GC performance play one of the important roles on the wide range of platforms. The response performance degradation which is caused by suspending all processes for GC has been a well known potential problem. Therefore, GC algorithms have been actively studied and improved, but they still have not reached any fundamental solution. In this paper, we focus on the point that the same objects are redundantly marked during the GC procedure that is implemented on DalvikVM, one of the famous runtime environments for the mobile devices. Then we propose a hardware support technique for improving marking routine of GC. We installed a set of tables to a processor for managing marked objects, and by referring these tables, redundant marking for marked objects can be omitted. The result of the simulation experiment shows that the execution cycles of GC are reduced by 20.7% at a maximum, and 10.2% on average.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121860321","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":"Proposal of Lambda Architecture Adoption for Real Time Predictive Maintenance","authors":"Y. Yamato, Hiroki Kumazaki, Yoshifumi Fukumoto","doi":"10.1109/CANDAR.2016.0130","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0130","url":null,"abstract":"Recently, IoT technologies have been progressed and applications of maintenance area are expected. However, IoT maintenance applications are not spread in Japan yet because of insufficient analysis of real time situation, high cost to collect sensing data and to configure failure detection rules. In this paper, using lambda architecture concept, we propose a maintenance platform in which edge nodes analyze sensing data, detect anomaly, extract a new detection rule in real time and a cloud orders maintenance automatically, also analyzes whole data collected by batch process in detail, updates learning model of edge nodes to improve analysis accuracy.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125220198","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":"Lightweight Hashing Using Lesamnta-LW Compression Function Mode and MDP Domain Extension","authors":"Asraf Akhimullah, Shoichi Hirose","doi":"10.1109/CANDAR.2016.0107","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0107","url":null,"abstract":"This paper presents a block-cipher-based hashing scheme suitable for resource constrained devices. It uses the Lesamnta-LW compression function mode and the MDP domain extension. Then, this paper provides provable security analyses of the proposed scheme. It is shown that the proposed scheme is both collision-resistant and preimage-resistant up to the birthday bound in the ideal cipher model. It is also shown that the proposed scheme in the keyed-via-IV mode is a pseudorandom function if the underlying block cipher is a pseudorandom permutation. These results imply that the proposed scheme has the same level of security as the original Lesamnta-LW hashing scheme. Unlike the original Lesamnta-LW hashing scheme, the keyed-via-IV mode of the proposed scheme does not require output truncation. This property is useful when the proposed scheme is used for pseudorandom sequence generation.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125903766","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":"Formulation of Energy Consumption in WSNs with Progress-Based Nearest Forwarding Policy","authors":"Sho Sasaki, Yuichi Miyaji, H. Uehara","doi":"10.1109/CANDAR.2016.0038","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0038","url":null,"abstract":"A large number of battery-driven sensor nodes are deployed to operate a wireless sensor network, and thus power saving of nodes is a problem of vital significance. Many routing methods have been proposed to reduce energy consumption. In light of this fact, if it can be known how much energy consumption will be required for sensor nodes to operate a network before deploying the nodes, it will help the insight into the energy-efficient network topology. In this paper, utilizing the stochastic-geometric analysis on hop-count distributions for random planar networks, the formulation of energy consumption in wireless sensor networks which employ the progress-based nearest forwarding is offered. The formulation enables us to show how much energy is required for all nodes in the network to forward sensed data in a pre-deployment phase. The evaluation results demonstrate that the derived analytical value can approximate the simulated cost with a deviation of approximately 10%. The discussion on the deviation is then made with geographical metrics.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129998703","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":"Zeta Function of a Class of Subshifts of Dyck Shift","authors":"Takao Namiki, K. Saito","doi":"10.1109/CANDAR.2016.0054","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0054","url":null,"abstract":"One-dimensional cellular automaton rule with conservative law frequently shows unique behavior on its attractor. To characterize the dynamics we have to know the structure of the attractor. In general, the attractor becomes Dyck shift with some restriction. If zeta function of the subshift is known, information on periodic configurations could be retreaved. In the present paper zeta function of Dyck shifts with 2N symbols and their restriction is given.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129250831","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 MPI-based Framework for Proessing Spatial Vector Data on Heterogeneous Distributed Systems","authors":"Kouichi Araki, Taiki Shimbo","doi":"10.1109/CANDAR.2016.0101","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0101","url":null,"abstract":"Geographic information system (GIS) is utilized in geomorphic analysis, hazard mapping, evacuation route planning and so on. Some GISs employ heterogeneous distributed systems consisting of dissimilar machines and cloud infrastructures because spatial vector data, which has the large number of vertex data, requires heavy spatial processing. However, it is difficult for spatial analysts and researchers to efficiently perform the spatial processing by such GISs because they need to consider load balance. Additionally, learning parallel programming, such as message passing interface (MPI), also is required. In this paper, to alleviate such burdens, we present an MPI-based framework that performs the spatial processing for the spatial vector data in the heterogeneous distributed systems. Our framework consists of an execution time predictor, schedulers and a wrapper library for hiding MPI programming. Our experimental results show that our framework is 12.9 times faster than sequential processing in our GIS consisting Amazon EC2 and a local cluster while the number of source code steps with our library is almost identical to that of the sequential version.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124560879","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}
I. Kawamata, Takuto Hosoya, Fumi Takabatake, K. Sugawara, S. Nomura, T. Isokawa, F. Peper, M. Hagiya, S. Murata
{"title":"Pattern Formation and Computation by Autonomous Chemical Reaction Diffusion Model Inspired by Cellular Automata","authors":"I. Kawamata, Takuto Hosoya, Fumi Takabatake, K. Sugawara, S. Nomura, T. Isokawa, F. Peper, M. Hagiya, S. Murata","doi":"10.1109/CANDAR.2016.0046","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0046","url":null,"abstract":"We introduce two autonomous chemical reaction-diffusion models that can emulate the behavior of specific cellular automata. One model conducts formation of a 3-color checker-board pattern using an abstract chemical reaction network. The other model is based on a DNA reaction-diffusion system that is capable of emulating a Turing-complete one-dimensional cellular automaton. These frameworks can be used to systematically program spatiotemporal pattern formation, and thus has a potential for an effective macro-scale control of molecular systems.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131485992","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}
Masayoshi Fujii, Yuuki Sato, Tomoaki Tsumura, Y. Nakashima
{"title":"Exploiting Bloom Filters for Saving Power Consumption of Auto-Memoization Processor","authors":"Masayoshi Fujii, Yuuki Sato, Tomoaki Tsumura, Y. Nakashima","doi":"10.1109/CANDAR.2016.0069","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0069","url":null,"abstract":"We have proposed a processor which can exploit valuelocalityinprogramsbyautomaticallyapplyingcomputation reuse. The processor which we call auto-memoization processor dynamically detects functions and loop iterations as reusable blocks, and stores their input sequences and results into a lookup table. When the current input sequence matches one of the stored input sequences on the table, the stored result associated with the matched input sequence is written back to the registers and caches. In the previous implementation, a part of the table is implemented with a CAM for achieving associative search for input matching with small overhead. However, CAMs consumeconsiderablylargeenergy, areaandmanufacturingcost. Therefore, CAM size should be as small as possible for improving practicality of the auto-memoization processor. In this paper, we propose a low-power implementation of the auto-memoization processor by utilizing a RAM and a Bloom filter. The result of the simulation experiment shows that power consumption of the table is reduced by 67.5% at a maximum and by 50.4% on average.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127051079","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 Serial Booth Multiplier Using Ring Oscillator","authors":"Daichi Okamoto, Masafumi Kondo, Tomoyuki Yokogawa, Yoshihiro Sejima, Kazutami Arimoto, Yoichiro Sato","doi":"10.1109/CANDAR.2016.0086","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0086","url":null,"abstract":"An increase of half-hearing person caused by progressive aging of society in our country leads to an increase in demand for a digital hearing aid with a DSP. Because of a hard physical limit for battery capacity which stems from its wearing form, the battery life of an existing digital hearing aid comes up to only about few days. In this paper, we proposed an implementation for a bit-serial multiplier for DSP in a hearing aid with high working frequency and low power consumption. To reduce the power consumption associated with clock generation, we use a ring oscillator to dynamically generate clock pulse only in the period of calculation. In addition, we adopt the Booth encoding to reduce the number of partial products in multiplication and reduce the calculation time and power consumption associated with it. We implement the proposed multiplier and show the effectiveness of it through the comparison experiments.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125463066","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}
Y. Hashi, Toshihiro Uchibayashi, Seira Hidano, S. Kiyomoto, A. Biswas, T. Suganuma, M. Hiji
{"title":"Data Protection for Cross-Border Live Migration in Multi-cloud Environment","authors":"Y. Hashi, Toshihiro Uchibayashi, Seira Hidano, S. Kiyomoto, A. Biswas, T. Suganuma, M. Hiji","doi":"10.1109/CANDAR.2016.0122","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0122","url":null,"abstract":"This paper presents a data protection mechanism for a live migration process. The proposed data protection mechanism verifies whether it is permissible for the data of an application of a movement source to be duplicated to a movement destination based on the contents of regulations related to data use issued by organizations and countries at the start of a live migration process. The mechanism executes live migration only when duplication is permitted. This mechanism makes appropriate data use possible while protecting privacy during a live migration process.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121514696","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}