Pub Date : 2024-04-19DOI: 10.1109/TSUSC.2024.3391733
Guhui Li;Zidong Wang;Xingzhen Bai;Zhongyi Zhao
This paper is concerned with the set-membership state estimation problem for power harmonics under quantization effects by using the dynamic event-triggered mechanism. The underlying system is subject to unknown but bounded noises that are confined to a sequence of zonotopes. The data transmissions are realized over a digital communication channel, where the measurement signals are quantized by a logarithmic-uniform quantizer before being transmitted from the sensors to the remote estimator. Moreover, a dynamic event-triggered mechanism is introduced to reduce the number of unnecessary data transmissions, thereby relieving the communication burden. The objective of this paper is to design a zonotopic set-membership estimator for power harmonics with guaranteed estimation performance in the simultaneous presence of: 1) unknown but bounded noises; 2) quantization effects; and 3) dynamic event-triggered executions. By resorting to the mathematical induction method, a unified set-membership estimation framework is established, within which a family of zonotopic sets is first derived that contains the estimation errors and, subsequently, the estimator gain matrices are designed by minimizing the $F$ -radii of these zonotopic sets. The effectiveness of the proposed estimation scheme is verified by a series of simulation experiments.
{"title":"Dynamic Event-Triggered State Estimation for Power Harmonics With Quantization Effects: A Zonotopic Set-Membership Approach","authors":"Guhui Li;Zidong Wang;Xingzhen Bai;Zhongyi Zhao","doi":"10.1109/TSUSC.2024.3391733","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3391733","url":null,"abstract":"This paper is concerned with the set-membership state estimation problem for power harmonics under quantization effects by using the dynamic event-triggered mechanism. The underlying system is subject to unknown but bounded noises that are confined to a sequence of zonotopes. The data transmissions are realized over a digital communication channel, where the measurement signals are quantized by a logarithmic-uniform quantizer before being transmitted from the sensors to the remote estimator. Moreover, a dynamic event-triggered mechanism is introduced to reduce the number of unnecessary data transmissions, thereby relieving the communication burden. The objective of this paper is to design a zonotopic set-membership estimator for power harmonics with guaranteed estimation performance in the simultaneous presence of: 1) unknown but bounded noises; 2) quantization effects; and 3) dynamic event-triggered executions. By resorting to the mathematical induction method, a unified set-membership estimation framework is established, within which a family of zonotopic sets is first derived that contains the estimation errors and, subsequently, the estimator gain matrices are designed by minimizing the \u0000<inline-formula><tex-math>$F$</tex-math></inline-formula>\u0000-radii of these zonotopic sets. The effectiveness of the proposed estimation scheme is verified by a series of simulation experiments.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 5","pages":"803-813"},"PeriodicalIF":3.0,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142397226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The rapid advancement of mobile edge computing (MEC) has revolutionized the distributed computing landscape. With the help of MEC, the traditional centralized cloud computing architecture can be extended to the edge of networks, enabling real-time processing of resources and time-sensitive applications. Nevertheless, the problem of efficiently assigning the services to the computing resources is a challenging and prevalent issue due to the dynamic and distributed nature of the edge network's architecture. Thus, we require intelligent real-time decision-making and effective optimization algorithms to allocate resources, such as network bandwidth, memory, and CPU. This paper proposes an MEC architecture to allocate the resources in the network to optimize the quality of services (QoS). In this regard, the resource allocation problem is formulated as a bi-objective optimization problem, including minimizing cost and energy with quality and deadline constraints. A hybrid cascading-based meta-heuristic called GA-PSO is embedded with the proposed MEC architecture to achieve these objectives. Finally, it is compared with three existing approaches to establish its efficacy. The experimental results report statistically better cost and energy in all the considered instances, making it practical and validating its effectiveness.
{"title":"Deadline-Aware Cost and Energy Efficient Offloading in Mobile Edge Computing","authors":"Mohit Kumar;Avadh Kishor;Pramod Kumar Singh;Kalka Dubey","doi":"10.1109/TSUSC.2024.3381841","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3381841","url":null,"abstract":"The rapid advancement of mobile edge computing (MEC) has revolutionized the distributed computing landscape. With the help of MEC, the traditional centralized cloud computing architecture can be extended to the edge of networks, enabling real-time processing of resources and time-sensitive applications. Nevertheless, the problem of efficiently assigning the services to the computing resources is a challenging and prevalent issue due to the dynamic and distributed nature of the edge network's architecture. Thus, we require intelligent real-time decision-making and effective optimization algorithms to allocate resources, such as network bandwidth, memory, and CPU. This paper proposes an MEC architecture to allocate the resources in the network to optimize the quality of services (QoS). In this regard, the resource allocation problem is formulated as a bi-objective optimization problem, including minimizing cost and energy with quality and deadline constraints. A hybrid cascading-based meta-heuristic called GA-PSO is embedded with the proposed MEC architecture to achieve these objectives. Finally, it is compared with three existing approaches to establish its efficacy. The experimental results report statistically better cost and energy in all the considered instances, making it practical and validating its effectiveness.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 5","pages":"778-789"},"PeriodicalIF":3.0,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142397224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-20DOI: 10.1109/TSUSC.2024.3379550
Duc Van Le;Jing Zhou;Rongrong Wang;Rui Tan;Fei Duan
Data centers (DCs) are power-intensive facilities which use a significant amount of energy for cooling the servers. Increasing the temperature and relative humidity (RH) setpoints is a rule-of-thumb approach to reducing the DC energy usage. However, the high temperature and RH may undermine the server's reliability. Before we can choose the proper temperature and RH settings, it is essential to understand how the temperature and RH setpoints affect the DC power usage and server's reliability. To this end, we constructed and experimented with an air-cooled DC testbed in Singapore, which consists of a direct expansion cooling system and 521 servers running real-world application workloads. This paper presents the key measurement results and observations from our 11-month experiments. Our results suggest that by operating at a supply air temperature setpoints of 29 $^{circ }$ C, our testbed achieves substantial cooling power saving with little impact on the server's reliability. Furthermore, we present a total cost of ownership (TCO) analysis framework which guides settings of the temperature and RH for a DC. Our observations and TCO analysis framework will be useful to future efforts in building and operating air-cooled DCs in tropics and beyond.
数据中心（DC）是电力密集型设施，需要消耗大量能源来冷却服务器。提高温度和相对湿度（RH）设定值是减少 DC 能源消耗的一个常用方法。然而，高温和相对湿度可能会降低服务器的可靠性。在选择合适的温度和相对湿度设置之前，我们必须了解温度和相对湿度设置点如何影响直流电能使用和服务器的可靠性。为此，我们在新加坡建造了一个风冷直流试验台并进行了实验，该试验台由直接膨胀冷却系统和运行实际应用工作负载的 521 台服务器组成。本文介绍了为期 11 个月实验的主要测量结果和观察结果。我们的结果表明，通过在 29$^{circ }$C 的供气温度设定值下运行，我们的测试平台实现了大量的制冷节能，而对服务器的可靠性影响很小。此外，我们还提出了一个总拥有成本（TCO）分析框架，用于指导直流电的温度和相对湿度设置。我们的观察结果和总拥有成本分析框架将有助于今后在热带地区及其他地区建造和运行风冷直流电。
{"title":"Impacts of Increasing Temperature and Relative Humidity in Air-Cooled Tropical Data Centers","authors":"Duc Van Le;Jing Zhou;Rongrong Wang;Rui Tan;Fei Duan","doi":"10.1109/TSUSC.2024.3379550","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3379550","url":null,"abstract":"Data centers (DCs) are power-intensive facilities which use a significant amount of energy for cooling the servers. Increasing the temperature and relative humidity (RH) setpoints is a rule-of-thumb approach to reducing the DC energy usage. However, the high temperature and RH may undermine the server's reliability. Before we can choose the proper temperature and RH settings, it is essential to understand how the temperature and RH setpoints affect the DC power usage and server's reliability. To this end, we constructed and experimented with an air-cooled DC testbed in Singapore, which consists of a direct expansion cooling system and 521 servers running real-world application workloads. This paper presents the key measurement results and observations from our 11-month experiments. Our results suggest that by operating at a supply air temperature setpoints of 29\u0000<inline-formula><tex-math>$^{circ }$</tex-math></inline-formula>\u0000C, our testbed achieves substantial cooling power saving with little impact on the server's reliability. Furthermore, we present a total cost of ownership (TCO) analysis framework which guides settings of the temperature and RH for a DC. Our observations and TCO analysis framework will be useful to future efforts in building and operating air-cooled DCs in tropics and beyond.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 5","pages":"790-802"},"PeriodicalIF":3.0,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142397225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-08DOI: 10.1109/TSUSC.2024.3371544
Ke Yuan;Peng Sang;Jian Ge;Bingcai Zhou;Chunfu Jia
E-Voting is widely used in many social, economic, political and cultural fields for its convenience, efficiency and greenness, but how to guarantee the fairness of e-voting and the controllability of human intervention needs further in-depth research and exploration. Although the introduction of homomorphic encryption algorithm solves the problem of ballot privacy calculation, and most of these schemes solve the problem of private key confidentiality by using or overlaying multiple different methods of saving private keys, its security will be questioned as long as there is a possibility of human intervention in the saving process. To solve this problem, we propose a timed-release e-voting scheme based on Paillier homomorphic encryption. We analyze the semantic security of the ballot formally by defining the security game, and realize the legitimacy check of the ballot ciphertext through the idea of partial knowledge proof. Property analysis shows that this scheme satisfies the basic properties of the security requirements of the e-voting scheme. Performance analysis shows that this scheme is feasible to implement in practical voting.
{"title":"A Timed-Release E-Voting Scheme Based on Paillier Homomorphic Encryption","authors":"Ke Yuan;Peng Sang;Jian Ge;Bingcai Zhou;Chunfu Jia","doi":"10.1109/TSUSC.2024.3371544","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3371544","url":null,"abstract":"E-Voting is widely used in many social, economic, political and cultural fields for its convenience, efficiency and greenness, but how to guarantee the fairness of e-voting and the controllability of human intervention needs further in-depth research and exploration. Although the introduction of homomorphic encryption algorithm solves the problem of ballot privacy calculation, and most of these schemes solve the problem of private key confidentiality by using or overlaying multiple different methods of saving private keys, its security will be questioned as long as there is a possibility of human intervention in the saving process. To solve this problem, we propose a timed-release e-voting scheme based on Paillier homomorphic encryption. We analyze the semantic security of the ballot formally by defining the security game, and realize the legitimacy check of the ballot ciphertext through the idea of partial knowledge proof. Property analysis shows that this scheme satisfies the basic properties of the security requirements of the e-voting scheme. Performance analysis shows that this scheme is feasible to implement in practical voting.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 5","pages":"740-753"},"PeriodicalIF":3.0,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142397221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-28DOI: 10.1109/TSUSC.2024.3370837
Vidushi Agarwal;Omid Ardakanian;Sujata Pal
With the rollout of smart meters, a vast amount of energy time-series became available from homes, enabling applications such as non-intrusive load monitoring (NILM). The inconspicuous collection of this data, however, poses a risk to the privacy of customers. Federated Learning (FL) eliminates the problem of sharing raw data with a cloud service provider by allowing machine learning models to be trained in a collaborative fashion on decentralized data. Although several NILM techniques that rely on FL to train a deep neural network for identifying the energy consumption of individual appliances have been proposed in recent years, the robustness of these techniques to malicious users and their ability to fully protect the user privacy remain unexplored. In this paper, we present a robust and privacy-preserving FL-based framework to train a bidirectional transformer architecture for NILM. This framework takes advantage of a meta-learning algorithm to handle the data heterogeneity prevalent in real-world settings. The efficacy of the proposed framework is corroborated through comparative experiments using two real-world NILM datasets. The results show that this framework can attain an accuracy that is on par with a centrally-trained energy disaggregation model, while preserving user privacy.
{"title":"A Robust and Privacy-Aware Federated Learning Framework for Non-Intrusive Load Monitoring","authors":"Vidushi Agarwal;Omid Ardakanian;Sujata Pal","doi":"10.1109/TSUSC.2024.3370837","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3370837","url":null,"abstract":"With the rollout of smart meters, a vast amount of energy time-series became available from homes, enabling applications such as non-intrusive load monitoring (NILM). The inconspicuous collection of this data, however, poses a risk to the privacy of customers. Federated Learning (FL) eliminates the problem of sharing raw data with a cloud service provider by allowing machine learning models to be trained in a collaborative fashion on decentralized data. Although several NILM techniques that rely on FL to train a deep neural network for identifying the energy consumption of individual appliances have been proposed in recent years, the robustness of these techniques to malicious users and their ability to fully protect the user privacy remain unexplored. In this paper, we present a robust and privacy-preserving FL-based framework to train a bidirectional transformer architecture for NILM. This framework takes advantage of a meta-learning algorithm to handle the data heterogeneity prevalent in real-world settings. The efficacy of the proposed framework is corroborated through comparative experiments using two real-world NILM datasets. The results show that this framework can attain an accuracy that is on par with a centrally-trained energy disaggregation model, while preserving user privacy.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 5","pages":"766-777"},"PeriodicalIF":3.0,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142397223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-23DOI: 10.1109/TSUSC.2024.3369333
Pierre Jacquet;Thomas Ledoux;Romain Rouvoy
Despite continuous improvements, cloud physical resources remain underused, hence severely impacting the efficiency of these infrastructures at large. To overcome this inefficiency, Infrastructure-as-a-Service (IaaS) providers usually compensate for oversized Virtual Machines (VMs) by offering more virtual resources than are physically available on a host. However, this technique—known as oversubscription —may hinder performances when a statically-defined oversubscription ratio results in resource contention of hosted VMs. Therefore, instead of setting a static and cluster-wide ratio, this article studies how a greedy increase of the oversubscription ratio per Physical Machine (PM) and resources type can preserve performance goals. Keeping performance unchanged allows our contribution to be more realistically adopted by production-scale IaaS infrastructures. This contribution, named ScroogeVM , leverages the detection of PM stability to carefully increase the associated oversubscription ratios. Based on metrics shared by public cloud providers, we investigate the impact of resource oversubscription on performance degradation. Subsequently, we conduct a comparative analysis of ScroogeVM with state-of-the-art oversubscription computations. The results demonstrate that our approach outperforms existing methods by leveraging the presence of long-lasting VMs, while avoiding live migration penalties and performance impacts for stakeholders.
{"title":"SCROOGEVM: Boosting Cloud Resource Utilization With Dynamic Oversubscription","authors":"Pierre Jacquet;Thomas Ledoux;Romain Rouvoy","doi":"10.1109/TSUSC.2024.3369333","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3369333","url":null,"abstract":"Despite continuous improvements, cloud physical resources remain underused, hence severely impacting the efficiency of these infrastructures at large. To overcome this inefficiency, Infrastructure-as-a-Service (IaaS) providers usually compensate for oversized Virtual Machines (VMs) by offering more virtual resources than are physically available on a host. However, this technique—known as \u0000<italic>oversubscription</i>\u0000—may hinder performances when a statically-defined oversubscription ratio results in resource contention of hosted VMs. Therefore, instead of setting a static and cluster-wide ratio, this article studies how a greedy increase of the oversubscription ratio per Physical Machine (PM) and resources type can preserve performance goals. Keeping performance unchanged allows our contribution to be more realistically adopted by production-scale IaaS infrastructures. This contribution, named \u0000<sc>ScroogeVM</small>\u0000, leverages the detection of PM stability to carefully increase the associated oversubscription ratios. Based on metrics shared by public cloud providers, we investigate the impact of resource oversubscription on performance degradation. Subsequently, we conduct a comparative analysis of \u0000<sc>ScroogeVM</small>\u0000 with state-of-the-art oversubscription computations. The results demonstrate that our approach outperforms existing methods by leveraging the presence of long-lasting VMs, while avoiding live migration penalties and performance impacts for stakeholders.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 5","pages":"754-765"},"PeriodicalIF":3.0,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142397222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-16DOI: 10.1109/TSUSC.2024.3366502
Syed Muhammad Danish;Kaiwen Zhang;Fatima Amara;Juan Carlos Oviedo Cepeda;Luis Fernando Rueda Vasquez;Tom Marynowski
Climate change is a major issue that has disastrous impacts on the environment through different causes like the greenhouse gas (GHG) emission. Many energy utilities around the world intend to reduce GHG emissions by promoting different systems including carbon emission trading (CET), renewable energy certificates (RECs), and tradable white certificates (TWCs). However, these systems are centralized, highly regulated, and operationally expensive and do not meet transparency, trust and security requirements. Accordingly, GHG emission reduction schemes are gradually moving towards blockchain-based solutions due to their underpinning characteristics including decentralization, transparency, anonymity, and trust (independent from third parties). This paper performs a comprehensive investigation into the blockchain technology, deployed for GHG emission reduction plans. It explores existing blockchain solutions along with their associated challenges to effectively uncover their potentials. As a result, this study suggests possible lines of research for future enhancements of blockchain systems particularly their incorporation in GHG emission reduction.
{"title":"Blockchain for Energy Credits and Certificates: A Comprehensive Review","authors":"Syed Muhammad Danish;Kaiwen Zhang;Fatima Amara;Juan Carlos Oviedo Cepeda;Luis Fernando Rueda Vasquez;Tom Marynowski","doi":"10.1109/TSUSC.2024.3366502","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3366502","url":null,"abstract":"Climate change is a major issue that has disastrous impacts on the environment through different causes like the greenhouse gas (GHG) emission. Many energy utilities around the world intend to reduce GHG emissions by promoting different systems including carbon emission trading (CET), renewable energy certificates (RECs), and tradable white certificates (TWCs). However, these systems are centralized, highly regulated, and operationally expensive and do not meet transparency, trust and security requirements. Accordingly, GHG emission reduction schemes are gradually moving towards blockchain-based solutions due to their underpinning characteristics including decentralization, transparency, anonymity, and trust (independent from third parties). This paper performs a comprehensive investigation into the blockchain technology, deployed for GHG emission reduction plans. It explores existing blockchain solutions along with their associated challenges to effectively uncover their potentials. As a result, this study suggests possible lines of research for future enhancements of blockchain systems particularly their incorporation in GHG emission reduction.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 5","pages":"727-739"},"PeriodicalIF":3.0,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142397220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-06DOI: 10.1109/TSUSC.2024.3362697
Yiming Wang;Meng Hao;Hui He;Weizhe Zhang;Qiuyuan Tang;Xiaoyang Sun;Zheng Wang
Power and energy consumption is the limiting factor of modern computing systems. As the GPU becomes a mainstream computing device, power management for GPUs becomes increasingly important. Current works focus on GPU kernel-level power management, with challenges in portability due to architecture-specific considerations. We present DRLCap , a general runtime power management framework intended to support power management across various GPU architectures. It periodically monitors system-level information to dynamically detect program phase changes and model the workload and GPU system behavior. This elimination from kernel-specific constraints enhances adaptability and responsiveness. The framework leverages dynamic GPU frequency capping, which is the most widely used power knob, to control the power consumption. DRLCap employs deep reinforcement learning (DRL) to adapt to the changing of program phases by automatically adjusting its power policy through online learning, aiming to reduce the GPU power consumption without significantly compromising the application performance. We evaluate DRLCap on three NVIDIA and one AMD GPU architectures. Experimental results show that DRLCap improves prior GPU power optimization strategies by a large margin. On average, it reduces the GPU energy consumption by 22% with less than 3% performance slowdown on NVIDIA GPUs. This translates to a 20% improvement in the energy efficiency measured by the energy-delay product (EDP) over the NVIDIA default GPU power management strategy. For the AMD GPU architecture, DRLCap saves energy consumption by 10%, on average, with a 4% percentage loss, and improves energy efficiency by 8%.
{"title":"DRLCAP: Runtime GPU Frequency Capping With Deep Reinforcement Learning","authors":"Yiming Wang;Meng Hao;Hui He;Weizhe Zhang;Qiuyuan Tang;Xiaoyang Sun;Zheng Wang","doi":"10.1109/TSUSC.2024.3362697","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3362697","url":null,"abstract":"Power and energy consumption is the limiting factor of modern computing systems. As the GPU becomes a mainstream computing device, power management for GPUs becomes increasingly important. Current works focus on GPU kernel-level power management, with challenges in portability due to architecture-specific considerations. We present \u0000<sc>DRLCap</small>\u0000, a general runtime power management framework intended to support power management across various GPU architectures. It periodically monitors system-level information to dynamically detect program phase changes and model the workload and GPU system behavior. This elimination from kernel-specific constraints enhances adaptability and responsiveness. The framework leverages dynamic GPU frequency capping, which is the most widely used power knob, to control the power consumption. \u0000<sc>DRLCap</small>\u0000 employs deep reinforcement learning (DRL) to adapt to the changing of program phases by automatically adjusting its power policy through online learning, aiming to reduce the GPU power consumption without significantly compromising the application performance. We evaluate \u0000<sc>DRLCap</small>\u0000 on three NVIDIA and one AMD GPU architectures. Experimental results show that \u0000<sc>DRLCap</small>\u0000 improves prior GPU power optimization strategies by a large margin. On average, it reduces the GPU energy consumption by 22% with less than 3% performance slowdown on NVIDIA GPUs. This translates to a 20% improvement in the energy efficiency measured by the energy-delay product (EDP) over the NVIDIA default GPU power management strategy. For the AMD GPU architecture, \u0000<sc>DRLCap</small>\u0000 saves energy consumption by 10%, on average, with a 4% percentage loss, and improves energy efficiency by 8%.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 5","pages":"712-726"},"PeriodicalIF":3.0,"publicationDate":"2024-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142397260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-05DOI: 10.1109/TSUSC.2024.3362074
Ke Gu;XingQiang Wang;Xiong Li
The security of fog computing has been researched and concerned with its development, where malicious attacks pose a greater threat to distributed data storage based on fog computing. Also, the rapid increasing on the number of terminal devices has raised the importance of fog computing-based distributed data storage. In response to this demand, it is essential to establish a secure and privacy-preserving distributed data auditing method that enables security protection of stored data and effective control over identities of auditors. In this paper, we propose a dynamic outsourced data audit scheme for Merkle hash grid-based fog storage with privacy-preserving, where fog servers are used to undertake partial outsourced computation and data storage. Our scheme can provide the function of privacy-preserving for outsourced data by blinding original stored data, and supports data owners to define their auditing access policies by the linear secret-sharing scheme to control the identities of auditors. Further, the construction of Merkle hash grid is used to improve the efficiency of dynamic data operations. Also, a server locating approach is proposed to enable the third-part auditor to identify specific malicious data fog servers within distributed data storage. Under the proposed security model, the security of our scheme can be proved, which can further provide collusion resistance and privacy-preserving for outsourced data. Additionally, both theoretical and experimental evaluations illustrate the efficiency of our proposed scheme.
{"title":"Dynamic Outsourced Data Audit Scheme for Merkle Hash Grid-Based Fog Storage With Privacy-Preserving","authors":"Ke Gu;XingQiang Wang;Xiong Li","doi":"10.1109/TSUSC.2024.3362074","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3362074","url":null,"abstract":"The security of fog computing has been researched and concerned with its development, where malicious attacks pose a greater threat to distributed data storage based on fog computing. Also, the rapid increasing on the number of terminal devices has raised the importance of fog computing-based distributed data storage. In response to this demand, it is essential to establish a secure and privacy-preserving distributed data auditing method that enables security protection of stored data and effective control over identities of auditors. In this paper, we propose a dynamic outsourced data audit scheme for Merkle hash grid-based fog storage with privacy-preserving, where fog servers are used to undertake partial outsourced computation and data storage. Our scheme can provide the function of privacy-preserving for outsourced data by blinding original stored data, and supports data owners to define their auditing access policies by the linear secret-sharing scheme to control the identities of auditors. Further, the construction of Merkle hash grid is used to improve the efficiency of dynamic data operations. Also, a server locating approach is proposed to enable the third-part auditor to identify specific malicious data fog servers within distributed data storage. Under the proposed security model, the security of our scheme can be proved, which can further provide collusion resistance and privacy-preserving for outsourced data. Additionally, both theoretical and experimental evaluations illustrate the efficiency of our proposed scheme.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 4","pages":"695-711"},"PeriodicalIF":3.0,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141965829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：