IEEE Transactions on Computers最新文献

2024 Reviewers List 2024审稿人名单

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2025-01-14 DOI: 10.1109/TC.2025.3527650

引用次数: 0

Protecting the CCSDS 123.0-B-2 Compression Algorithm Against Single-Event Upsets for Space Applications

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2024-12-09 DOI: 10.1109/TC.2024.3512203

Daniel Báscones;Francisco García-Herrero;Óscar Ruano;Carlos González;Daniel Mozos;Juan Antonio Maestro

{"title":"Protecting the CCSDS 123.0-B-2 Compression Algorithm Against Single-Event Upsets for Space Applications","authors":"Daniel Báscones;Francisco García-Herrero;Óscar Ruano;Carlos González;Daniel Mozos;Juan Antonio Maestro","doi":"10.1109/TC.2024.3512203","DOIUrl":"https://doi.org/10.1109/TC.2024.3512203","url":null,"abstract":"Hyperspectral imaging is an excellent tool to remotely analyze the Earth from in-orbit devices. Satellites capture these images containing vast information about the ground pixels. To optimize storage and transmission speeds, compression is often performed onboard the satellite. To that end, algorithms such as the CCSDS 123.0-B-2 are implemented on FPGAs, enabling this process in an efficient and fast manner. Single-Event Upsets (SEU) are commonplace in this scenario, e.g. bit flips in the FPGA’s configuration memory which can catastrophically alter the algorithm’s output. In this paper, we propose a fault tolerance technique for this specific case. The compression core is checked periodically by running a golden model designed to excite the full internal datapath based on a synthetic image. A failure in this check will trigger a reconfiguration of the compression core. Results show better detection rates than Dual Modular Redundancy (DMR) at a fraction of the resource cost, proving this technique as a viable alternative. Furthermore, other algorithms with similar processing flows might benefit as well from this technique.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 3","pages":"944-954"},"PeriodicalIF":3.6,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10785575","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Data Sharing in the Metaverse With Key Abuse Resistance Based on Decentralized CP-ABE

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2024-12-05 DOI: 10.1109/TC.2024.3512177

Liang Zhang;Zhanrong Ou;Changhui Hu;Haibin Kan;Jiheng Zhang

{"title":"Data Sharing in the Metaverse With Key Abuse Resistance Based on Decentralized CP-ABE","authors":"Liang Zhang;Zhanrong Ou;Changhui Hu;Haibin Kan;Jiheng Zhang","doi":"10.1109/TC.2024.3512177","DOIUrl":"https://doi.org/10.1109/TC.2024.3512177","url":null,"abstract":"Data sharing is ubiquitous in the metaverse, which adopts blockchain as its foundation. Blockchain is employed because it enables data transparency, achieves tamper resistance, and supports smart contracts. However, securely sharing data based on blockchain necessitates further consideration. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising primitive to provide confidentiality and fine-grained access control. Nonetheless, authority accountability and key abuse are critical issues that practical applications must address. Few studies have considered CP-ABE key confidentiality and authority accountability simultaneously. To our knowledge, we are the first to fill this gap by integrating non-interactive zero-knowledge (NIZK) proofs into CP-ABE keys and outsourcing the verification process to a smart contract. To meet the decentralization requirement, we incorporate a decentralized CP-ABE scheme into the proposed data sharing system. Additionally, we provide an implementation based on smart contract to determine whether an access control policy is satisfied by a set of CP-ABE keys. We also introduce an open incentive mechanism to encourage honest participation in data sharing. Hence, the key abuse issue is resolved through the NIZK proof and the incentive mechanism. We provide a theoretical analysis and conduct comprehensive experiments to demonstrate the feasibility and efficiency of the data sharing system. Based on the proposed accountable approach, we further illustrate an application in GameFi, where players can play to earn or contribute to an accountable DAO, fostering a thriving metaverse ecosystem.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 3","pages":"901-914"},"PeriodicalIF":3.6,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

High-Radix Generalized Hyperbolic CORDIC and Its Hardware Implementation

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2024-12-04 DOI: 10.1109/TC.2024.3512183

Hui Chen;Lianghua Quan;Ke Chen;Weiqiang Liu

