Journal of Systems Architecture最新文献_第3页

Leveraging traffic injection and quality-of-service to control the reconfiguration delay 利用流量注入和服务质量来控制重新配置延迟

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-09-06 DOI: 10.1016/j.sysarc.2025.103570

Giacomo Valente , Vittoriano Muttillo , Fabio Federici , Luigi Pomante , Tania Di Mascio

{"title":"Leveraging traffic injection and quality-of-service to control the reconfiguration delay","authors":"Giacomo Valente , Vittoriano Muttillo , Fabio Federici , Luigi Pomante , Tania Di Mascio","doi":"10.1016/j.sysarc.2025.103570","DOIUrl":"10.1016/j.sysarc.2025.103570","url":null,"abstract":"<div><div>Modern real-time embedded systems increasingly use runtime reconfigurable architectures to reduce size, weight, and power while ensuring predictability. However, reconfiguration delay is non-negligible and varies due to resource contention. Unlike existing solutions that affect system resources or timing, this paper presents an approach and tools to provide a safe, tight reconfiguration delay bound by accurately modeling contention, without additional resource usage, and applicable to most embedded Systems-on-Chip. Additionally, by using Quality-of-Service mechanisms available in modern systems-on-chip, the proposed approach allows designers to set an upper limit for the reconfiguration delay and maintain it against interference from competing tasks. To evaluate the proposed approach, we present two experiments in which it is applied to a representative configuration on a Xilinx Zynq UltraScale+ platform. Experimental results indicate that the reconfiguration delay bound holds under induced worst-case interference scenarios, ensuring that, under heavy workload conditions, the reconfiguration delay can be up to 6.3 times its value in isolation. Moreover, the approach can automatically generate a quality-of-service configuration that ensures a maximum reconfiguration delay 1.8 times its value in isolation, with only a 14% slowdown on contenders and no additional resource consumption, outperforming the existing state of the art.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103570"},"PeriodicalIF":4.1,"publicationDate":"2025-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145048343","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

LiDAR localization using position-encoded landmarks without point cloud maps 激光雷达定位使用位置编码的地标，没有点云图

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-09-02 DOI: 10.1016/j.sysarc.2025.103556

Wenjing Xie , Tianchi Ren , Chun Jason Xue , Jen-Ming Wu , Nan Guan

{"title":"LiDAR localization using position-encoded landmarks without point cloud maps","authors":"Wenjing Xie , Tianchi Ren , Chun Jason Xue , Jen-Ming Wu , Nan Guan","doi":"10.1016/j.sysarc.2025.103556","DOIUrl":"10.1016/j.sysarc.2025.103556","url":null,"abstract":"<div><div>LiDAR-based localization plays a critical role in autonomous driving and robotic navigation. However, traditional methods rely heavily on constructing high-precision point cloud maps, which is both time-consuming and labor-intensive. To address this, we propose an innovative localization approach that eliminates the need for point cloud maps by leveraging LiDAR and position-encoded landmarks. Our method encodes positional information into the shape of specially designed landmarks, strategically deployed in the environment. Subsequently, we fully leverage the advantages of LiDAR in accurately measuring distances and capturing the spatial structures of objects to detect and recognize the landmarks in the environment. By decoding the positional information embedded in the landmarks, precise vehicle localization is achieved. To overcome the limited information capacity of individual landmarks due to LiDAR’s reduced accuracy at long distances, we integrate multiple landmarks in a collaborative manner. By combining their encoded information and spatial relationships, we achieve high-precision localization without relying on point cloud maps. Experiments in CARLA and Autoware.AI simulators validate the effectiveness of our approach, offering a novel solution for LiDAR-based localization.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103556"},"PeriodicalIF":4.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145009975","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

RAFL: Reputation-Aware Federated Learning with hierarchical aggregation in LEO satellite networks 低轨道卫星网络中具有层次聚合的声誉感知联邦学习

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-08-30 DOI: 10.1016/j.sysarc.2025.103565

