IEEE Transactions on Sustainable Computing最新文献_第9页

REPFS: Reliability-Ensured Personalized Function Scheduling in Sustainable Serverless Edge Computing REPFS：可持续无服务器边缘计算中的可靠性有保障的个性化功能调度

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-11-29 DOI: 10.1109/TSUSC.2023.3336691

Kun Cao;Jian Weng

{"title":"REPFS: Reliability-Ensured Personalized Function Scheduling in Sustainable Serverless Edge Computing","authors":"Kun Cao;Jian Weng","doi":"10.1109/TSUSC.2023.3336691","DOIUrl":"https://doi.org/10.1109/TSUSC.2023.3336691","url":null,"abstract":"In recent years, serverless edge computing has been widely employed in the deployments of Internet-of-things (IoT) applications. Despite considerable research efforts in this field, existing works fail to jointly consider essential factors such as energy, reliability, personalized user requirements, and stochastic application executions. This oversight results in an inefficient utilization of computation and communication resources within serverless edge computing networks, subsequently diminishing the profit of service providers and degrading the quality-of-experience (QoE) of end users. In this paper, we explore the problem of reliability-ensured personalized function scheduling (REPFS) to jointly optimize the profit of service providers and the holistic QoE of end users in sustainable serverless edge computing. A personality-driven user QoE prediction method is first designed to accurately estimate the QoE of individual end users with differentiated personality types. Afterward, a deterministic function scheduling policy is developed on the problem-specific augmented non-dominated sorting genetic algorithm II (PSA-NSGA-II). Given the inherent uncertainty of application executions, a stochastic function scheduling strategy that can be easily parallelized for modern multicore scheduler platforms is also devised to accelerate solution generation for stochastic applications. Experimental results show that our deterministic function scheduling policy achieves 15% performance enhancement compared with representative multiobjective evolutionary algorithms. Furthermore, our stochastic function scheduling strategy promotes the service profit by 78% and the holistic user QoE by 118% on average compared with the developed deterministic scheduling policy.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"494-511"},"PeriodicalIF":3.9,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10334010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141264524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Is Hot IT a False Economy? An Analysis of Server and Data Center Energy Efficiency as Temperatures Rise 热门 IT 是虚假经济吗？温度升高时服务器和数据中心能效分析

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-11-27 DOI: 10.1109/TSUSC.2023.3336801

Stephen Clement;Kat Burdett;Nour Rteil;Astrid Wynne;Rich Kenny

{"title":"Is Hot IT a False Economy? An Analysis of Server and Data Center Energy Efficiency as Temperatures Rise","authors":"Stephen Clement;Kat Burdett;Nour Rteil;Astrid Wynne;Rich Kenny","doi":"10.1109/TSUSC.2023.3336801","DOIUrl":"https://doi.org/10.1109/TSUSC.2023.3336801","url":null,"abstract":"As demand for digital services grows, there is need to improve efficiency and reduce the environmental impact of data centers. The largest energy consumer in any data center is the IT, followed by the systems dedicated to cooling. Aiming to improve efficiency, and driven by metrics like PUE, there is a trend towards running data centers hotter to reduce the cooling energy. There is little research investigating the effect this will have on the IT beyond failure rates. To ensure overall efficiency is improving, we must view the data center as a system of systems, taking a holistic view rather than focusing on individual sub-systems. In this paper we use industry standard benchmarks and a wind-tunnel to profile typical enterprise IT. We analyze the effect of environmental conditions on IT efficiency, showing minor increases in temperature or pressure impact the efficiency of servers. Using an idealized, simulated data center case study we show that the interaction between cooling systems, server behavior and local climate are non-trivial and increasing temperatures has potential to worsen efficiency.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"482-493"},"PeriodicalIF":3.9,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141264312","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}

引用次数: 0

Performance Analysis of Hybrid RF/VLC Energy Harvested Terrestrial-Underwater System 地面-水下混合射频/VLC 能量收集系统性能分析

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-11-24 DOI: 10.1109/TSUSC.2023.3336374

Krati Mittal;Akash Gupta;Nikhil Sharma;Manan Jani;Parul Garg

引用次数: 0

Towards Privacy-Preserving and Practical Data Trading for Aggregate Statistic 为汇总统计实现隐私保护和实用数据交易

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-11-13 DOI: 10.1109/TSUSC.2023.3331179

Fan Yang;Xiaofeng Liao;Xinyu Lei;Nankun Mu;Di Zhang

{"title":"Towards Privacy-Preserving and Practical Data Trading for Aggregate Statistic","authors":"Fan Yang;Xiaofeng Liao;Xinyu Lei;Nankun Mu;Di Zhang","doi":"10.1109/TSUSC.2023.3331179","DOIUrl":"10.1109/TSUSC.2023.3331179","url":null,"abstract":"Data trading is an effective way for commercial companies to obtain massive personal data to develop their data-driven businesses. However, when data owners may want to sell their data without revealing privacy, data consumers also face the dilemma of high purchase costs due to purchasing too much invalid data. Therefore, there is an urgent need for a data trading scheme that can protect personal privacy and save expenses simultaneously. In this paper, we design a priv\u0000<bold>AC\u0000y-preserving and pra\u0000<bold>C\u0000tical aggr\u0000<bold>E\u0000gate \u0000<bold>S\u0000tati\u0000<bold>S\u0000tic trading scheme (named as ACCESS). Technically, we focus on the group-level pricing strategy to make ACCESS easier to implement. The differential privacy technique is applied to protect the data owners’ privacy, and the sampling algorithm is adopted to reduce the data consumers’ costs. Specifically, to provide a maximum tolerant privacy loss guarantee for the data owners, we design a decision algorithm to detect whether a conflict occurs between the consumer-specified accuracy level and the maximum tolerable privacy loss budget. Besides, to minimize the purchase cost for the data brokers, we develop a sampling-based aggregation method consisting of two sampling algorithms (called as BUSA and BKSA, respectively). BUSA enables reducing purchase costs with no additional background knowledge. Once the data broker knows the data boundary, BKSA can significantly reduce the amount of data that needs to be purchased, thereby the purchase cost is reduced. Rigorous theoretical analysis and extensive experiments (over four real-world and public datasets) further demonstrate the practicability of ACCESS.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"452-463"},"PeriodicalIF":3.9,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135610928","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}

引用次数: 0

Automatic Software Tailoring for Optimal Performance 自动定制软件，实现最佳性能

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-11-06 DOI: 10.1109/TSUSC.2023.3330671

José Miguel Aragón-Jurado;Juan Carlos de la Torre;Patricia Ruiz;Pedro L. Galindo;Albert Y. Zomaya;Bernabé Dorronsoro

{"title":"Automatic Software Tailoring for Optimal Performance","authors":"José Miguel Aragón-Jurado;Juan Carlos de la Torre;Patricia Ruiz;Pedro L. Galindo;Albert Y. Zomaya;Bernabé Dorronsoro","doi":"10.1109/TSUSC.2023.3330671","DOIUrl":"10.1109/TSUSC.2023.3330671","url":null,"abstract":"Efficient green software solutions require being aware of the characteristics of both the software and the hardware where it is executed. Separately optimizing them leads to inefficient results, and there is a need for a perfect synergy between software and hardware for optimal outcomes. We present a novel combinatorial optimization problem for the minimization of the software execution time on a specific hardware, taking into account the existing uncertainty in the system. A solution to the problem is a sequence of LLVM code transformations, and a cellular genetic algorithm is used to find it. Assuming that hardware does not change, reducing the software runtime typically leads to a greener version with lower consumption. To cope with the uncertainty, two novel approaches relying on bootstrap method to compute confident intervals of the software runtime at negligible cost are proposed and compared to three other techniques and −O3 Clang compilation flag over four hardware architectures. Results show how the proposed approach effectively copes with the uncertainty, providing more robust solutions with respect to the compared methods. The execution time of the raw program is reduced from 28.1% to up to 63.2%, outperforming −O3 flag by 13.9% to 26.3%, for the different architectures.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"464-481"},"PeriodicalIF":3.9,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135501605","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}

引用次数: 0

Parallel Trajectory Training of Recurrent Neural Network Controllers With Levenberg–Marquardt and Forward Accumulation Through Time in Closed-Loop Control Systems 在闭环控制系统中利用 Levenberg-Marquardt 和时间前向累积对递归神经网络控制器进行并行轨迹训练

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-11-06 DOI: 10.1109/TSUSC.2023.3330573

Xingang Fu;Jordan Sturtz;Eduardo Alonso;Rajab Challoo;Letu Qingge

{"title":"Parallel Trajectory Training of Recurrent Neural Network Controllers With Levenberg–Marquardt and Forward Accumulation Through Time in Closed-Loop Control Systems","authors":"Xingang Fu;Jordan Sturtz;Eduardo Alonso;Rajab Challoo;Letu Qingge","doi":"10.1109/TSUSC.2023.3330573","DOIUrl":"10.1109/TSUSC.2023.3330573","url":null,"abstract":"This paper introduces a novel parallel trajectory mechanism that combines Levenberg-Marquardt and Forward Accumulation Through Time algorithms to train a recurrent neural network controller in a closed-loop control system by distributing the calculation of trajectories across Central Processing Unit (CPU) cores/workers depending on the computing platforms, computing program languages, and software packages available. Without loss of generality, the recurrent neural network controller of a grid-connected converter for solar integration to a power system was selected as the benchmark test closed-loop control system. Two software packages were developed in Matlab and C++ to verify and demonstrate the efficiency of the proposed parallel training method. The training of the deep neural network controller was migrated from a single workstation to both cloud computing platforms and High-Performance Computing clusters. The training results show excellent speed-up performance, which significantly reduces the training time for a large number of trajectories with high sampling frequency, and further demonstrates the effectiveness and scalability of the proposed parallel mechanism.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 2","pages":"222-229"},"PeriodicalIF":3.9,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135501371","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}

引用次数: 0

Shortest Paths Publishing With Differential Privacy 利用差分隐私发布最短路径

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-11-03 DOI: 10.1109/TSUSC.2023.3329995

Bin Cai;Weihong Sheng;Jiajun Chen;Chunqiang Hu;Jiguo Yu

{"title":"Shortest Paths Publishing With Differential Privacy","authors":"Bin Cai;Weihong Sheng;Jiajun Chen;Chunqiang Hu;Jiguo Yu","doi":"10.1109/TSUSC.2023.3329995","DOIUrl":"10.1109/TSUSC.2023.3329995","url":null,"abstract":"The growing prevalence of graphs representations in our society has led to a corresponding rise in the publishing of graphs by researchers and organizations. To protect the privacy, it is important to ensure that graphs including sensitive data are not disclosed. Since the weight of edges could be utilized to infer confidential information, the graph should be privately published to avoid ethical and legal issues. In this paper, we propose a novel method for privately publishing shortest paths while preserving the privacy of sensitive edge weights in graph. Specifically, we divide the edge weights into internal and external edges based on their edge betweenness centrality. Then, we give two different differentially private algorithms to perturb edge weights based on the distinction between internal and external edges, respectively. To reduce the error ratios between differentially private shortest paths and real shortest paths, we employ edge betweenness centrality to search for the shortest path, which is closest to the true one. Our experimental results show that our mechanisms can effectively reduce the error in the average shortest path distance by 1.1% for large graphs, while for the shortest path change rate, our mechanisms can reduce it by 8.3%.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 2","pages":"209-221"},"PeriodicalIF":3.9,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134982272","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}

引用次数: 0

Self-Optimizing the Environmental Sustainability of Blockchain-Based Systems 区块链系统的环境可持续性自我优化

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-10-19 DOI: 10.1109/TSUSC.2023.3325881

Akram Alofi;Mahmoud A. Bokhari;Rami Bahsoon;Robert Hendley

{"title":"Self-Optimizing the Environmental Sustainability of Blockchain-Based Systems","authors":"Akram Alofi;Mahmoud A. Bokhari;Rami Bahsoon;Robert Hendley","doi":"10.1109/TSUSC.2023.3325881","DOIUrl":"10.1109/TSUSC.2023.3325881","url":null,"abstract":"Blockchain technology has been widely adopted in many areas to provide more dependable and trustworthy systems, including digital infrastructure. Nevertheless, its widespread implementation is accompanied by significant environmental concerns, as it is considered a substantial contributor to greenhouse gas emissions. This environmental impact is mainly attributed to the inherent inefficiencies of its consensus algorithms, notably Proof of Work, which demands substantial computational power for trust establishment. This paper proposes a novel self-adaptive model to optimize the environmental sustainability of blockchain-based systems, addressing energy consumption and carbon emission without compromising the fundamental properties of blockchain technology. The model continuously monitors a blockchain-based system and adaptively selects miners, considering context changes and user needs. It dynamically selects a subset of miners to perform sustainable mining processes while ensuring the decentralization and trustworthiness of the system. The aim is to minimize blockchain-based systems' energy consumption and carbon emissions while maximizing their decentralization and trustworthiness. We conduct experiments to evaluate the efficiency and effectiveness of the model. The results show that our self-optimizing model can reduce energy consumption by 55.49% and carbon emissions by 71.25% on average while maintaining desirable levels of decentralization and trustworthiness by more than 96.08% and 75.12%, respectively. Furthermore, these enhancements can be achieved under different operating conditions compared to similar models, including the straightforward use of Proof of Work. Also, we have investigated and discussed the correlation between these objectives and how they are related to the number of miners within the blockchain-based systems.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"396-408"},"PeriodicalIF":3.9,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135058244","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}

引用次数: 0

Multi-Type Charging Scheduling Based on Area Requirement Difference for Wireless Rechargeable Sensor Networks 基于区域需求差异的无线充电传感器网络多类型充电调度

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-10-17 DOI: 10.1109/TSUSC.2023.3325237

Yang Yang;Xuxun Liu;Kun Tang;Wenquan Che;Quan Xue

{"title":"Multi-Type Charging Scheduling Based on Area Requirement Difference for Wireless Rechargeable Sensor Networks","authors":"Yang Yang;Xuxun Liu;Kun Tang;Wenquan Che;Quan Xue","doi":"10.1109/TSUSC.2023.3325237","DOIUrl":"10.1109/TSUSC.2023.3325237","url":null,"abstract":"Charging scheduling plays a crucial role in ensuring durable operation for wireless rechargeable sensor networks. However, previous methods cannot meet the strict requirements of a high node survival rate and high energy usage effectiveness. In this article, we propose a multi-type charging scheduling strategy to meet such demands. In this strategy, the network is divided into an inner ring and an outer ring to satisfy different demands in different areas. The inner ring forms a flat topology, and adopts a periodic and single-node charging pattern mainly for a high node survival rate. A space priority and a time priority are designed to determine the charging sequence of the nodes. The optimal charging cycle and the optimal charging time are achieved by mathematical derivations. The outer ring forms a cluster topology, and adopts an on-demand and multi-node charging pattern mainly for high energy usage effectiveness. A space balancing principle and a time balancing principle are designed to determine the charging positions of the clusters. A gravitational search algorithm is designed to determine the charging sequence of the clusters. Several simulations verify the advantages of the proposed solution in terms of energy usage effectiveness, charging failure rate, and average task delay.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 2","pages":"182-196"},"PeriodicalIF":3.9,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135007433","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}

引用次数: 0

FPGA Implementation of Classical Dynamic Neural Networks for Smooth and Nonsmooth Optimization Problems 针对平滑和非平滑优化问题的经典动态神经网络的 FPGA 实现

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2023-10-17 DOI: 10.1109/TSUSC.2023.3325268

Renfeng Xiao;Xing He;Tingwen Huang;Junzhi Yu

引用次数: 0