{"title":"High-Radix Generalized Hyperbolic CORDIC and Its Hardware Implementation","authors":"Hui Chen;Lianghua Quan;Ke Chen;Weiqiang Liu","doi":"10.1109/TC.2024.3512183","DOIUrl":"https://doi.org/10.1109/TC.2024.3512183","url":null,"abstract":"In this paper, we propose a high-radix generalized hyperbolic coordinate rotation digital computer (HGH-CORDIC). This algorithm not only computes logarithmic and exponential functions with any fixed base but also significantly reduces the number of iterations required compared to traditional CORDIC methods. Initially, we present the general iteration formulas for HGH-CORDIC. Subsequently, we discuss its pivotal convergence properties and selection criteria, exemplifying these with commonly used cases. Through extensive software simulations, we validate the theoretical foundations of our approach. Finally, we explore efficient hardware implementation strategies. Our analysis indicates that, relative to state-of-the-art radix-2 GH-CORDIC, the proposed HGH-CORDIC can decrease the number of iterations by more than <inline-formula><tex-math>$50%$</tex-math></inline-formula> while maintaining comparable accuracy. Synthesized under the 28nm CMOS technology, the reports show that the reference circuit can save about <inline-formula><tex-math>$40%$</tex-math></inline-formula> area and power consumption averagely for <inline-formula><tex-math>$2^{x}$</tex-math></inline-formula> and <inline-formula><tex-math>$log_{2}x$</tex-math></inline-formula> calculations compared with the latest CORDIC method.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 3","pages":"983-995"},"PeriodicalIF":3.6,"publicationDate":"2024-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Pako: Multi-Valued Byzantine Agreement Comparable to Partially-Synchronous BFT

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2024-12-02 DOI: 10.1109/TC.2024.3510620

Xiaohai Dai;Zhengxuan Guo;Jiang Xiao;Guanxiong Wang;Yifei Liang;Chen Yu;Hai Jin

{"title":"Pako: Multi-Valued Byzantine Agreement Comparable to Partially-Synchronous BFT","authors":"Xiaohai Dai;Zhengxuan Guo;Jiang Xiao;Guanxiong Wang;Yifei Liang;Chen Yu;Hai Jin","doi":"10.1109/TC.2024.3510620","DOIUrl":"https://doi.org/10.1109/TC.2024.3510620","url":null,"abstract":"Asynchronous <i>Byzantine Fault Tolerance</i> (BFT) consensus protocols are gaining attention for their resilience against network attacks. Among them, <i>Multi-valued Byzantine Agreement</i> (MVBA) protocols play a critical role, which accepts input values from each replica and returns a consistent output. The state-of-the-art MVBA protocol, sMVBA, has a good-case latency of <inline-formula><tex-math>$6delta$</tex-math></inline-formula> and an expected bad-case latency of <inline-formula><tex-math>$12delta$</tex-math></inline-formula>, with <inline-formula><tex-math>$delta$</tex-math></inline-formula> representing the network delay. Additionally, sMVBA exhibits a communication of <inline-formula><tex-math>$O(n^{2})$</tex-math></inline-formula> in both good and bad cases. Although it outperforms other MVBA protocols, sMVBA still lags behind partially-synchronous counterparts. For instance, PBFT achieves a good-case latency of <inline-formula><tex-math>$3delta$</tex-math></inline-formula>, and HotStuff boasts a good-case communication of <inline-formula><tex-math>$O(n)$</tex-math></inline-formula>. This paper introduces a novel MVBA protocol, Pako, aiming for performance comparable to partially-synchronous protocols. Pako leverages an existing MVBA protocol as a black box and introduces an additional view with an optimistic path to commit values efficiently. Two Pako variants, Pako1 and Pako2, provide a trade-off between latency and communication. To be more specific, Pako1 achieves a good-case latency of <inline-formula><tex-math>$3delta$</tex-math></inline-formula> with <inline-formula><tex-math>$O(n^{2})$</tex-math></inline-formula> communication, while Pako2 reduces the communication to <inline-formula><tex-math>$O(n)$</tex-math></inline-formula> with a slightly higher good-case latency of <inline-formula><tex-math>$5delta$</tex-math></inline-formula>. A series of experiments demonstrate Pako's significant outperformance of counterparts.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 3","pages":"887-900"},"PeriodicalIF":3.6,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10772576","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

RuYi: Optimizing Burst Buffer Through Automated, Fine-Grained Process-to-BB Mapping

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2024-12-02 DOI: 10.1109/TC.2024.3510624