Xiuli Xu, Yanping Li, Laifeng Lu

{"title":"RAFL: Reputation-Aware Federated Learning with hierarchical aggregation in LEO satellite networks","authors":"Xiuli Xu, Yanping Li, Laifeng Lu","doi":"10.1016/j.sysarc.2025.103565","DOIUrl":"10.1016/j.sysarc.2025.103565","url":null,"abstract":"<div><div>The dynamic observation data of the Earth from Low Earth Orbit (LEO) satellites can be used for weather analysis, urban planning, etc. The existing satellite federated learning (FL) schemes have two main drawbacks. First, most of schemes rely on frequent communication between satellites and ground station. Due to the transient and unstable communication links, significant convergence delays are observed. Second, the possibility of unreliable and malicious participants preventing model convergence and degrading performance is not considered. To address the above issues, a secure and efficient FL scheme RAFL for LEO constellations is proposed. RAFL employs aerial networking and hierarchical FL to reduce interactions between satellites and ground station, thereby enhances training efficiency and model performance. A self-adaptive reputation evaluation system is designed that incorporates malicious behavior detection, historical behavior analysis, and performance and contribution assessments of LEO satellites. This system can detect and resist the actions of unreliable and malicious participants, and select appropriate leaders, thereby enhancing the robustness of FL. Extensive experiments show that RAFL not only effectively resists poisoning attacks but also improves the convergence time of FL while maintaining the accuracy of the global model.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103565"},"PeriodicalIF":4.1,"publicationDate":"2025-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144922448","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

An authenticated key agreement method for secure big data analytics in next-generation wireless networks-enabled smart farming 一种用于下一代无线网络智能农业安全大数据分析的认证密钥协议方法

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-08-29 DOI: 10.1016/j.sysarc.2025.103552

Akshita Patwal , Mohammad Wazid , Jaskaran Singh , Devesh Pratap Singh , Ashok Kumar Das

{"title":"An authenticated key agreement method for secure big data analytics in next-generation wireless networks-enabled smart farming","authors":"Akshita Patwal , Mohammad Wazid , Jaskaran Singh , Devesh Pratap Singh , Ashok Kumar Das","doi":"10.1016/j.sysarc.2025.103552","DOIUrl":"10.1016/j.sysarc.2025.103552","url":null,"abstract":"<div><div>It is anticipated that next-generation wireless networks will be exceedingly complicated and dynamic. Applications like autonomous vehicles, smart farming, smart healthcare systems and more are all possible uses for them. Smart farming is a form of agricultural management that makes use of contemporary information and communication technologies (ICTs) in order to improve both the amount and quality of the products that are produced. Next-generation wireless networks facilitate smart farming. The primary goals of smart farming are to supply the agricultural industry with the infrastructure that is required to track, monitor, automate, and analyze processes utilizing cutting-edge techniques such as machine learning, big data, cloud computing, and the Internet of Things (IoT). These are some of the technologies that are being utilized in smart farming. Smart farming employs techniques to create varied forecasts. From a descriptive dashboard, such as a mobile app or Web app, the farmers can keep an eye on their crops and make selections based on their findings. However, such a system may be vulnerable to various cyber threats and attacks as the devices and servers exchange their data through an insecure medium (i.e., the Internet). In this study, we present an authenticated key agreement technique for secure big data analytics in next-generation wireless networks-enabled smart farming (in short, AKM-BDSF) to protect the transferred and stored data of smart farming. The detailed security analysis and comparative study reveal that the proposed AKM-BDSF outperforms other existing schemes in terms of essential security and functionality elements. Moreover, AKM-BDSF is demonstrated practically to see the effects on its performance.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103552"},"PeriodicalIF":4.1,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144922449","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

Fast revocable attribute-based encryption with data integrity for Internet of Things 快速可撤销的基于属性的物联网数据完整性加密

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-08-28 DOI: 10.1016/j.sysarc.2025.103551

