首页 > 最新文献

IEEE Transactions on Sustainable Computing最新文献

英文 中文
2022 Reviewers List 2022年评审人名单
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-06-08 DOI: 10.1109/TSUSC.2023.3250095
{"title":"2022 Reviewers List","authors":"","doi":"10.1109/TSUSC.2023.3250095","DOIUrl":"https://doi.org/10.1109/TSUSC.2023.3250095","url":null,"abstract":"","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 2","pages":"310-312"},"PeriodicalIF":3.9,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/7274860/10146535/10146537.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50421231","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
Dynamic Slack-Sharing Learning Technique With DVFS for Real-Time Systems 针对实时系统的 DVFS 动态松弛共享学习技术
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-06-08 DOI: 10.1109/TSUSC.2023.3283518
Mir Ashraf Uddin;Man Lin;Laurence T. Yang
This work aims at addressing carbon neutrality challenges through resource management with system software control. Reducing energy costs is vital for modern systems, especially those battery-powered devices that need to perform complex tasks. The technique of dynamic voltage or frequency scaling (DVFS) has been commonly adopted for reducing power consumption in cyber-physical systems to support the increasing computation demand under limited battery life. Dynamic slack becomes available when a task finishes earlier than its worst execution time. Dynamic slack management is an important factor for the DVFS mechanism. This paper proposes a dynamic slack-sharing (DSS) DVFS scheduling method that reduces CPU energy consumption by learning the slack-sharing rate. The DSS method automatically changes the slack sharing rate of a task on the fly in different situations through learning from experience to determine how much slack to use for the next task and how much to share. The method used for learning is Q-learning. Extensive experiments have been performed, and the results show that the DSS technique achieves more energy savings than the existing ones.
这项工作旨在通过系统软件控制进行资源管理,应对碳中和挑战。降低能源成本对现代系统至关重要,尤其是那些需要执行复杂任务的电池供电设备。动态电压或频率缩放(DVFS)技术已被普遍用于降低网络物理系统的功耗,以支持在电池寿命有限的情况下不断增长的计算需求。当任务比其最坏执行时间提前完成时,就会出现动态松弛。动态松弛管理是 DVFS 机制的一个重要因素。本文提出了一种动态空闲共享(DSS)DVFS 调度方法,通过学习空闲共享率来降低 CPU 能耗。DSS 方法通过学习经验,在不同情况下自动改变任务的松弛共享率,以确定下一个任务使用多少松弛以及共享多少松弛。学习的方法是 Q-learning。我们进行了广泛的实验,结果表明 DSS 技术比现有技术节省了更多能源。
{"title":"Dynamic Slack-Sharing Learning Technique With DVFS for Real-Time Systems","authors":"Mir Ashraf Uddin;Man Lin;Laurence T. Yang","doi":"10.1109/TSUSC.2023.3283518","DOIUrl":"10.1109/TSUSC.2023.3283518","url":null,"abstract":"This work aims at addressing carbon neutrality challenges through resource management with system software control. Reducing energy costs is vital for modern systems, especially those battery-powered devices that need to perform complex tasks. The technique of dynamic voltage or frequency scaling (DVFS) has been commonly adopted for reducing power consumption in cyber-physical systems to support the increasing computation demand under limited battery life. Dynamic slack becomes available when a task finishes earlier than its worst execution time. Dynamic slack management is an important factor for the DVFS mechanism. This paper proposes a dynamic slack-sharing (DSS) DVFS scheduling method that reduces CPU energy consumption by learning the slack-sharing rate. The DSS method automatically changes the slack sharing rate of a task on the fly in different situations through learning from experience to determine how much slack to use for the next task and how much to share. The method used for learning is Q-learning. Extensive experiments have been performed, and the results show that the DSS technique achieves more energy savings than the existing ones.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"261-270"},"PeriodicalIF":3.9,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83161277","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
An Enhanced Cross-Network-Slice Authentication Protocol for 5G 面向 5G 的增强型跨网络片认证协议
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-06-07 DOI: 10.1109/TSUSC.2023.3283615
Awaneesh Kumar Yadav;Shalitha Wijethilaka;An Braeken;Manoj Misra;Madhusanka Liyanage
Network slicing is considered one of the key technologies in future telecommunication networks as it can split the physical network into a number of logical networks tailored to diverse purposes that allow users to access various services speedily. The fifth-generation (5G) mobile network can support a variety of applications by using network slicing. However, security (especially authentication) is a significant issue when users access the network slice-based services. Various authentication schemes are designed to secure access, and only a few offer cross-network slice authentication. The security analysis of existing cross-network authentication schemes shows they are vulnerable to several attacks such as device stolen, ephemeral secret leakage, violation of perfect forward secrecy, identity theft. Therefore, we propose an authentication mechanism that offers cross-network slice authentication and prevents all the aforementioned vulnerabilities. The security verification of the authentication mechanism is carried out informally and formally (ROR logic and Scyther tool) to ensure that it handles all the vulnerabilities. The comparison of empirical evaluation shows that the proposed scheme is least costly than its competitors. Java-based implementations of the proposed protocols imitate a real environment, showing that our proposed protocol maintains almost the same performance as state-of-the-art solutions while providing additional security features.
网络切片被认为是未来电信网络的关键技术之一,因为它可以将物理网络拆分成若干逻辑网络,以满足用户快速访问各种服务的不同目的。第五代(5G)移动网络可通过网络切片支持各种应用。然而,当用户访问基于网络切片的服务时,安全性(尤其是身份验证)是一个重要问题。为确保访问安全,设计了各种认证方案,但只有少数方案提供跨网络切片认证。对现有跨网络身份验证方案的安全性分析表明,它们容易受到多种攻击,如设备被盗、短暂秘密泄露、违反完美前向保密、身份盗用等。因此,我们提出了一种认证机制,既能提供跨网络切片认证,又能防止上述所有漏洞。我们对认证机制进行了非正式和正式的安全验证(ROR 逻辑和 Scyther 工具),以确保它能处理所有漏洞。实证评估比较表明,与竞争对手相比,拟议方案的成本最低。基于 Java 的拟议协议实现模拟了真实环境,表明我们的拟议协议在提供额外安全功能的同时,几乎保持了与最先进解决方案相同的性能。
{"title":"An Enhanced Cross-Network-Slice Authentication Protocol for 5G","authors":"Awaneesh Kumar Yadav;Shalitha Wijethilaka;An Braeken;Manoj Misra;Madhusanka Liyanage","doi":"10.1109/TSUSC.2023.3283615","DOIUrl":"10.1109/TSUSC.2023.3283615","url":null,"abstract":"Network slicing is considered one of the key technologies in future telecommunication networks as it can split the physical network into a number of logical networks tailored to diverse purposes that allow users to access various services speedily. The fifth-generation (5G) mobile network can support a variety of applications by using network slicing. However, security (especially authentication) is a significant issue when users access the network slice-based services. Various authentication schemes are designed to secure access, and only a few offer cross-network slice authentication. The security analysis of existing cross-network authentication schemes shows they are vulnerable to several attacks such as device stolen, ephemeral secret leakage, violation of perfect forward secrecy, identity theft. Therefore, we propose an authentication mechanism that offers cross-network slice authentication and prevents all the aforementioned vulnerabilities. The security verification of the authentication mechanism is carried out informally and formally (ROR logic and Scyther tool) to ensure that it handles all the vulnerabilities. The comparison of empirical evaluation shows that the proposed scheme is least costly than its competitors. Java-based implementations of the proposed protocols imitate a real environment, showing that our proposed protocol maintains almost the same performance as state-of-the-art solutions while providing additional security features.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 4","pages":"555-573"},"PeriodicalIF":3.9,"publicationDate":"2023-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80912702","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
Phoenix: A Live Upgradable Blockchain Client 凤凰:可实时升级的区块链客户端
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-06-05 DOI: 10.1109/TSUSC.2023.3282586
Chenmin Wang;Peng Li;Xuepeng Fan;Zaiyang Tang;Yulong Zeng;Kouichi Sakurai
Blockchain is an important supporting technology for various sustainable systems. It relies on a number of distributed nodes running blockchain client software, which is responsible for some critical tasks, such as communicating with other nodes and generating new blocks. However, the quick evolution of blockchain technology brings crucial challenges to blockchain client design. After carefully examining existing blockchain client software, we have identified a critical weakness: Blockchain clients are weak in supporting live upgrades, resulting in a blockchain fork that incurs security concerns and risks. In this article, we propose Phoenix, a novel blockchain client design that is live upgradable. Phoenix uses blockchain service encapsulation to decouple blockchain services. Based on service encapsulation, we propose a live upgrade scheme that packs upgrade codes into blockchain transactions and uses a Just-In-Time engine to avoid service interruption. A parallel execution engine is developed to increase service efficiency. We evaluated Phoenix on a 51-node blockchain, and experimental results show that Phoenix outperforms existing solutions in overhead and upgrade latency.
区块链是各种可持续系统的重要支持技术。它依赖于一些运行区块链客户端软件的分布式节点,这些节点负责一些关键任务,如与其他节点通信和生成新区块。然而,区块链技术的快速发展给区块链客户端的设计带来了严峻的挑战。在仔细研究了现有的区块链客户端软件后,我们发现了一个关键的弱点:区块链客户端在支持实时升级方面比较薄弱,导致区块链分叉,从而引发安全问题和风险。在本文中,我们提出了可实时升级的新型区块链客户端设计--Phoenix。Phoenix 使用区块链服务封装来解耦区块链服务。在服务封装的基础上,我们提出了一种实时升级方案,将升级代码打包到区块链事务中,并使用即时引擎避免服务中断。我们还开发了并行执行引擎,以提高服务效率。我们在 51 个节点的区块链上对 Phoenix 进行了评估,实验结果表明 Phoenix 在开销和升级延迟方面优于现有解决方案。
{"title":"Phoenix: A Live Upgradable Blockchain Client","authors":"Chenmin Wang;Peng Li;Xuepeng Fan;Zaiyang Tang;Yulong Zeng;Kouichi Sakurai","doi":"10.1109/TSUSC.2023.3282586","DOIUrl":"10.1109/TSUSC.2023.3282586","url":null,"abstract":"Blockchain is an important supporting technology for various sustainable systems. It relies on a number of distributed nodes running blockchain client software, which is responsible for some critical tasks, such as communicating with other nodes and generating new blocks. However, the quick evolution of blockchain technology brings crucial challenges to blockchain client design. After carefully examining existing blockchain client software, we have identified a critical weakness: Blockchain clients are weak in supporting live upgrades, resulting in a blockchain fork that incurs security concerns and risks. In this article, we propose Phoenix, a novel blockchain client design that is live upgradable. Phoenix uses blockchain service encapsulation to decouple blockchain services. Based on service encapsulation, we propose a live upgrade scheme that packs upgrade codes into blockchain transactions and uses a Just-In-Time engine to avoid service interruption. A parallel execution engine is developed to increase service efficiency. We evaluated Phoenix on a 51-node blockchain, and experimental results show that Phoenix outperforms existing solutions in overhead and upgrade latency.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 4","pages":"703-714"},"PeriodicalIF":3.9,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74606354","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
Thorough Data Pruning for Join Query in Database System 为数据库系统中的联接查询进行彻底的数据剪枝
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-06-05 DOI: 10.1109/TSUSC.2023.3279382
Gao Jintao;Li Zhanhuai;Sun Jian
The improvement of robustness and efficiency for multi-way equijoin query is challenging, no-matter for centralized database systems or distributed database systems. Due to lots of unnecessary data existing during query processing, these two metrics will be seriously reduced. If we can thoroughly prune unnecessary data in advance, the robustness and efficiency will be highly improved. However, the pruning power of current strategies, such as predicate push-down and algebraic equivalence, is limited. We present deepDP, a powerful, generalized, and efficient strategy for data pruning. deepDP builds multiple independent pruning spaces by generating longest transitive closures and applies appropriate data pruning strategy for each pruning space. For thoroughly pruning unnecessary data, deepDP employs $alpha cdot beta$ pruning strategy to clean each pruning space based on a newly designed statistic information-Hollow Range and re-shuffles the elements in all pruned spaces for maximizing robustness and efficiency benefits meanwhile minimizing the invasion. We implement deepDP in PostgreSQL but are not limited to it, and evaluate deepDP on TPC-H, JOB, and our synthesis benchmark–DHR. The experiment results show that compared to traditional data pruning strategy, deepDP can improve multi-way equijoin query on efficiency by 3.5x.
无论对于集中式数据库系统还是分布式数据库系统,提高多向等连接查询的健壮性和效率都是一项挑战。由于在查询处理过程中存在大量不必要的数据,这两项指标都会严重下降。如果能提前彻底剪除不必要的数据,就能极大地提高健壮性和效率。然而,目前的策略(如谓词下推和代数等价)的剪枝能力有限。我们提出了一种强大、通用且高效的数据剪枝策略--deepDP。 deepDP 通过生成最长的传递闭包来构建多个独立的剪枝空间,并为每个剪枝空间应用适当的数据剪枝策略。为了彻底剪枝不必要的数据,deepDP 采用了 $alpha cdot beta$ 剪枝策略,根据新设计的统计信息--空心范围(Hollow Range)来清理每个剪枝空间,并重新洗牌所有剪枝空间中的元素,以最大限度地提高鲁棒性和效率,同时最大限度地减少入侵。我们在 PostgreSQL 中实现了 deepDP,但并不局限于此,并在 TPC-H、JOB 和我们的综合基准--DHR 上对 deepDP 进行了评估。实验结果表明,与传统的数据剪枝策略相比,deepDP 能将多向等重合查询的效率提高 3.5 倍。
{"title":"Thorough Data Pruning for Join Query in Database System","authors":"Gao Jintao;Li Zhanhuai;Sun Jian","doi":"10.1109/TSUSC.2023.3279382","DOIUrl":"10.1109/TSUSC.2023.3279382","url":null,"abstract":"The improvement of robustness and efficiency for multi-way equijoin query is challenging, no-matter for centralized database systems or distributed database systems. Due to lots of unnecessary data existing during query processing, these two metrics will be seriously reduced. If we can thoroughly prune unnecessary data in advance, the robustness and efficiency will be highly improved. However, the pruning power of current strategies, such as predicate push-down and algebraic equivalence, is limited. We present deepDP, a powerful, generalized, and efficient strategy for data pruning. deepDP builds multiple independent pruning spaces by generating longest transitive closures and applies appropriate data pruning strategy for each pruning space. For thoroughly pruning unnecessary data, deepDP employs \u0000<inline-formula><tex-math>$alpha cdot beta$</tex-math></inline-formula>\u0000 pruning strategy to clean each pruning space based on a newly designed statistic information-Hollow Range and re-shuffles the elements in all pruned spaces for maximizing robustness and efficiency benefits meanwhile minimizing the invasion. We implement deepDP in PostgreSQL but are not limited to it, and evaluate deepDP on TPC-H, JOB, and our synthesis benchmark–DHR. The experiment results show that compared to traditional data pruning strategy, deepDP can improve multi-way equijoin query on efficiency by 3.5x.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"409-421"},"PeriodicalIF":3.9,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84036343","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
Obstacle Adaptive Smooth Path Planning for Mobile Data Collector in the Internet of Things 物联网中移动数据采集器的障碍物自适应平滑路径规划
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-06-01 DOI: 10.1109/TSUSC.2023.3281886
Raj Anwit;Prasanta K. Jana;Mohammad S. Obaidat
In the edge-based Internet of Things (IoT) era, wireless sensor networks (WSNs) are the prime source for data collection. In such WSNs, mobile edge nodes such as mobile sinks (MSs) are the superior means to collect sensed data by visiting rendezvous points (RPs). However, WSNs are often obstacle-ridden, which creates hurdles to the movement of the MSs. Most of the existing path planning works dealing with obstacles do not address optimal and smooth path construction. In other words, they have not considered a) optimizing the number of RPs and constructing a feasible path and b) smoothing the constructed path by considering sharp edges and convexity of the obstacle perimeter. In this paper, we address all such issues and develop an efficient scheme for determining an optimal number of RPs using a greedy approach to the set-cover problem and optimized path construction, both in polynomial time. Then, we apply the modified BUG2 algorithm to construct an obstacle-free path, which is then smoothed using the concept of the Bezier curve. Extensive simulations show the superiority of our proposed scheme over the existing algorithms in terms of energy consumption, latency, and so on.
在基于边缘的物联网(IoT)时代,无线传感器网络(WSN)是数据收集的主要来源。在这种 WSN 中,移动汇(MS)等移动边缘节点是通过访问会合点(RP)收集传感数据的最佳手段。然而,WSN 通常障碍重重,这给 MS 的移动造成了障碍。现有的大多数路径规划工作都在处理障碍物,但并没有解决最佳和平滑路径的构建问题。换句话说,它们没有考虑 a) 优化 RP 的数量并构建可行路径,以及 b) 通过考虑障碍物周边的锐边和凸度来平滑所构建的路径。在本文中,我们解决了所有这些问题,并开发了一种高效的方案,利用贪婪法确定最佳 RP 数,从而在多项式时间内解决集合覆盖问题和优化路径构建问题。然后,我们采用改进的 BUG2 算法来构建无障碍路径,再利用贝塞尔曲线的概念对其进行平滑处理。大量仿真表明,我们提出的方案在能耗、延迟等方面都优于现有算法。
{"title":"Obstacle Adaptive Smooth Path Planning for Mobile Data Collector in the Internet of Things","authors":"Raj Anwit;Prasanta K. Jana;Mohammad S. Obaidat","doi":"10.1109/TSUSC.2023.3281886","DOIUrl":"10.1109/TSUSC.2023.3281886","url":null,"abstract":"In the edge-based Internet of Things (IoT) era, wireless sensor networks (WSNs) are the prime source for data collection. In such WSNs, mobile edge nodes such as mobile sinks (MSs) are the superior means to collect sensed data by visiting rendezvous points (RPs). However, WSNs are often obstacle-ridden, which creates hurdles to the movement of the MSs. Most of the existing path planning works dealing with obstacles do not address optimal and smooth path construction. In other words, they have not considered a) optimizing the number of RPs and constructing a feasible path and b) smoothing the constructed path by considering sharp edges and convexity of the obstacle perimeter. In this paper, we address all such issues and develop an efficient scheme for determining an optimal number of RPs using a greedy approach to the set-cover problem and optimized path construction, both in polynomial time. Then, we apply the modified BUG2 algorithm to construct an obstacle-free path, which is then smoothed using the concept of the Bezier curve. Extensive simulations show the superiority of our proposed scheme over the existing algorithms in terms of energy consumption, latency, and so on.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 4","pages":"727-738"},"PeriodicalIF":3.9,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75654418","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
Power-Efficient and Aging-Aware Primary/Backup Technique for Heterogeneous Embedded Systems 面向异构嵌入式系统的高能效和老化感知主/备份技术
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-06-01 DOI: 10.1109/TSUSC.2023.3282164
Mohsen Ansari;Sepideh Safari;Nezam Rohbani;Alireza Ejlali;Bashir M. Al-Hashimi
One of the essential requirements of embedded systems is a guaranteed level of reliability. In this regard, fault-tolerance techniques are broadly applied to these systems to enhance reliability. However, fault-tolerance techniques may increase power consumption due to their inherent redundancy. For this purpose, power management techniques are applied, along with fault-tolerance techniques, which generally prolong the system lifespan by decreasing the temperature and leading to an aging rate reduction. Yet, some power management techniques, such as Dynamic voltage and frequency scaling (DVFS), increase the transient fault rate and timing error. For this reason, heterogeneous multicore platforms have received much attention due to their ability to make a trade-off between power consumption and performance. Still, it is more complicated to map and schedule tasks in a heterogeneous multicore system. In this paper, for the first time, we propose a power management method for a heterogeneous multicore system that reduces power consumption and tolerates both transient and permanent faults through primary/backup technique while considering core-level power constraint, real-time constraint, and aging effect. Experimental evaluations demonstrate the efficiency of our proposed method in terms of reducing power consumption compared to the state-of-the-art schemes, together with guaranteeing reliability and considering the aging effect.
嵌入式系统的基本要求之一是保证一定的可靠性。在这方面,容错技术被广泛应用于这些系统,以提高可靠性。然而,容错技术由于其固有的冗余性,可能会增加功耗。为此,在应用容错技术的同时,还应用了电源管理技术,这些技术通常通过降低温度和减少老化率来延长系统的使用寿命。然而,一些电源管理技术,如动态电压和频率缩放(DVFS),会增加瞬态故障率和时序误差。因此,异构多核平台因其能够在功耗和性能之间做出权衡而备受关注。不过,在异构多核系统中映射和调度任务仍然较为复杂。在本文中,我们首次提出了一种异构多核系统的功耗管理方法,该方法在考虑内核级功耗约束、实时性约束和老化效应的同时,通过主备技术降低功耗并容忍瞬时和永久故障。实验评估证明,与最先进的方案相比,我们提出的方法能有效降低功耗,同时保证可靠性并考虑老化效应。
{"title":"Power-Efficient and Aging-Aware Primary/Backup Technique for Heterogeneous Embedded Systems","authors":"Mohsen Ansari;Sepideh Safari;Nezam Rohbani;Alireza Ejlali;Bashir M. Al-Hashimi","doi":"10.1109/TSUSC.2023.3282164","DOIUrl":"10.1109/TSUSC.2023.3282164","url":null,"abstract":"One of the essential requirements of embedded systems is a guaranteed level of reliability. In this regard, fault-tolerance techniques are broadly applied to these systems to enhance reliability. However, fault-tolerance techniques may increase power consumption due to their inherent redundancy. For this purpose, power management techniques are applied, along with fault-tolerance techniques, which generally prolong the system lifespan by decreasing the temperature and leading to an aging rate reduction. Yet, some power management techniques, such as Dynamic voltage and frequency scaling (DVFS), increase the transient fault rate and timing error. For this reason, heterogeneous multicore platforms have received much attention due to their ability to make a trade-off between power consumption and performance. Still, it is more complicated to map and schedule tasks in a heterogeneous multicore system. In this paper, for the first time, we propose a power management method for a heterogeneous multicore system that reduces power consumption and tolerates both transient and permanent faults through primary/backup technique while considering core-level power constraint, real-time constraint, and aging effect. Experimental evaluations demonstrate the efficiency of our proposed method in terms of reducing power consumption compared to the state-of-the-art schemes, together with guaranteeing reliability and considering the aging effect.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 4","pages":"715-726"},"PeriodicalIF":3.9,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72713993","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
Low-Carbon Mixed Traffic Route Recommendation for Community Residents Based on Multilayer Complex Traffic Network 基于多层复杂交通网络的社区居民低碳混合交通路线推荐
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-04-28 DOI: 10.1109/TSUSC.2023.3271220
Song Wang;Tangyuan Zou;Weixin Zhao;Liang Liu
With the proposed ”carbon peaking” and ”carbon neutral” goals in China, the transportation sector, as the second largest consumer of oil and a major producer of greenhouse gases, is a critical area for energy efficiency and emission reduction actions. However, few studies have focused on the effective combination of solving residents’ commuting challenges and low-carbon travel. In this paper, by extracting real traffic flow data from taxi and bike-sharing trajectory data, a multilayer complex traffic network is formed to realize an interactive visual exploration of urban traffic patterns. Based on this network a low-carbon travel route recommendation is implemented using a modified genetic algorithm to reduce personal carbon emission and travel costs. Meanwhile, the trip chain level carbon emission estimation method is defined for city streets and recommended routes. With the integration of the above algorithms, a visual analytics system is designed and implemented to support the joint exploration of urban traffic patterns and the street carbon emission distribution, low-carbon mixed traffic route recommendations for inter-community commuting, and optimization of low-carbon recommended routes by adjusting bike stations. Take the taxi and bike-sharing trajectory data in Xiamen, China as an example, an evaluation analysis of the system shows that the method is effective in reducing commuting costs for community residents while reducing personal travel carbon emission.
随着中国 "碳封顶 "和 "碳中和 "目标的提出,交通部门作为第二大石油消费部门和温室气体的主要制造部门,成为节能减排行动的关键领域。然而,很少有研究关注解决居民通勤难题与低碳出行的有效结合。本文通过从出租车和共享单车轨迹数据中提取真实交通流数据,形成多层复杂交通网络,实现对城市交通模式的交互式可视化探索。基于该网络,利用改进的遗传算法实现了低碳出行路线推荐,以减少个人碳排放和出行成本。同时,针对城市街道和推荐路线定义了出行链层面的碳排放估算方法。综合上述算法,设计并实现了可视化分析系统,支持城市交通模式与街道碳排放分布的联合探索、社区间通勤的低碳混合交通路线推荐,以及通过调整自行车站点优化低碳推荐路线。以中国厦门的出租车和共享单车轨迹数据为例,对系统的评估分析表明,该方法能有效降低社区居民的通勤成本,同时减少个人出行碳排放。
{"title":"Low-Carbon Mixed Traffic Route Recommendation for Community Residents Based on Multilayer Complex Traffic Network","authors":"Song Wang;Tangyuan Zou;Weixin Zhao;Liang Liu","doi":"10.1109/TSUSC.2023.3271220","DOIUrl":"10.1109/TSUSC.2023.3271220","url":null,"abstract":"With the proposed ”carbon peaking” and ”carbon neutral” goals in China, the transportation sector, as the second largest consumer of oil and a major producer of greenhouse gases, is a critical area for energy efficiency and emission reduction actions. However, few studies have focused on the effective combination of solving residents’ commuting challenges and low-carbon travel. In this paper, by extracting real traffic flow data from taxi and bike-sharing trajectory data, a multilayer complex traffic network is formed to realize an interactive visual exploration of urban traffic patterns. Based on this network a low-carbon travel route recommendation is implemented using a modified genetic algorithm to reduce personal carbon emission and travel costs. Meanwhile, the trip chain level carbon emission estimation method is defined for city streets and recommended routes. With the integration of the above algorithms, a visual analytics system is designed and implemented to support the joint exploration of urban traffic patterns and the street carbon emission distribution, low-carbon mixed traffic route recommendations for inter-community commuting, and optimization of low-carbon recommended routes by adjusting bike stations. Take the taxi and bike-sharing trajectory data in Xiamen, China as an example, an evaluation analysis of the system shows that the method is effective in reducing commuting costs for community residents while reducing personal travel carbon emission.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"299-314"},"PeriodicalIF":3.9,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72619611","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
Boosting Research for Carbon Neutral on Edge UWB Nodes Integration Communication Localization Technology of IoV 促进物联网边缘 UWB 节点集成通信定位技术的碳中和研究
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-04-19 DOI: 10.1109/TSUSC.2023.3266729
Ouhan Huang;Huanle Rao;Zhongyi Zhang;Renshu Gu;Hong Xu;Gangyong Jia
Reducing carbon emission to improving the economy of fuel vehicle is one of the effective ways to achieve Carbon Neutrality. The Internet of Vehicles (IoV) is a developing technology for deep integration of the Internet of Things (IoT) and transportation. The Industrial Internet of Things (IIoT) can incorporate vehicle information to pinpoint vehicle carbon emissions and provide a foundation for the subsequent carbon-neutral decision-making process. To achieve the precision needs of IoT, however, more than conventional Global Navigation Satellite Systems (GNSS) are required. To achieve carbon emission detection, provide high-precision positioning, and provide a foundation for subsequent carbon-neutral decision-making, it is essential to design a carbon emission detection and positioning system with the capability of vehicle networking. The geographic proximity of edge Ultra Wide Band (UWB) nodes and the merging of various data sources are two methods we suggest employing in this study to increase location accuracy in IIoT situations. After carefully examining the positioning error of the single-edge node and the range error achieved in the UWB communication system, we choose a suitable filtering strategy to enhance single-node accuracy. Following the improvement of single-node accuracy, we fuse the location information of multiple edge nodes using a Weighted Least Squares algorithm in the spatial dimension; in the temporal dimension, we use Extended Kalman filtering to fuse the data over a period of time due to the temporal correlation of inter-node communication. Experimental results demonstrate that our co-localization method, which combines temporal and spatial information, achieves higher localization accuracy in comparison with previous work.
减少碳排放,提高燃油汽车的经济性,是实现 "碳中和 "的有效途径之一。车联网(IoV)是物联网与交通深度融合的发展中技术。工业物联网(IIoT)可以结合车辆信息,精确定位车辆碳排放,为后续的碳中和决策过程提供基础。然而,要实现物联网的精确需求,需要的不仅仅是传统的全球导航卫星系统(GNSS)。要实现碳排放检测,提供高精度定位,并为后续的碳中和决策过程奠定基础,就必须设计一个具有车联网功能的碳排放检测和定位系统。在本研究中,我们建议采用边缘超宽带(UWB)节点的地理邻近性和各种数据源的合并这两种方法来提高物联网情况下的定位精度。在仔细研究了单边缘节点的定位误差和 UWB 通信系统实现的范围误差后,我们选择了一种合适的滤波策略来提高单节点的精度。在提高单节点精度后,我们在空间维度上使用加权最小二乘法算法融合多个边缘节点的位置信息;在时间维度上,由于节点间通信的时间相关性,我们使用扩展卡尔曼滤波法融合一段时间内的数据。实验结果表明,与之前的研究相比,我们结合了时间和空间信息的协同定位方法实现了更高的定位精度。
{"title":"Boosting Research for Carbon Neutral on Edge UWB Nodes Integration Communication Localization Technology of IoV","authors":"Ouhan Huang;Huanle Rao;Zhongyi Zhang;Renshu Gu;Hong Xu;Gangyong Jia","doi":"10.1109/TSUSC.2023.3266729","DOIUrl":"10.1109/TSUSC.2023.3266729","url":null,"abstract":"Reducing carbon emission to improving the economy of fuel vehicle is one of the effective ways to achieve Carbon Neutrality. The Internet of Vehicles (IoV) is a developing technology for deep integration of the Internet of Things (IoT) and transportation. The Industrial Internet of Things (IIoT) can incorporate vehicle information to pinpoint vehicle carbon emissions and provide a foundation for the subsequent carbon-neutral decision-making process. To achieve the precision needs of IoT, however, more than conventional Global Navigation Satellite Systems (GNSS) are required. To achieve carbon emission detection, provide high-precision positioning, and provide a foundation for subsequent carbon-neutral decision-making, it is essential to design a carbon emission detection and positioning system with the capability of vehicle networking. The geographic proximity of edge Ultra Wide Band (UWB) nodes and the merging of various data sources are two methods we suggest employing in this study to increase location accuracy in IIoT situations. After carefully examining the positioning error of the single-edge node and the range error achieved in the UWB communication system, we choose a suitable filtering strategy to enhance single-node accuracy. Following the improvement of single-node accuracy, we fuse the location information of multiple edge nodes using a Weighted Least Squares algorithm in the spatial dimension; in the temporal dimension, we use Extended Kalman filtering to fuse the data over a period of time due to the temporal correlation of inter-node communication. Experimental results demonstrate that our co-localization method, which combines temporal and spatial information, achieves higher localization accuracy in comparison with previous work.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"341-353"},"PeriodicalIF":3.9,"publicationDate":"2023-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87377894","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
Critical Path Awareness Techniques for Large-Scale Graph Partitioning 大规模图划分的关键路径感知技术
IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2023-04-10 DOI: 10.1109/TSUSC.2023.3263172
Baixuan Wu;Zheng Xiao;Peiying Lin;Zhuo Tang;Kenli Li
Graph partitioning is one of the fundamental problems in many graph-based applications and systems. It enables the division of a graph into smaller sub-graphs for subsequent parallel processing, reducing the processing latency of the graph. The critical path of a graph is the logical path with the longest delay from input to output. The processing time of the graph mainly depends on the delay incurred by the critical path, independent of other paths with small delays. Therefore, it can reduce the processing time of the graph by protecting the critical path of the graph from partition. However, existing approaches to graph partitioning only focus on metrics such as minimum cut and partition balance. As a result, the critical paths of graphs may be destroyed in the partitioning procedure. To address this problem, we present a critical path awareness approach, namely path-metis, to protect the critical paths and alleviate the processing latency after graph partitioning. In path-metis, two efficient strategies, including Slack and critical path fix strategies, are introduced. The Slack strategy, which incorporates critical path information into the weights of DAG, is used as pre-processing before traditional multi-level partitioning methods, like Metis. Then, for the generated partitioning scheme, the critical path fix strategy is proposed to further protect critical paths from being cut. We demonstrate the effectiveness of our approach on both real and synthetic datasets. From the experimental results, compared to Metis, our method improves critical path performance by 17.70%.
图分区是许多基于图的应用程序和系统中的基本问题之一。它可以将图划分为更小的子图,用于后续的并行处理,从而减少图的处理延迟。图的关键路径是从输入到输出具有最长延迟的逻辑路径。图形的处理时间主要取决于关键路径所产生的延迟,与其他具有小延迟的路径无关。因此,它可以通过保护图的关键路径不受分区的影响来减少图的处理时间。然而,现有的图分区方法只关注最小切割和分区平衡等指标。因此,图的关键路径可能在划分过程中被破坏。为了解决这个问题,我们提出了一种关键路径感知方法,即路径metis,以保护关键路径并减轻图分区后的处理延迟。在路径metis中,引入了两种有效的策略,包括Slack和关键路径修复策略。Slack策略将关键路径信息合并到DAG的权重中,用作传统多级划分方法(如Metis)之前的预处理。然后,对于生成的分区方案,提出了关键路径修复策略,以进一步保护关键路径不被切割。我们在真实数据集和合成数据集上展示了我们的方法的有效性。从实验结果来看,与Metis相比,我们的方法将关键路径性能提高了17.70%。
{"title":"Critical Path Awareness Techniques for Large-Scale Graph Partitioning","authors":"Baixuan Wu;Zheng Xiao;Peiying Lin;Zhuo Tang;Kenli Li","doi":"10.1109/TSUSC.2023.3263172","DOIUrl":"https://doi.org/10.1109/TSUSC.2023.3263172","url":null,"abstract":"Graph partitioning is one of the fundamental problems in many graph-based applications and systems. It enables the division of a graph into smaller sub-graphs for subsequent parallel processing, reducing the processing latency of the graph. The critical path of a graph is the logical path with the longest delay from input to output. The processing time of the graph mainly depends on the delay incurred by the critical path, independent of other paths with small delays. Therefore, it can reduce the processing time of the graph by protecting the critical path of the graph from partition. However, existing approaches to graph partitioning only focus on metrics such as minimum cut and partition balance. As a result, the critical paths of graphs may be destroyed in the partitioning procedure. To address this problem, we present a critical path awareness approach, namely path-metis, to protect the critical paths and alleviate the processing latency after graph partitioning. In path-metis, two efficient strategies, including Slack and critical path fix strategies, are introduced. The Slack strategy, which incorporates critical path information into the weights of DAG, is used as pre-processing before traditional multi-level partitioning methods, like Metis. Then, for the generated partitioning scheme, the critical path fix strategy is proposed to further protect critical paths from being cut. We demonstrate the effectiveness of our approach on both real and synthetic datasets. From the experimental results, compared to Metis, our method improves critical path performance by 17.70%.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 3","pages":"412-422"},"PeriodicalIF":3.9,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50280160","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
期刊
IEEE Transactions on Sustainable Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1