Yusheng Hua;Xuanhua Shi;Ligang He;Kang He;Teng Zhang;Hai Jin;Yong Chen

{"title":"RuYi: Optimizing Burst Buffer Through Automated, Fine-Grained Process-to-BB Mapping","authors":"Yusheng Hua;Xuanhua Shi;Ligang He;Kang He;Teng Zhang;Hai Jin;Yong Chen","doi":"10.1109/TC.2024.3510624","DOIUrl":"https://doi.org/10.1109/TC.2024.3510624","url":null,"abstract":"Current supercomputers use an SSD-based storage layer called Burst Buffer (BB) to provide I/O-intensive applications with accelerated storage access. However, efficiently utilizing this limited and expensive storage remains a critical issue, creating an urgent need for implementing Quality of Service (QoS) in BB. To address this, we propose RuYi, a QoS-aware method to provide applications with bandwidth guarantees in the BB file system. RuYi tackles two main issues. First, it quantitatively profiles available bandwidth resources in BB to ensure reliable QoS, a crucial aspect seldom studied in the literature. Second, RuYi offers fine-grained process-level QoS via an innovative process-to-BB mapping, maximizing resource utilization—something not achievable with conventional coarse-grained compute-to-BB mapping. We evaluated RuYi on a subsystem of the leading exascale supercomputer Sunway, consisting of 4,000 compute nodes and 200 BB nodes. The experimental results demonstrate that RuYi achieves an impressive end-to-end bandwidth control accuracy of 97%, while improving BB utilization by up to 116% compared to conventional coarse-grained compute-to-BB mapping.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 3","pages":"955-967"},"PeriodicalIF":3.6,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10772616","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Nicaea: A Byzantine Fault Tolerant Consensus Under Unpredictable Message Delivery Failures for Parallel and Distributed Computing

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2024-11-27 DOI: 10.1109/TC.2024.3506856

Guanlin Jing;Yifei Zou;Minghui Xu;Yanqiang Zhang;Dongxiao Yu;Zhiguang Shan;Xiuzhen Cheng;Rajiv Ranjan

{"title":"Nicaea: A Byzantine Fault Tolerant Consensus Under Unpredictable Message Delivery Failures for Parallel and Distributed Computing","authors":"Guanlin Jing;Yifei Zou;Minghui Xu;Yanqiang Zhang;Dongxiao Yu;Zhiguang Shan;Xiuzhen Cheng;Rajiv Ranjan","doi":"10.1109/TC.2024.3506856","DOIUrl":"https://doi.org/10.1109/TC.2024.3506856","url":null,"abstract":"Byzantine fault-tolerant (BFT) consensus is a critical problem in parallel and distributed computing systems, particularly with potential adversaries. Most prior work on BFT consensus assumes reliable message delivery and tolerates arbitrary failures of up to <inline-formula><tex-math>$frac{n}{3}$</tex-math></inline-formula> nodes out of <inline-formula><tex-math>$n$</tex-math></inline-formula> total nodes. However, many systems face unpredictable message delivery failures. This paper investigates the impact of unpredictable message delivery failures on the BFT consensus problem. We propose Nicaea, a novel protocol enabling consensus among loyal nodes when the number of Byzantine nodes is below a new threshold, given by: <inline-formula><tex-math>$frac{left(2-rhoright)left(1-rhoright)^{2n-2}-1}{left(2-rhoright) left(1-rhoright)^{2n-2}+1}n$</tex-math></inline-formula>, where <inline-formula><tex-math>$rho$</tex-math></inline-formula> denotes the message failure rate. Theoretical proofs and experimental results validate Nicaea's Byzantine resilience. Our findings reveal a fundamental trade-off: as message delivery instability increases, a system's tolerance to Byzantine failures decreases. The well-known <inline-formula><tex-math>$frac{n}{3}$</tex-math></inline-formula> threshold under reliable message delivery is a special case of our generalized threshold when <inline-formula><tex-math>$rho=0$</tex-math></inline-formula>. To the best of our knowledge, this work presents the first quantitative characterization of unpredictable message delivery failures’ impact on Byzantine fault tolerance in parallel and distributed computing.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 3","pages":"915-928"},"PeriodicalIF":3.6,"publicationDate":"2024-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Feynman Meets Turing: The Uncomputability of Quantum Gate-Circuit Emulation and Concatenation

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2024-11-27 DOI: 10.1109/TC.2024.3506861

