Many multi-core processors nowadays employ a shared Last Level Cache (LLC). Partitioning LLC becomes more important as LLC is shared among the cores. Past research has demonstrated that the traditional least recently used (LRU) based partitioning cum replacement policy has adverse effects on parameters like instruction per cycle (IPC), miss rate and speedup. This leads to poor performance in an environment when multiple cores compete for one global LLC. Applications, enjoying locality of reference are purely benefited by LRU, however LRU fails for the applications showing working set size (WSS) large than the LLC size. In this work, we propose a scheme which allows cores to steal/donate their lines upto a threshold and give them a chance to adjust their partition when there is a miss. Instead of maintaining strict target partitioning, we introduce a flexible threshold window. Our evaluation with multiprogrammed workloads shows significant performance improvement.
{"title":"Towards a Better Cache Utilization Using Controlled Cache Partitioning","authors":"Prateek D. Halwe, Shirshendu Das, H. Kapoor","doi":"10.1109/DASC.2013.59","DOIUrl":"https://doi.org/10.1109/DASC.2013.59","url":null,"abstract":"Many multi-core processors nowadays employ a shared Last Level Cache (LLC). Partitioning LLC becomes more important as LLC is shared among the cores. Past research has demonstrated that the traditional least recently used (LRU) based partitioning cum replacement policy has adverse effects on parameters like instruction per cycle (IPC), miss rate and speedup. This leads to poor performance in an environment when multiple cores compete for one global LLC. Applications, enjoying locality of reference are purely benefited by LRU, however LRU fails for the applications showing working set size (WSS) large than the LLC size. In this work, we propose a scheme which allows cores to steal/donate their lines upto a threshold and give them a chance to adjust their partition when there is a miss. Instead of maintaining strict target partitioning, we introduce a flexible threshold window. Our evaluation with multiprogrammed workloads shows significant performance improvement.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132919947","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}
In order to apply high quality video communication in the mobile device with limited power and communication bandwidth, especially in wireless communication, an efficient solution for video communication should be proposed. So, the latest video coding standard, H.264/AVC, is used for Video Codec in mobile terminals. However, the H.264/AVC standard is much more complex than previous video coding standards because of utilizing improved inter and intra predication modes. In order to use the Video Codec in mobile devices, a high quality with low-cost interframe mode decision algorithm based on reducing redundant candidate modes and reducing reference frames for each block type by using coded macroblock (MB) information is proposed in this paper. From the results of our experiments, on average, our proposed algorithm can reduce 70.28% encoding time and decrease 0.97% bit rate (BR) with little quality loss.
{"title":"High Quality with Low-Cost H.264/AVC Interframe Mode Decision Algorithm for Wireless Network","authors":"Peicheng Wang, Yinbo Liu, Xingang Liu","doi":"10.1109/DASC.2013.95","DOIUrl":"https://doi.org/10.1109/DASC.2013.95","url":null,"abstract":"In order to apply high quality video communication in the mobile device with limited power and communication bandwidth, especially in wireless communication, an efficient solution for video communication should be proposed. So, the latest video coding standard, H.264/AVC, is used for Video Codec in mobile terminals. However, the H.264/AVC standard is much more complex than previous video coding standards because of utilizing improved inter and intra predication modes. In order to use the Video Codec in mobile devices, a high quality with low-cost interframe mode decision algorithm based on reducing redundant candidate modes and reducing reference frames for each block type by using coded macroblock (MB) information is proposed in this paper. From the results of our experiments, on average, our proposed algorithm can reduce 70.28% encoding time and decrease 0.97% bit rate (BR) with little quality loss.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116230850","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}
NAND Flash-based devices (e.g., Solid State Disks) emerge as popular storage devices with ultra-fast performance in embedded systems. Previously, write amplification (i.e., page program operation amplification), resulting from restriction operations (i.e., out-of-place update and erase-before-write operations) in NAND Flash, is an essential metric to evaluate excessive page program operations in NAND Flash space and write endurance of NAND Flash. However, overhead caused by read and erase operations is not taken into account by write amplification. This typical overhead gives rise to bad impacts on data reliability in NAND Flash space as long as scaling of NAND flash memory process technology. In this paper, we propose a new evaluation metric called Bamp to explore all behaviors amplification (i.e., read, program, and erase) in NAND Flash-based devices. We obtain the value of Bamp in the term of energy consumption when user data is written to devices. Given a write-dominated workload condition, there are also excessive read and erase operations besides extra program operations in storage devices of embedded systems. Therefore, write amplification cannot comprehensively evaluate amplification behaviors in NAND Flash-based devices based on given amounts of written data in workload. We employ a measurement system to obtain the values of Bamp for NAND Flash-based devices in the term of energy consumption under a workload condition. From experimental results, Bamp can provide comprehensive analysis overhead per user data written in a NAND Flash-based device in comparison to write amplification. In addition, using Bamp, we can apply a right NAND Flash-based device in embedded systems.
{"title":"Revisiting Behavior Amplification of NAND Flash-Based Storage Devices in Embedded Systems","authors":"Sun Hui, X. Fang, C. Xie, Fei Wu","doi":"10.1109/DASC.2013.76","DOIUrl":"https://doi.org/10.1109/DASC.2013.76","url":null,"abstract":"NAND Flash-based devices (e.g., Solid State Disks) emerge as popular storage devices with ultra-fast performance in embedded systems. Previously, write amplification (i.e., page program operation amplification), resulting from restriction operations (i.e., out-of-place update and erase-before-write operations) in NAND Flash, is an essential metric to evaluate excessive page program operations in NAND Flash space and write endurance of NAND Flash. However, overhead caused by read and erase operations is not taken into account by write amplification. This typical overhead gives rise to bad impacts on data reliability in NAND Flash space as long as scaling of NAND flash memory process technology. In this paper, we propose a new evaluation metric called Bamp to explore all behaviors amplification (i.e., read, program, and erase) in NAND Flash-based devices. We obtain the value of Bamp in the term of energy consumption when user data is written to devices. Given a write-dominated workload condition, there are also excessive read and erase operations besides extra program operations in storage devices of embedded systems. Therefore, write amplification cannot comprehensively evaluate amplification behaviors in NAND Flash-based devices based on given amounts of written data in workload. We employ a measurement system to obtain the values of Bamp for NAND Flash-based devices in the term of energy consumption under a workload condition. From experimental results, Bamp can provide comprehensive analysis overhead per user data written in a NAND Flash-based device in comparison to write amplification. In addition, using Bamp, we can apply a right NAND Flash-based device in embedded systems.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116238689","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}
This letter addresses the problem of feedback load reduction for opportunistic multicast scheduling (OMS) in OFDM-based systems. We investigate two scenarios, multicast service with large group size and multicast service with small group size, and derive two practical schemes respectively. The superiorities of the proposed schemes are: 1) no precise knowledge of the wireless fading channel is required, and 2) feedback load can be significantly reduced while the throughput performance remains comparable with the case of full feedback.
{"title":"Feedback Load Reduction Scheme for Opportunistic Multicast Scheduling in OFDM-Based Systems","authors":"Mingming Li, Xiaoxiang Wang, Jia Zhou","doi":"10.1109/DASC.2013.127","DOIUrl":"https://doi.org/10.1109/DASC.2013.127","url":null,"abstract":"This letter addresses the problem of feedback load reduction for opportunistic multicast scheduling (OMS) in OFDM-based systems. We investigate two scenarios, multicast service with large group size and multicast service with small group size, and derive two practical schemes respectively. The superiorities of the proposed schemes are: 1) no precise knowledge of the wireless fading channel is required, and 2) feedback load can be significantly reduced while the throughput performance remains comparable with the case of full feedback.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115294076","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}
In Service-Oriented Architecture (SOA), web services container demands to support QoS (Quality of Service) hierarchical control to provide the optimization of utilization for web services container as well as a guarantee of the QoS requirements of the services. With the spreading of SOA and the improvement of research in web service, the optimization for web services container is changing from solely seeking high performance to balancing utilization on multiple levels. Therefore, web services container needs to support QoS hierarchical control based on different measurements of utilization. In order to support QoS hierarchical control with multiple measurements of utilization, a representation method of web service QoS hierarchical control is proposed, which represents different QoS hierarchical control strategies with different measurements for utilization by a single standard. Based on the representation method, we present a QoS hierarchical control mixed strategy, which can support QoS hierarchical control with multiple measurements for utilization. Using the QoS hierarchical control mixed strategy, we realize a web services container. The result of the test shows that the web services container realized can support QoS hierarchical control with different measurements for utilization. The utilization of the service container significantly improves when the mixed strategy measures utilization from multiple perspectives, add the performance of which is slightly better than that of other QoS hierarchical control strategies that measures utilization from a single perspective.
在面向服务的体系结构(Service- oriented Architecture, SOA)中，web服务容器要求支持QoS (Quality of Service)分层控制，为web服务容器的利用提供优化，同时保证服务的QoS要求。随着SOA的普及和web服务研究的不断深入，web服务容器的优化正从单纯追求高性能转向在多个层次上平衡利用率。因此，web服务容器需要支持基于不同利用率度量的QoS分层控制。为了支持具有多个利用率度量的QoS分层控制，提出了一种web服务QoS分层控制的表示方法，该方法将具有不同利用率度量的不同QoS分层控制策略表示为单一标准。在表示方法的基础上，提出了一种QoS分层控制混合策略，该策略可以支持QoS分层控制的多度量利用率。采用QoS分层控制混合策略，实现了一个web服务容器。测试结果表明，所实现的web服务容器能够支持QoS分层控制，并采用不同的利用率度量。当混合策略从多个角度度量利用率时，服务容器的利用率显著提高，并且其性能略好于从单个角度度量利用率的其他QoS分层控制策略。
{"title":"A Web Services Container Supporting QoS Hierarchical Control with Multiple Measurements for Utilization","authors":"Zhe Wang, Dian-fu Ma, Yongwang Zhao","doi":"10.1109/DASC.2013.35","DOIUrl":"https://doi.org/10.1109/DASC.2013.35","url":null,"abstract":"In Service-Oriented Architecture (SOA), web services container demands to support QoS (Quality of Service) hierarchical control to provide the optimization of utilization for web services container as well as a guarantee of the QoS requirements of the services. With the spreading of SOA and the improvement of research in web service, the optimization for web services container is changing from solely seeking high performance to balancing utilization on multiple levels. Therefore, web services container needs to support QoS hierarchical control based on different measurements of utilization. In order to support QoS hierarchical control with multiple measurements of utilization, a representation method of web service QoS hierarchical control is proposed, which represents different QoS hierarchical control strategies with different measurements for utilization by a single standard. Based on the representation method, we present a QoS hierarchical control mixed strategy, which can support QoS hierarchical control with multiple measurements for utilization. Using the QoS hierarchical control mixed strategy, we realize a web services container. The result of the test shows that the web services container realized can support QoS hierarchical control with different measurements for utilization. The utilization of the service container significantly improves when the mixed strategy measures utilization from multiple perspectives, add the performance of which is slightly better than that of other QoS hierarchical control strategies that measures utilization from a single perspective.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115323902","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}
In-network caching as one of the primary components for ICN (information-centric network) has attracted more and more attentions. In this paper, we present a profit-based caching for ICN. The profit value for the content arriving on a router is determined by request popularity, distance to content source, content size and content duration, etc. The content duration is considered as an important factor in methodology to avoid the error caused by storing the overdue contents, which is the main difference from existing caching scheme. A 0-1 ILP (integer linear programming) is used to formulate whether to cache the coming content or not and eviction objects simultaneously. Also, a near-optimal heuristic algorithm is proposed to find profit-efficient cache decision, which can be quickly deployed. The analytical and simulation results show our profit-based caching scheme can attain a better network profit compare to Least Frequently used (LFU), and totally avoids caching withdrawing contents.
{"title":"Profit-Based Caching for Information-centric Network","authors":"Jie Duan, Xiong Wang, Sheng Wang, Shizhong Xu","doi":"10.1109/DASC.2013.111","DOIUrl":"https://doi.org/10.1109/DASC.2013.111","url":null,"abstract":"In-network caching as one of the primary components for ICN (information-centric network) has attracted more and more attentions. In this paper, we present a profit-based caching for ICN. The profit value for the content arriving on a router is determined by request popularity, distance to content source, content size and content duration, etc. The content duration is considered as an important factor in methodology to avoid the error caused by storing the overdue contents, which is the main difference from existing caching scheme. A 0-1 ILP (integer linear programming) is used to formulate whether to cache the coming content or not and eviction objects simultaneously. Also, a near-optimal heuristic algorithm is proposed to find profit-efficient cache decision, which can be quickly deployed. The analytical and simulation results show our profit-based caching scheme can attain a better network profit compare to Least Frequently used (LFU), and totally avoids caching withdrawing contents.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123602336","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}
Wenge Rong, Rifan Li, Hao Sheng, Y. Ouyang, Zhang Xiong
Nowadays a large amount of data on the web are stored in relational database (RDB). How to effectively map these data to ontology has become one of the most important challenges in semantic web. Several efforts have been conducted in this area and direct mapping (DM) is a notable one as the W3C candidate recommendation. Though DM has shown its effectiveness, it still faces a lot of challenges. Its performance in term of storage space and time complexity will become worse when RDBS is becoming big and updating frequently. Furthermore, it cannot satisfy monotonicity and semantics preservation at the same time. In this paper, inspired by the idea of ontology-based data access (OBDA), a mechanism is proposed where database is accessed via description logic (DL) ontology and a real TBox and mapping file will be generated accordingly. This method can achieve similar function compared to standard ontology like OWL. The experimental study has shown that it can provide better performance with regard to the storage space and ontology generation time. It has also shown its capability in supporting rapid query process. Different from the other methods which generate virtue RDF data, the proposed approach can also support adding rules, which will enhance the semantic expression ability of the knowledge base.
{"title":"Combination of DM and OBDA for Ontology Generation from Relational Database","authors":"Wenge Rong, Rifan Li, Hao Sheng, Y. Ouyang, Zhang Xiong","doi":"10.1109/DASC.2013.94","DOIUrl":"https://doi.org/10.1109/DASC.2013.94","url":null,"abstract":"Nowadays a large amount of data on the web are stored in relational database (RDB). How to effectively map these data to ontology has become one of the most important challenges in semantic web. Several efforts have been conducted in this area and direct mapping (DM) is a notable one as the W3C candidate recommendation. Though DM has shown its effectiveness, it still faces a lot of challenges. Its performance in term of storage space and time complexity will become worse when RDBS is becoming big and updating frequently. Furthermore, it cannot satisfy monotonicity and semantics preservation at the same time. In this paper, inspired by the idea of ontology-based data access (OBDA), a mechanism is proposed where database is accessed via description logic (DL) ontology and a real TBox and mapping file will be generated accordingly. This method can achieve similar function compared to standard ontology like OWL. The experimental study has shown that it can provide better performance with regard to the storage space and ontology generation time. It has also shown its capability in supporting rapid query process. Different from the other methods which generate virtue RDF data, the proposed approach can also support adding rules, which will enhance the semantic expression ability of the knowledge base.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121591107","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}
Users will handover between spot-beam frequently when Low Earth Orbit (LEO) satellite moves round the earth, so proper channel reservation strategy should be applied to reduce call dropping probability. A channel status-based reservation strategy (CSRS) is proposed for multimedia LEO satellite network in this paper. Considering that the channel locking time is very long in the Guaranteed Handover (GH) algorithm, the proposed method sets reservation time adaptively for different users according to the status of cell so as to utilize the resource more effectively. Simulation results show that the proposed strategy can reserve channel adaptively for different users and reduce handoff call dropping probability and new call blocking probability, while also improve resource utilization.
{"title":"The Research of Channel Reservation Strategy in LEO Satellite Network","authors":"Xiaolong Wang, Xiaoxiang Wang","doi":"10.1109/DASC.2013.131","DOIUrl":"https://doi.org/10.1109/DASC.2013.131","url":null,"abstract":"Users will handover between spot-beam frequently when Low Earth Orbit (LEO) satellite moves round the earth, so proper channel reservation strategy should be applied to reduce call dropping probability. A channel status-based reservation strategy (CSRS) is proposed for multimedia LEO satellite network in this paper. Considering that the channel locking time is very long in the Guaranteed Handover (GH) algorithm, the proposed method sets reservation time adaptively for different users according to the status of cell so as to utilize the resource more effectively. Simulation results show that the proposed strategy can reserve channel adaptively for different users and reduce handoff call dropping probability and new call blocking probability, while also improve resource utilization.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116442787","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}
Jianhua Che, Wei-Min Yao, Shougang Ren, Haoyun Wang
The network I/O operations of a guest domain spend Domain0's processor resource as well as its own processor resource. If no control is placed on the network I/O operations of guest domains, Xen system will likely overload when executing network I/O-intensive workload. To resolve this problem, the allowable network I/O request number of Xen system should be firstly figured out. This paper illuminated the characteristic of Xen system in handling the network I/O operations of guest domains with two experimental results, and established several performance analyzing and predicting models by studying the network I/O procedure and the processor resource consumption distribution of Xen system. These models can compute the allowable number of guest domains with fixed network I/O request number or the allowable network I/O request number of each guest domain based on all idle processor resource of Xen system, and prevent Xen system from overloading. Finally, the applicability of these models is preliminarily analyzed.
{"title":"Performance Analyzing and Predicting of Network I/O in Xen System","authors":"Jianhua Che, Wei-Min Yao, Shougang Ren, Haoyun Wang","doi":"10.1109/DASC.2013.139","DOIUrl":"https://doi.org/10.1109/DASC.2013.139","url":null,"abstract":"The network I/O operations of a guest domain spend Domain0's processor resource as well as its own processor resource. If no control is placed on the network I/O operations of guest domains, Xen system will likely overload when executing network I/O-intensive workload. To resolve this problem, the allowable network I/O request number of Xen system should be firstly figured out. This paper illuminated the characteristic of Xen system in handling the network I/O operations of guest domains with two experimental results, and established several performance analyzing and predicting models by studying the network I/O procedure and the processor resource consumption distribution of Xen system. These models can compute the allowable number of guest domains with fixed network I/O request number or the allowable network I/O request number of each guest domain based on all idle processor resource of Xen system, and prevent Xen system from overloading. Finally, the applicability of these models is preliminarily analyzed.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125347039","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}
As present, Differential Power Analysis (DPA) attack sample the power consumption information of chips using an oscilloscope which sample frequency is much larger than system global clock speed. Through the simulation of the S-box circuit in Advanced Encryption Standard (AES) and differential analysis of power consumption data, we find that, when reached an amount, the sample frequency's increasing has slight influence on the DPA. Yet when the sample frequency decreases, the cost data collected by the collection points tends to be random, which results in the correlation between the measurements of the power and the data being processed is not well revealed. Under the precondition of not impacting the effect of DPA, proper reduction in the sample frequency will not only compress the data but also increase the number of power trace. Thus the effect of the DPA is strengthened. Meanwhile, the cost of design the sampling system is reduced, which leaves more space for the improvement of the accuracy of the sampling system.
{"title":"Research on the Relationship between the Effect of DPA and Differential Sample Frequency","authors":"Ruicong Ma, Daheng Yue, Shaoqing Li, Jihua Chen","doi":"10.1109/DASC.2013.43","DOIUrl":"https://doi.org/10.1109/DASC.2013.43","url":null,"abstract":"As present, Differential Power Analysis (DPA) attack sample the power consumption information of chips using an oscilloscope which sample frequency is much larger than system global clock speed. Through the simulation of the S-box circuit in Advanced Encryption Standard (AES) and differential analysis of power consumption data, we find that, when reached an amount, the sample frequency's increasing has slight influence on the DPA. Yet when the sample frequency decreases, the cost data collected by the collection points tends to be random, which results in the correlation between the measurements of the power and the data being processed is not well revealed. Under the precondition of not impacting the effect of DPA, proper reduction in the sample frequency will not only compress the data but also increase the number of power trace. Thus the effect of the DPA is strengthened. Meanwhile, the cost of design the sampling system is reduced, which leaves more space for the improvement of the accuracy of the sampling system.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128343357","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
扫码关注我们
求助内容：
应助结果提醒方式：