Journal of Systems Architecture最新文献

A Comprehensive End-to-End Security Framework for Optical On-Chip Networks 光片上网络的综合端到端安全框架

IF 3.7 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-07-17 DOI: 10.1016/j.sysarc.2025.103518

Uzmat Ul Nisa, Janibul Bashir

{"title":"A Comprehensive End-to-End Security Framework for Optical On-Chip Networks","authors":"Uzmat Ul Nisa, Janibul Bashir","doi":"10.1016/j.sysarc.2025.103518","DOIUrl":"10.1016/j.sysarc.2025.103518","url":null,"abstract":"<div><div>The Optical Network-on-Chip (ONoC) offers a promising solution to the challenges of scalability, high power consumption, and limited bandwidth inherent in current Electrical Network-on-Chip (ENoC) architectures. Despite its advantages, ONoC remains susceptible to various security threats, notably hardware Trojans (HTs). The insertion of an HT in any optical station can compromise the tuning circuits of microring resonators (MRs), enabling unauthorized manipulation of the data traversing the waveguides. Once compromised, these MRs can be exploited to intercept, alter, or even obstruct data transmission, thereby posing significant risks to the integrity, authenticity, and confidentiality of the communication. To mitigate such threats, various countermeasures can be employed. These include hardware-based authentication and encryption, physical tamper-proofing of the chip, and strict supply chain management to prevent the insertion of HTs during fabrication. Additionally, regular monitoring and auditing of the ONoC are crucial for detecting suspicious activities and implementing timely mitigation strategies. In this paper, we propose a comprehensive security framework designed to address these vulnerabilities at both the physical and application layers, effectively restricting the malicious activities of compromised MRs. At the physical layer, our approach leverages the deterministic power loss characteristics of ONoCs to identify abnormal MR behavior. Concurrently, at the application layer, we introduce a lightweight encryption scheme to secure inter-node communication, thereby preventing unauthorized access and data tampering within the ONoC. The evaluation showed acceptable area, power, and performance overheads, with an 18.2% increase in average packet latency and a 19.2% rise in the energy-delay (ED) product when integrated with state-of-the-art optical interconnects.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"167 ","pages":"Article 103518"},"PeriodicalIF":3.7,"publicationDate":"2025-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144655092","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

DeMas: An efficient method for malicious samples detection and mitigation in cloud-based systems DeMas：在基于云的系统中检测和缓解恶意样本的有效方法

IF 3.7 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-07-15 DOI: 10.1016/j.sysarc.2025.103519

Hengqi Guo , Shijing Hu , Xin Xu , Yusiyuan Chen , Weishen Lu , Baoqi Huang , Qiang Duan

{"title":"DeMas: An efficient method for malicious samples detection and mitigation in cloud-based systems","authors":"Hengqi Guo , Shijing Hu , Xin Xu , Yusiyuan Chen , Weishen Lu , Baoqi Huang , Qiang Duan","doi":"10.1016/j.sysarc.2025.103519","DOIUrl":"10.1016/j.sysarc.2025.103519","url":null,"abstract":"<div><div>Cloud services, particularly large-scale computing and data platforms, have become integral to enterprise operations, processing vast volumes of input data in real-time. However, these systems are increasingly vulnerable to adversarial actors who inject malicious data, thereby posing substantial security threats. Prevailing detection mechanisms often emphasize unintended class exclusions, which are inadequate in mitigating malicious attacks and are especially susceptible to class imbalance. To overcome these limitations, we introduce <strong>DeMas</strong>, a novel framework for the detection and mitigation of malicious samples. DeMas synergistically integrates adversarial perturbation with neighborhood averaging to robustly identify anomalous inputs. Furthermore, it employs a diffusion model, guided by a tractable probabilistic model, to remediate identified threats at the input level. This dual-stage approach transforms malicious samples into benign counterparts, thereby enhancing the security of downstream cloud-based models while preserving the usability of the data. Our empirical evaluation demonstrates that DeMas achieves a detection accuracy of 91.37% on a dataset of malicious samples, affirming its efficacy as a comprehensive defense strategy for secure and scalable cloud computing environments.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"167 ","pages":"Article 103519"},"PeriodicalIF":3.7,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144670439","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

Repair friendly wide-stripe erasure coding for in-memory key–value stores 修复内存中键值存储的友好宽条擦除编码

IF 3.7 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-07-14 DOI: 10.1016/j.sysarc.2025.103516

Xuzhe Liu, Yuchong Hu, Dan Feng, Leihua Qin, Hai Zhou, Xin Zhao, Renzhi Xiao

{"title":"Repair friendly wide-stripe erasure coding for in-memory key–value stores","authors":"Xuzhe Liu, Yuchong Hu, Dan Feng, Leihua Qin, Hai Zhou, Xin Zhao, Renzhi Xiao","doi":"10.1016/j.sysarc.2025.103516","DOIUrl":"10.1016/j.sysarc.2025.103516","url":null,"abstract":"<div><div>Erasure coding is a low-cost redundancy mechanism over replication for in-memory key–value stores by storing stripes of data and parity chunks. <em>Wide stripes</em> are recently proposed to suppress the fraction of parity chunks in a stripe for extreme storage savings. However, wide stripes aggravate the repair penalty, and existing repair-efficient approaches for erasure coding fail to address this effectively.</div><div>We investigate two representative approaches, locally repairable codes (LRCs) and regenerating codes (RGCs), which reduce repair overhead in distributed storage. Building on this foundation, we propose two systematic solutions to address the repair penalty in wide-stripe erasure coding: (i) <em>Combine Locality (CL)</em>, a cross-rack data placement mechanism for Azure-LRC combining parity and topological locality, (ii) <em>Repair-Contribution-Based Placement (RCBP)</em>, a cross-rack data placement mechanism for Hitchhiker codes (a subclass of RGCs), strategically co-locating chunks with high repair contributions in the same rack. We apply CL-based LRC and RCBP-based Hitchhiker codes to in-memory key–value (KV) stores, augmenting them with efficient encoding and update schemes. Experiments on Amazon EC2 show that CL reduces the single-chunk repair time by up to 90.5% compared to locality-based state-of-the-art. RCBP improves repair throughput by up to 19.3% and 44.6% compared to original Hitchhiker and RS codes, respectively.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"167 ","pages":"Article 103516"},"PeriodicalIF":3.7,"publicationDate":"2025-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144655093","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

Blocking analysis of real-time tasks with parallel critical sections under federated scheduling 联合调度下具有并行临界区的实时任务阻塞分析

IF 3.7 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-07-12 DOI: 10.1016/j.sysarc.2025.103517

Yang Wang , Xu Jiang , Nan Guan , Yi Wang

{"title":"Blocking analysis of real-time tasks with parallel critical sections under federated scheduling","authors":"Yang Wang , Xu Jiang , Nan Guan , Yi Wang","doi":"10.1016/j.sysarc.2025.103517","DOIUrl":"10.1016/j.sysarc.2025.103517","url":null,"abstract":"<div><div>Locks are among the most common mechanisms for coordinating concurrent access to exclusive shared resources. Although extensive research has examined locking protocols and schedulability analysis for sequential real-time tasks, comparatively little attention has been paid to parallel tasks. Existing approaches commonly assume that critical sections must execute sequentially—an assumption maybe violated by realistic parallel programs. In this paper, we focus on the analysis of parallel real-time tasks containing parallel critical sections. We enhanced the locking protocols with new queue structure, new progress mechanism and propose novel analytical methods that accommodate both light (with density <span><math><mrow><mo>≤</mo><mn>1</mn></mrow></math></span>) and heavy tasks (with density <span><math><mrow><mo>></mo><mn>1</mn></mrow></math></span>), as opposed to approaches that exclusively target heavy tasks. We evaluate our techniques through comprehensive experiments, demonstrating that they improve upon existing methods by providing more accurate and efficient schedulability assessments.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"167 ","pages":"Article 103517"},"PeriodicalIF":3.7,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144631990","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

PQES: Post-quantum encryption and signature scheme based on FFT-accelerated polynomial ring lattice for IoT devices PQES：基于fft加速多项式环晶格的物联网设备后量子加密和签名方案

IF 3.7 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-07-12 DOI: 10.1016/j.sysarc.2025.103515

Zexiang Zhang , Hong Rao , Shaoqing Jia , Huiling Feng , Shuanggen Liu

{"title":"PQES: Post-quantum encryption and signature scheme based on FFT-accelerated polynomial ring lattice for IoT devices","authors":"Zexiang Zhang , Hong Rao , Shaoqing Jia , Huiling Feng , Shuanggen Liu","doi":"10.1016/j.sysarc.2025.103515","DOIUrl":"10.1016/j.sysarc.2025.103515","url":null,"abstract":"<div><div>With the rapid advancement of quantum computing, traditional public-key cryptosystems (e.g., RSA and ECC) are facing severe threats from quantum attacks (e.g., Shor’s algorithm). To address the demand for efficient and secure communication in resource-constrained scenarios such as the Internet of Things (IoT), this paper proposes an integrated quantum-resistant encryption and signature scheme based on polynomial ring lattices and accelerated by the Fast Fourier Transform (FFT). The scheme combines the Ring Learning With Errors (Ring-LWE) and Ring-LWE-Short Integer Solution (Ring-SIS) problems, optimizing operations over the polynomial ring <span><math><mrow><msub><mrow><mi>Z</mi></mrow><mrow><mi>q</mi></mrow></msub><mrow><mo>[</mo><mi>x</mi><mo>]</mo></mrow><mo>/</mo><mrow><mo>(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>N</mi></mrow></msup><mo>+</mo><mn>1</mn><mo>)</mo></mrow></mrow></math></span> to significantly reduce key and ciphertext sizes. Additionally, FFT techniques are introduced to accelerate polynomial multiplication, while finite field FFT and floating-point error correction mechanisms address precision issues. Experimental results demonstrate that for polynomial degrees <span><math><mrow><mi>N</mi><mo>≥</mo><mn>1024</mn></mrow></math></span>, the encryption time is reduced by 23% compared to CRYSTALS-Kyber, with a 35% decrease in memory consumption. Moreover, Our signature verification mechanism demonstrates significantly lower resource consumption compared to both CRYSTALS-Dilithium and Falcon implementations under equivalent security parameters, making it suitable for low-overhead verification on edge devices and efficient signing on servers.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"167 ","pages":"Article 103515"},"PeriodicalIF":3.7,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144606132","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

Improved A* search: A bandwidth allocation algorithm for Linux traffic control based on Hierarchical Token Bucket 改进的A*搜索：基于分层令牌桶的Linux流量控制带宽分配算法

IF 3.7 2区计算机科学

Journal of Systems Architecture Pub Date : 2025-07-11 DOI: 10.1016/j.sysarc.2025.103461

Huiyao Xiao , Xi Jin , Zhiwei Feng , Qingxu Deng , Changqing Xia , Chi Xu

引用次数: 0

GHVSA: Graph-based high-dimensional vector search accelerator GHVSA：基于图的高维矢量搜索加速器

IF 3.7 2区计算机科学

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

Wei Yuan, Huawen Liang, Xi Jin

引用次数: 0

EdgeMark: An automation and benchmarking system for embedded artificial intelligence tools EdgeMark：嵌入式人工智能工具的自动化和基准测试系统

IF 3.7 2区计算机科学

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

Mohammad Amin Hasanpour , Mikkel Kirkegaard , Xenofon Fafoutis

{"title":"EdgeMark: An automation and benchmarking system for embedded artificial intelligence tools","authors":"Mohammad Amin Hasanpour , Mikkel Kirkegaard , Xenofon Fafoutis","doi":"10.1016/j.sysarc.2025.103488","DOIUrl":"10.1016/j.sysarc.2025.103488","url":null,"abstract":"<div><div>The integration of artificial intelligence (AI) into embedded devices, a paradigm known as embedded artificial intelligence (eAI) or tiny machine learning (TinyML), is transforming industries by enabling intelligent data processing at the edge. However, the many tools available in this domain leave researchers and developers wondering which one is best suited to their needs. This paper provides a review of existing eAI tools, highlighting their features, trade-offs, and limitations. Additionally, we introduce EdgeMark, an open-source automation system designed to streamline the workflow for deploying and benchmarking machine learning (ML) models on embedded platforms. EdgeMark simplifies model generation, optimization, conversion, and deployment while promoting modularity, reproducibility, and scalability. Experimental benchmarking results showcase the performance of widely used eAI tools, including TensorFlow Lite Micro (TFLM), Edge Impulse, Ekkono, and Renesas eAI Translator, across a wide range of models, revealing insights into their relative strengths and weaknesses. The findings provide guidance for researchers and developers in selecting the most suitable tools for specific application requirements, while EdgeMark lowers the barriers to adoption of eAI technologies.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"167 ","pages":"Article 103488"},"PeriodicalIF":3.7,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144632731","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

MCED-H: An efficient scheduling policy for energy harvesting mixed-criticality real-time systems MCED-H：能量收集混合临界实时系统的高效调度策略

IF 3.7 2区计算机科学

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

Mostafa Tamimipour , Hakem Beitollahi , Maryline Chetto

引用次数: 0

Reachability analysis of Hybrid Rebeca models 混合Rebeca模型的可达性分析

IF 3.7 2区计算机科学

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

Fatemeh Ghassemi , Saeed Zhiany , Nesa Abbasi , Ali Hodaei , Ali Ataollahi , József Kovács , Erika Ábrahám , Marjan Sirjani

引用次数: 0