Yongjiao Li , Liang Zhu , Yalin Deng , Qikun Zhang , Zhenlei Wang , Zhu Cao

{"title":"Fast revocable attribute-based encryption with data integrity for Internet of Things","authors":"Yongjiao Li , Liang Zhu , Yalin Deng , Qikun Zhang , Zhenlei Wang , Zhu Cao","doi":"10.1016/j.sysarc.2025.103551","DOIUrl":"10.1016/j.sysarc.2025.103551","url":null,"abstract":"<div><div>Efficient and secure revocable attribute-based encryption (RABE) is vital for ensuring flexible and fine-grained access control and data sharing in cloud storage and outsourced data environments within the Internet of Things (IoT). However, current RABE schemes often struggle to achieve an optimal balance between efficiency, security, dynamic scalability, and other important features, which hampers their practical application. To overcome these limitations, we propose a fast RABE scheme with data integrity for IoT that achieves adaptive security with multiple challenge ciphertexts. Our scheme supports the revocation of authorized users and transfers the computationally heavy revocation processes to the cloud, thereby easing the computational burden on IoT devices. Moreover, it consistently guarantees the integrity and correctness of data. We have demonstrated its adaptive security within the defined security model with multiple challenge ciphertexts and optimized its performance. Experimental results indicate that our scheme provides better performance than existing solutions. Under the same access policy, our scheme reduces computational consumption by 7 to 9 times compared to previous schemes.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103551"},"PeriodicalIF":4.1,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144931858","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

Multi-factor single-registration authentication and key exchange protocol for IIoT 工业物联网多因素单注册认证和密钥交换协议

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-08-28 DOI: 10.1016/j.sysarc.2025.103542

Hao Xiao , Xiaomin Zhao , Qi Jiang , Zengwen Yu , Xindi Ma , Xinghua Li

{"title":"Multi-factor single-registration authentication and key exchange protocol for IIoT","authors":"Hao Xiao , Xiaomin Zhao , Qi Jiang , Zengwen Yu , Xindi Ma , Xinghua Li","doi":"10.1016/j.sysarc.2025.103542","DOIUrl":"10.1016/j.sysarc.2025.103542","url":null,"abstract":"<div><div>Industrial Internet of Things (IIoT), an integral part of smart society, delivers new and diverse services through interconnected platforms and devices. Authentication is a fundamental pillar to ensure trust of users and secure access to digital services in IIoT. In this paper, we propose a single registration authentication and key exchange (SRAKE) protocol based on SM9 identity-based signature (SM9-IBS) to simplify the authentication processes among service providers. In SRAKE, each user and service provider first acquires a private key for SM9-IBS generated by the key generation center (KGC). Then identity-based oblivious pseudorandom function (IBOPRF) is employed to protect storage and retrieval of private keys of users, in which a unique value is generated by associating user identity, password, and biometrics with the secret key of KGC. Therefore, users can only securely access legitimate service providers in a single registration by presenting both passwords and biometrics. The provable security analysis and performance comparison demonstrate that the protocol is provably secure and achieves more comprehensive security goals with an acceptable computational and communication performance. NS-3 simulation results further confirm that SRAKE is suitable for IIoT environments.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103542"},"PeriodicalIF":4.1,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144925660","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

ORQ-ViT: Outlier resilient Post Training Quantization for vision transformers via outlier decomposition ORQ-ViT：基于离群值分解的视觉变压器训练后离群值弹性量化

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-08-27 DOI: 10.1016/j.sysarc.2025.103530

Xinyu He , Ye Lu , Hang Liu , Cheng Gong , Wenxuan He