Holger Boche;Yannik N. Böck;Zoe Garcia del Toro;Frank H. P. Fitzek

{"title":"Feynman Meets Turing: The Uncomputability of Quantum Gate-Circuit Emulation and Concatenation","authors":"Holger Boche;Yannik N. Böck;Zoe Garcia del Toro;Frank H. P. Fitzek","doi":"10.1109/TC.2024.3506861","DOIUrl":"https://doi.org/10.1109/TC.2024.3506861","url":null,"abstract":"We investigate the feasibility of computing quantum gate-circuit emulation (QGCE) and quantum gate-circuit concatenation (QGCC) on digital hardware. QGCE serves the purpose of rewriting gate circuits comprised of gates from a varying input gate set to gate circuits formed of gates from a fixed target gate set. Analogously, QGCC serves the purpose of finding an approximation to the concatenation of two arbitrary elements of a varying list of input gate circuits in terms of another element from the same list. Problems of this kind occur regularly in quantum computing and are often assumed an easy task for the digital computers controlling the quantum hardware. Arguably, this belief is due to analogical reasoning: The classical Boolean equivalents of QGCE and QGCC are natively computable on digital hardware. In the present paper, we present two insights in this regard: Upon applying a rigorous theory of computability, QGCE and QGCC turn out to be uncomputable on digital hardware. The results remain valid when we restrict the set of feasible inputs for the relevant functions to one parameter families of fixed gate sets. Our results underline the possibility that several ideas from quantum-computing theory may require a rethinking to become feasible for practical implementation.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 3","pages":"1053-1065"},"PeriodicalIF":3.6,"publicationDate":"2024-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10770186","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Humas: A Heterogeneity- and Upgrade-Aware Microservice Auto-Scaling Framework in Large-Scale Data Centers

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2024-11-27 DOI: 10.1109/TC.2024.3506862

Qin Hua;Dingyu Yang;Shiyou Qian;Jian Cao;Guangtao Xue;Minglu Li

{"title":"Humas: A Heterogeneity- and Upgrade-Aware Microservice Auto-Scaling Framework in Large-Scale Data Centers","authors":"Qin Hua;Dingyu Yang;Shiyou Qian;Jian Cao;Guangtao Xue;Minglu Li","doi":"10.1109/TC.2024.3506862","DOIUrl":"https://doi.org/10.1109/TC.2024.3506862","url":null,"abstract":"An effective auto-scaling framework is essential for microservices to ensure performance stability and resource efficiency under dynamic workloads. As revealed by many prior studies, the key to efficient auto-scaling lies in accurately learning performance patterns, i.e., the relationship between performance metrics and workloads in data-driven schemes. However, we notice that there are two significant challenges in characterizing performance patterns for large-scale microservices. Firstly, diverse microservices demonstrate varying sensitivities to heterogeneous machines, causing difficulty in quantifying the performance difference in a fixed manner. Secondly, frequent version upgrades of microservices result in uncertain changes in performance patterns, known as pattern drifts, leading to imprecise resource capacity estimation issues. To address these challenges, we propose Humas, a heterogeneity- and upgrade-aware auto-scaling framework for large-scale microservices. Firstly, Humas quantifies the difference in resource efficiency among heterogeneous machines for various microservices online and normalizes their resources in standard units. Additionally, Humas develops a least-squares density-difference (LSDD) based algorithm to identify pattern drifts caused by upgrades. Lastly, Humas generates capacity adjustment plans for microservices based on the latest performance patterns and predicted workloads. The experiment results conducted on 50 real microservices with over 11,000 containers demonstrate that Humas improves resource efficiency and performance stability by approximately 30.4% and 48.0%, respectively, compared to state-of-the-art approaches.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 3","pages":"968-982"},"PeriodicalIF":3.6,"publicationDate":"2024-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Parallel Computing Scheme Utilizing Memristor Crossbars for Fast Corner Detection and Rotation Invariance in the ORB Algorithm

IF 3.6 2区计算机科学

IEEE Transactions on Computers Pub Date : 2024-11-22 DOI: 10.1109/TC.2024.3504817

Qinghui Hong;Haoyou Jiang;Pingdan Xiao;Sichun Du;Tao Li

引用次数: 0