Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00057
Guillaume Carel, Ryunosuke Isshiki, Takuya Kusaka, Y. Nogami, Shunsuke Araki
The development of the autonomous driving and the connected services severely increase security threats on old automotive technologies that are still present on-board vehicles since the long incremental process were employed. For example, the Controller Area Network (CAN) bus, which was standardized in 1991, can be connected to modern Linux embedded computer nodes where evil attacker might be able to exploit a vulnerability on the nodes. However, it is not easy to implement countermeasures on the CAN bus, since the strict requirements and limited performances of CAN specification. That is one of the major reason for the new standard CAN Flexible Data-rate (CAN FD) has been released in 2012 by Bosch to fill the gap between these challenges and the CAN protocol. In this research, a new simple authentication protocol for CAN FD is proposed, and the protocol is evaluated by experiments. The results show that the proposed protocol prevents infected nodes from usurping identity of a critical node and forge messages, with practical computational complexity on modern low-power embedding boards.
{"title":"Design of a Message Authentication Protocol for CAN FD Based on Chaskey Lightweight MAC","authors":"Guillaume Carel, Ryunosuke Isshiki, Takuya Kusaka, Y. Nogami, Shunsuke Araki","doi":"10.1109/CANDARW.2018.00057","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00057","url":null,"abstract":"The development of the autonomous driving and the connected services severely increase security threats on old automotive technologies that are still present on-board vehicles since the long incremental process were employed. For example, the Controller Area Network (CAN) bus, which was standardized in 1991, can be connected to modern Linux embedded computer nodes where evil attacker might be able to exploit a vulnerability on the nodes. However, it is not easy to implement countermeasures on the CAN bus, since the strict requirements and limited performances of CAN specification. That is one of the major reason for the new standard CAN Flexible Data-rate (CAN FD) has been released in 2012 by Bosch to fill the gap between these challenges and the CAN protocol. In this research, a new simple authentication protocol for CAN FD is proposed, and the protocol is evaluated by experiments. The results show that the proposed protocol prevents infected nodes from usurping identity of a critical node and forge messages, with practical computational complexity on modern low-power embedding boards.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131677031","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00062
Wilbert Jethro R. Limjoco, N. Tiglao
Battery-operated Wireless Sensor Networks (WSNs) deployed in wide and remote areas are difficult to maintain as replacing their batteries in such scenarios is a daunting task. Thus, there is a need to make use of self-sustaining energy harvesting sensor nodes. However, the Routing Protocol for Low Power and Lossy Networks (RPL), the de facto standard routing protocol for WSNs, assumes that there is a constant supply of energy for all sensors, and that it does not use energy as its routing metric. Therefore, there is a need to modify RPL to factor in energy in its routing metric to improve the network lifetime. This study addresses this problem by dynamically converting the energy level of a node into an additive penalty to the ETX metric used by RPLs Minimum Rank Hysteresis Objective Function (MRHOF). RPL is modeled using a modified version of the Bellman-Ford algorithm. Assuming we use a lossless channel and we implement aggressive parent-switching, we have found out in our analytical model simulations that the Average Charge Cycle times and Time of First Node Death increase up to 2.5 times longer as compared to standard RPL for a simple, four node diamond topology. There is also the consequence of child nodes being disconnected from the network due to the energy balancing in the parent nodes, which lowers the total Packet Delivery Ratio up to 10% lower than standard RPL for the simple diamond topology. However, this is balanced out by the increase in Sending Rate of the parent nodes by up to 20% due to longer lifetimes. Thus, the total number of packets received from the entire network is up to 8% higher for the experiment topology.
{"title":"An Analytical Model of Energy-Aware RPL for Wireless Sensor Networks","authors":"Wilbert Jethro R. Limjoco, N. Tiglao","doi":"10.1109/CANDARW.2018.00062","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00062","url":null,"abstract":"Battery-operated Wireless Sensor Networks (WSNs) deployed in wide and remote areas are difficult to maintain as replacing their batteries in such scenarios is a daunting task. Thus, there is a need to make use of self-sustaining energy harvesting sensor nodes. However, the Routing Protocol for Low Power and Lossy Networks (RPL), the de facto standard routing protocol for WSNs, assumes that there is a constant supply of energy for all sensors, and that it does not use energy as its routing metric. Therefore, there is a need to modify RPL to factor in energy in its routing metric to improve the network lifetime. This study addresses this problem by dynamically converting the energy level of a node into an additive penalty to the ETX metric used by RPLs Minimum Rank Hysteresis Objective Function (MRHOF). RPL is modeled using a modified version of the Bellman-Ford algorithm. Assuming we use a lossless channel and we implement aggressive parent-switching, we have found out in our analytical model simulations that the Average Charge Cycle times and Time of First Node Death increase up to 2.5 times longer as compared to standard RPL for a simple, four node diamond topology. There is also the consequence of child nodes being disconnected from the network due to the energy balancing in the parent nodes, which lowers the total Packet Delivery Ratio up to 10% lower than standard RPL for the simple diamond topology. However, this is balanced out by the increase in Sending Rate of the parent nodes by up to 20% due to longer lifetimes. Thus, the total number of packets received from the entire network is up to 8% higher for the experiment topology.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793334","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00014
Takahiro Tomita, Jia Lee, T. Isokawa, F. Peper, N. Kamiura, T. Yumoto
This paper presents a cellular automaton-based model for a mechanical computer called 'Turing Tumble' computer. This computer uses mechanical reactions of a ball flowing down and mechanical components (such as gear and ramp) that are configured on the board, for its computation. A group of cells, called a supercell, is defined in the proposed model in order to represent simultaneous state transition of cells for implementing a chain reaction of connected gears. A small element with its memory called Converter is shown for an illustrative example on this model.
{"title":"Cellular Automaton Model for Turing Tumble Mechanical Computer","authors":"Takahiro Tomita, Jia Lee, T. Isokawa, F. Peper, N. Kamiura, T. Yumoto","doi":"10.1109/CANDARW.2018.00014","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00014","url":null,"abstract":"This paper presents a cellular automaton-based model for a mechanical computer called 'Turing Tumble' computer. This computer uses mechanical reactions of a ball flowing down and mechanical components (such as gear and ramp) that are configured on the board, for its computation. A group of cells, called a supercell, is defined in the proposed model in order to represent simultaneous state transition of cells for implementing a chain reaction of connected gears. A small element with its memory called Converter is shown for an illustrative example on this model.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123835091","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00088
Hiroki Ogawa, Eiji Takimoto, Koichi Mouri, S. Saito
A Third-Party Library(TPL) is often used in developing Android applications, however older TPLs may have vulnerabilities. Hence developers need to keep them in their applications the latest version. Nevertheless, there is a lot of applications using older TPLs. In this paper, we propose a new method which users enable to update TPLs in Android applications. An Android application and TPLs can be converted to smali file which is more of an assembly based language. A smali file can be replaced with another smali file on the same class. Our method takes advantage of its properties and exchanges a vulnerable TPL for an security fixed one. Moreover, we apply it to real applications and evaluate feasibility of it.
{"title":"User-Side Updating of Third-Party Libraries for Android Applications","authors":"Hiroki Ogawa, Eiji Takimoto, Koichi Mouri, S. Saito","doi":"10.1109/CANDARW.2018.00088","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00088","url":null,"abstract":"A Third-Party Library(TPL) is often used in developing Android applications, however older TPLs may have vulnerabilities. Hence developers need to keep them in their applications the latest version. Nevertheless, there is a lot of applications using older TPLs. In this paper, we propose a new method which users enable to update TPLs in Android applications. An Android application and TPLs can be converted to smali file which is more of an assembly based language. A smali file can be replaced with another smali file on the same class. Our method takes advantage of its properties and exchanges a vulnerable TPL for an security fixed one. Moreover, we apply it to real applications and evaluate feasibility of it.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115162520","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00053
Kazunori Mikami, K. Ono, J. Nonaka
The computational performance of scientific applications on HPC systems is often much lower than user expectation based on the system's maximum performance specifications. To understand the basis for this performance gap, a multi-perspective evaluation is important. For instance, from the user perspective, correlating the theoretical computation coded as a source program with the actual computation workload produced by the compilers is valuable. From the system perspective, evaluating the characteristics of microarchitecture elements such as processor core and memory is of significance. An open source library called PMlib was developed to address these types of synthetic evaluations. PMlib provides an avenue for reporting the arithmetic/application workload explicitly coded in the source program, as well as the actually executed system workload. It also provides detailed utilization reports of processor-specific hardware including the categorized SIMD instruction statistics, the layered cache hit/miss rate, and the effective memory bandwidth, which are captured via hardware performance counters (HWPC). Using PMlib, users can conduct a synthetic analysis of application performance, and obtain useful feedback for further optimized execution of applications.
{"title":"Performance Evaluation and Visualization of Scientific Applications Using PMlib","authors":"Kazunori Mikami, K. Ono, J. Nonaka","doi":"10.1109/CANDARW.2018.00053","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00053","url":null,"abstract":"The computational performance of scientific applications on HPC systems is often much lower than user expectation based on the system's maximum performance specifications. To understand the basis for this performance gap, a multi-perspective evaluation is important. For instance, from the user perspective, correlating the theoretical computation coded as a source program with the actual computation workload produced by the compilers is valuable. From the system perspective, evaluating the characteristics of microarchitecture elements such as processor core and memory is of significance. An open source library called PMlib was developed to address these types of synthetic evaluations. PMlib provides an avenue for reporting the arithmetic/application workload explicitly coded in the source program, as well as the actually executed system workload. It also provides detailed utilization reports of processor-specific hardware including the categorized SIMD instruction statistics, the layered cache hit/miss rate, and the effective memory bandwidth, which are captured via hardware performance counters (HWPC). Using PMlib, users can conduct a synthetic analysis of application performance, and obtain useful feedback for further optimized execution of applications.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133797930","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00015
Jia Lee, F. Peper, K. Leibnitz
Asynchronous cellular automata (ACAs) allow cells to change their states independently at random times. Nevertheless, whenever a cell is activated for state transition, its new state is decided by the state of the cell itself, together with the current states of all neighboring cells. This implies that the cell, from being activated till undergoing a transition, must access every neighbor to acquire their present states and complete all communications in due time. In this paper, we formalize a novel type of ACAs which use asynchronous communicating protocol to exchange states between neighboring cells. This enables a cell in the ACA to change the state based on some preceding states, rather than the current states, of each neighboring cell.
{"title":"Formalization of Asynchronous Cellular Automata Using Asynchronous Protocol for Communications","authors":"Jia Lee, F. Peper, K. Leibnitz","doi":"10.1109/CANDARW.2018.00015","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00015","url":null,"abstract":"Asynchronous cellular automata (ACAs) allow cells to change their states independently at random times. Nevertheless, whenever a cell is activated for state transition, its new state is decided by the state of the cell itself, together with the current states of all neighboring cells. This implies that the cell, from being activated till undergoing a transition, must access every neighbor to acquire their present states and complete all communications in due time. In this paper, we formalize a novel type of ACAs which use asynchronous communicating protocol to exchange states between neighboring cells. This enables a cell in the ACA to change the state based on some preceding states, rather than the current states, of each neighboring cell.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125626350","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00012
N. Kamikawa, H. Umeo
A cellular automaton (CA) is a well-studied non-linear computational model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. A sequence generation problem on the CA model has been studied for a long time and a lot of generation algorithms has been proposed for a variety of non-regular sequences such as {2^n | n = 1, 2, 3, ...}, prime, and Fibonacci sequences etc. In this paper, we study a real-time sequence generator for {n^3 | n=1, 2, 3,...}. In the previous studies, Kamikawa and Umeo(2018) showed that sequence {n^3 | n=1, 2, 3, ... } can be generated in real-time by an eight-state CA. We show a new six-state implementation of real-time sequence generator for {n^3 | n=1, 2, 3, ... } rather than reducing the internal state of the Kamikawa and Umeo's sequence generator and give a formal proof of the correctness of the generator.
{"title":"A Smaller-State Implementation of Real-Time Sequence Generator for {n^3 | n= 1, 2, 3,...}","authors":"N. Kamikawa, H. Umeo","doi":"10.1109/CANDARW.2018.00012","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00012","url":null,"abstract":"A cellular automaton (CA) is a well-studied non-linear computational model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. A sequence generation problem on the CA model has been studied for a long time and a lot of generation algorithms has been proposed for a variety of non-regular sequences such as {2^n | n = 1, 2, 3, ...}, prime, and Fibonacci sequences etc. In this paper, we study a real-time sequence generator for {n^3 | n=1, 2, 3,...}. In the previous studies, Kamikawa and Umeo(2018) showed that sequence {n^3 | n=1, 2, 3, ... } can be generated in real-time by an eight-state CA. We show a new six-state implementation of real-time sequence generator for {n^3 | n=1, 2, 3, ... } rather than reducing the internal state of the Kamikawa and Umeo's sequence generator and give a formal proof of the correctness of the generator.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124296465","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00073
Tomohiro Totoki, M. Koibuchi, H. Amano
HotSpot is an open source analysis tool for estimating temperature of both 2D and 3D chip stacks. It counts both the primary path of the heat transfer through the heat-sink and the secondary path through the print circuit board. It can estimate the temperature of chips. However, HotSpot-6.0 cannot treat a complicated chip stacking such as the castle of chips (CoC) with inductive wireless coupling through-chip interface (TCI). Therefore, in this report we have extended the HotSpot simulator and updated it in order to evaluate CoC. Compared to the original HotSpot, the extended version of HotSpot had an average execution time increase of about 6% when evaluating the same vertical stacking. The execution time of CoC with the same number of chips is shorter than when executing vertical stacking, but when the number of layers is the same, the execution time is almost equal. Moreover, our design considers high productivity, e.g. it can easily set air cooling, oil cooling, water cooling evaluation and chip rotation setting.
{"title":"An Extension of A Temperature Modeling Tool HotSpot 6.0 for Castle-of-Chips Stacking","authors":"Tomohiro Totoki, M. Koibuchi, H. Amano","doi":"10.1109/CANDARW.2018.00073","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00073","url":null,"abstract":"HotSpot is an open source analysis tool for estimating temperature of both 2D and 3D chip stacks. It counts both the primary path of the heat transfer through the heat-sink and the secondary path through the print circuit board. It can estimate the temperature of chips. However, HotSpot-6.0 cannot treat a complicated chip stacking such as the castle of chips (CoC) with inductive wireless coupling through-chip interface (TCI). Therefore, in this report we have extended the HotSpot simulator and updated it in order to evaluate CoC. Compared to the original HotSpot, the extended version of HotSpot had an average execution time increase of about 6% when evaluating the same vertical stacking. The execution time of CoC with the same number of chips is shorter than when executing vertical stacking, but when the number of layers is the same, the execution time is almost equal. Moreover, our design considers high productivity, e.g. it can easily set air cooling, oil cooling, water cooling evaluation and chip rotation setting.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131743747","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00024
Yao Hu, M. Koibuchi
A number of small parallel applications run on datacenters and supercomputers simultaneously. Job mapping becomes crucial to improving system utilization and application execution. Fragmentation of unused compute nodes could not be assigned for an incoming job since it may largely harm communication abilities between non-adjacent compute nodes. In this case, however, incoming jobs are likely to be pending on the overloaded system because they have to wait for the release of adjacent occupied compute nodes. In this study, we explore job mapping on random topology for the purpose of improving job scheduling ability. Ideally, a diverse application workload can be better supported disregarding its interconnection network topology with a certain time-space tradeoff. Our simulation results demonstrate that, over 3-D torus interconnection networks, the embedding of random topology performs better than that of 2-D mesh by 84% and seems comparable to that of 3-D mesh in terms of job scheduling performance. Over random topologies, the scheduling performance can be much improved by the embedding of random topologies especially for dealing with dozens of intensively incoming jobs. Overall, job mapping on random guest topology over random host topology presents the best job scheduling performance among all the cases in our evaluation.
{"title":"The Impact of Job Mapping on Random Network Topology","authors":"Yao Hu, M. Koibuchi","doi":"10.1109/CANDARW.2018.00024","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00024","url":null,"abstract":"A number of small parallel applications run on datacenters and supercomputers simultaneously. Job mapping becomes crucial to improving system utilization and application execution. Fragmentation of unused compute nodes could not be assigned for an incoming job since it may largely harm communication abilities between non-adjacent compute nodes. In this case, however, incoming jobs are likely to be pending on the overloaded system because they have to wait for the release of adjacent occupied compute nodes. In this study, we explore job mapping on random topology for the purpose of improving job scheduling ability. Ideally, a diverse application workload can be better supported disregarding its interconnection network topology with a certain time-space tradeoff. Our simulation results demonstrate that, over 3-D torus interconnection networks, the embedding of random topology performs better than that of 2-D mesh by 84% and seems comparable to that of 3-D mesh in terms of job scheduling performance. Over random topologies, the scheduling performance can be much improved by the embedding of random topologies especially for dealing with dozens of intensively incoming jobs. Overall, job mapping on random guest topology over random host topology presents the best job scheduling performance among all the cases in our evaluation.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114884269","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00035
Masao Yamamoto, Kohta Nakashima, Toshihiro Yamauchi, A. Nagoya, H. Taniguchi
To detect the performance anomaly of a computer, as a structure for continuous performance profiling, decentralization of the performance profiling system using virtual machines has been proposed. Moreover, there have already been evaluation results reported regarding overhead, including data storing, and data sampling stall time. On the other hand, for continuous performance profiling, the continuous processing of performance profiling is needed, including not only data sampling and data storing but also analysis processing. Therefore, first, this paper describes a relationship condition among data sampling time, data storing time, and analysis processing time as the necessary condition for continuous performance profiling on a decentralized performance profiling system. Second, in order to satisfy the relationship condition, we propose a concurrent operation technique as the acceleration method of analysis processing for a decentralized performance profiling system. Finally, this paper presents quantitative evaluations of the proposed method, including the case of a multi-VMM environment.
{"title":"Acceleration of Analysis Processing on Decentralized Performance Profiling System Using Virtual Machines","authors":"Masao Yamamoto, Kohta Nakashima, Toshihiro Yamauchi, A. Nagoya, H. Taniguchi","doi":"10.1109/CANDARW.2018.00035","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00035","url":null,"abstract":"To detect the performance anomaly of a computer, as a structure for continuous performance profiling, decentralization of the performance profiling system using virtual machines has been proposed. Moreover, there have already been evaluation results reported regarding overhead, including data storing, and data sampling stall time. On the other hand, for continuous performance profiling, the continuous processing of performance profiling is needed, including not only data sampling and data storing but also analysis processing. Therefore, first, this paper describes a relationship condition among data sampling time, data storing time, and analysis processing time as the necessary condition for continuous performance profiling on a decentralized performance profiling system. Second, in order to satisfy the relationship condition, we propose a concurrent operation technique as the acceleration method of analysis processing for a decentralized performance profiling system. Finally, this paper presents quantitative evaluations of the proposed method, including the case of a multi-VMM environment.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128033720","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：