{"title":"ORQ-ViT: Outlier resilient Post Training Quantization for vision transformers via outlier decomposition","authors":"Xinyu He , Ye Lu , Hang Liu , Cheng Gong , Wenxuan He","doi":"10.1016/j.sysarc.2025.103530","DOIUrl":"10.1016/j.sysarc.2025.103530","url":null,"abstract":"<div><div>Post-training quantization (PTQ) is critical for deploying Vision Transformers (ViTs) on resource-constrained devices. However, outliers clustered in activation channels tend to dominate the quantization range and induce significant accuracy degradation. To address the outlier challenge, this paper proposes an outlier resilient PTQ method through outlier decomposition, namely ORQ-ViT. Its core idea is to decompose outliers clustered in outlier channels into isolated outliers, so that they can be easily excluded, thus alleviating their adverse impact. Specifically, we decompose activations along the patch token dimension. Since there are very few outlier channels, decomposed rows after outlier decomposition usually cover several isolated outliers, which can be easily identified and filtered. We further design an adaptive quantization range determination strategy during quantization parameters initialization to prevent outliers from serving as boundary values of the quantization range. ORQ-ViT can improve quantization levels utilization to generate activations with higher quantization resolution, thereby achieving higher accuracy. Additionally, ORQ-ViT supports pure integer matrix multiplications to ensure the inference efficiency of quantized ViTs on edge hardware. Extensive experiments demonstrate that our method achieves state-of-the-art (SOTA) accuracy across various ViT variants under multiple low bit-width scenarios. For image classification, the top-1 accuracy of ORQ-ViT outperforms that of the SOTA methods by an average of 2.26% at W4A4. Even for object detection and instance segmentation, ORQ-ViT also delivers highly competitive results. We also evaluate the inference efficiency of pure integer matrix multiplications and the results show that our method can achieve up to 2.1× speedup.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103530"},"PeriodicalIF":4.1,"publicationDate":"2025-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144908217","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

VFBoost-MO: Scable vertical federated gradient boosting decision tree for multi-class problem VFBoost-MO：多类问题的可缩放垂直联合梯度提升决策树

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-08-26 DOI: 10.1016/j.sysarc.2025.103545

Bo Yu, Huajie Shen, Yuhan Yang, Qian Xu, Wei He

{"title":"VFBoost-MO: Scable vertical federated gradient boosting decision tree for multi-class problem","authors":"Bo Yu, Huajie Shen, Yuhan Yang, Qian Xu, Wei He","doi":"10.1016/j.sysarc.2025.103545","DOIUrl":"10.1016/j.sysarc.2025.103545","url":null,"abstract":"<div><div>As a key technology to protect data privacy, vertical federated learning has recently been developed fast in both academia and industry. Notable works such as secureboost and secureboost+, which are all additive ensemble models that use a gradient boosting tree have been widely used in many applications. This paper proposes VFBoost-MO, a novel vertical federated learning (VFL) framework for multi-class classification using gradient boosting decision trees (GBDTs). Existing VFL methods for GBDTs are primarily limited to binary classification, while multi-class methods suffer from high computational and communication complexity. VFBoost-MO addresses these challenges by introducing a class-pair selection algorithm that constructs a single vector tree per iteration, significantly reducing complexity. Additionally, the framework employs local differential privacy (LDP) to protect data privacy without relying on computationally expensive encryption techniques. We present a theoretical analysis and experimental evaluation on eight public datasets demonstrating that VFBoost-MO achieves comparable accuracy to state-of-the-art methods while offering <em>2-3x</em> performance improvement in training speed and convergence rate.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103545"},"PeriodicalIF":4.1,"publicationDate":"2025-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144908215","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

DSSE-DMVS: A blockchain-based dynamic searchable symmetric encryption supporting multi-keyword queries and data deduplication DSSE-DMVS：基于区块链的动态可搜索对称加密，支持多关键字查询和重复数据删除

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-08-26 DOI: 10.1016/j.sysarc.2025.103540

Chunhua Jin , Jiaojiao Li , Youwang Sun , Ling Ji , Xinying Liu , Haiyang Chen , Lei Zhou , Zhonghao Zhai , Hao Zhang , Jian Weng

{"title":"DSSE-DMVS: A blockchain-based dynamic searchable symmetric encryption supporting multi-keyword queries and data deduplication","authors":"Chunhua Jin , Jiaojiao Li , Youwang Sun , Ling Ji , Xinying Liu , Haiyang Chen , Lei Zhou , Zhonghao Zhai , Hao Zhang , Jian Weng","doi":"10.1016/j.sysarc.2025.103540","DOIUrl":"10.1016/j.sysarc.2025.103540","url":null,"abstract":"<div><div>Dynamic Searchable Symmetric Encryption (DSSE) allows users to search for encrypted data and supports dynamic updating of data. In recent years, DSSE has become a research hotspot because it can address privacy and security issues when storing and retrieving encrypted data in cloud environments. However, most of the existing DSSE schemes suffer from inefficiencies in updating data and do not take into account data redundancy due to users misuse. These schemes only support the verification of search result and lack mechanisms to penalize malicious servers as well as ensure fairness to users. To address these issues, we design a blockchain-based dynamic searchable symmetric encryption scheme called DSSE-DMVS. Firstly, we adopt the bitmap as the index data structure to efficiently implement multi-keyword queries and index updates through logical operators AND and XOR. Then, we introduce a data deduplication mechanism to enhance retrieval efficiency and reduce the waste of cloud storage resources. To further penalize malicious servers and ensure fairness for users, we store the actual encrypted files and indexes on the server and blockchain, respectively. Additionally, we use the smart contract to manage the monetary rewards. Formalized safety analysis and experimental results show that DSSE-DMVS is safe and effective in practical applications.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103540"},"PeriodicalIF":4.1,"publicationDate":"2025-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144908216","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

SHC-DP: Software–hardware collaborative in-network data placement for hybrid storage systems SHC-DP：用于混合存储系统的软硬件协同网络内数据放置

IF 4.1 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-08-26 DOI: 10.1016/j.sysarc.2025.103564

Wenjie Wang , Bo Peng , Jianguo Yao , Haibing Guan

{"title":"SHC-DP: Software–hardware collaborative in-network data placement for hybrid storage systems","authors":"Wenjie Wang , Bo Peng , Jianguo Yao , Haibing Guan","doi":"10.1016/j.sysarc.2025.103564","DOIUrl":"10.1016/j.sysarc.2025.103564","url":null,"abstract":"<div><div>Hybrid storage systems increasingly adopt strategic data placement to deliver heterogeneous storage resources at low disk I/O latency for diverse applications. Modern adaptive algorithms with exceptional accuracy, adaptability, and scalability have gradually emerged as one of the mainstream algorithms for data placement. However, existing research predominantly focuses on exploring adaptive data placement algorithms with high placement accuracy, often neglecting the overhead introduced by these algorithms. It significantly compromises the end-to-end latency, a critical factor in determining the quality of service (QoS) for hybrid storage systems. To address this challenge, we introduce SHC-DP, a novel software–hardware collaborative in-network data placement framework. It is proposed to optimize the end-to-end latency for hybrid storage systems by leveraging modern SmartNIC technology. We first analyze the overheads associated with adaptive data placement in detail. Then, a comprehensive hardware/software co-optimization solution is proposed based on the observed insights. It incorporates algorithm acceleration, data transmission and processing optimization, computing and communication task overlapping, and concurrency optimization. Finally, we introduce detailed design and implementation for software/hardware modules and analyze SHC-DP’s performance bounds. Experimental results demonstrate that SHC-DP significantly optimizes end-to-end latency for hybrid storage systems, outperforming the state-of-the-art (SOTA) solution Sibyl by 1.54<span><math><mo>×</mo></math></span> <span><math><mrow><mo>∼</mo><mn>15</mn><mo>.</mo><mn>18</mn><mo>×</mo></mrow></math></span>.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"168 ","pages":"Article 103564"},"PeriodicalIF":4.1,"publicationDate":"2025-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144916501","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