Journal of Parallel and Distributed Computing最新文献_第6页

How to reduce the number of steps for (multi-valued validated) Byzantine agreement? 如何减少（多值验证）拜占庭协议的步骤数？

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-17 DOI: 10.1016/j.jpdc.2025.105132

Baohan Huang , Haibin Zhang , Chao Liu , Shengli Liu , Yong Yu , Fangguo Zhang , Liehuang Zhu

Multi-valued validated Byzantine agreement (MVBA), a notion of Cachin, Kursawe, Petzold, and Shoup (CKPS), is a core primitive in fault-tolerant distributed computing and can be used to build asynchronous Byzantine atomic broadcast, Byzantine fault-tolerant state machine replication, and asynchronous distributed key generation protocols. Recently, a major breakthrough by Abraham, Malkhi, and Spiegelman (AMS) improves the CKPS construction with optimal word complexity and on average 19.5 steps. Lu, Lu, Tang, and Wang propose Dumbo-MVBA using erasure coding to reduce the communication of AMS MVBA and Dumbo-MVBA* which is a self-bootstrap framework transforming any MVBA into a communication-efficient implementation. This paper introduces a new way of building MVBA that shares the same communication as Dumbo-MVBA but has about 7/25 as many steps as Dumbo-MVBA. A central building block for our MVBA is a new distributed computing primitive—verifiable and validated asynchronous consistent information dispersal (VVCID) that is of independent interest. We provide two instantiations, one being based on fingerprinted cross-checksum (Hendricks, Ganger, and Reiter), and the other relying on erasure-coding proof systems (Alhaddad, Duan, Varia, and Zhang).

We further show that in the case where

n > 4 f

, we can build even more efficient protocols. In particular, we present the first asynchronous binary agreement (ABA) protocol that has strictly 2 steps in each round and achieves optimal word complexity, while prior such protocols require

n > 5 f

. Our ABA additionally has a new biased validity property allowing us to optimize our MVBA framework further: our new MVBA for

n > 4 f

has about one fifth as many steps as Dumbo-MVBA.

多值验证拜占庭协议（MVBA）是Cachin、Kursawe、Petzold和Shoup （CKPS）的概念，是容错分布式计算的核心原语，可用于构建异步拜占庭原子广播、拜占庭容错状态机复制和异步分布式密钥生成协议。最近，Abraham, Malkhi, and Spiegelman （AMS）的一项重大突破使CKPS的构建达到了最优的词复杂度，平均步骤为19.5。Lu, Lu, Tang， and Wang提出了使用擦除编码的Dumbo-MVBA来减少AMS MVBA和Dumbo-MVBA*之间的通信，Dumbo-MVBA*是一个将任何MVBA转换为通信高效实现的自引导框架。本文介绍了一种新的构建MVBA的方法，该方法与Dumbo-MVBA具有相同的通信，但其步骤约为Dumbo-MVBA的7/25。我们的MVBA的中心构建块是一种新的分布式计算原语——可验证和验证的异步一致信息分散（VVCID），这是一种独立的兴趣。我们提供了两个实例，一个基于指纹交叉校验和（Hendricks、Ganger和Reiter），另一个依赖于擦除编码证明系统（Alhaddad、Duan、Varia和Zhang）。我们进一步展示了在n>；4f的情况下，我们可以构建更有效的协议。特别是，我们提出了第一个异步二进制协议（ABA）协议，该协议每轮严格有2个步骤，并实现了最佳的字复杂度，而以前的此类协议需要n>；5f。我们的ABA还具有一个新的偏效性，允许我们进一步优化我们的MVBA框架：我们针对n>；4f的新MVBA的步骤大约是Dumbo-MVBA的五分之一。

{"title":"How to reduce the number of steps for (multi-valued validated) Byzantine agreement?","authors":"Baohan Huang , Haibin Zhang , Chao Liu , Shengli Liu , Yong Yu , Fangguo Zhang , Liehuang Zhu","doi":"10.1016/j.jpdc.2025.105132","DOIUrl":"10.1016/j.jpdc.2025.105132","url":null,"abstract":"<div><div>Multi-valued validated Byzantine agreement (MVBA), a notion of Cachin, Kursawe, Petzold, and Shoup (CKPS), is a core primitive in fault-tolerant distributed computing and can be used to build asynchronous Byzantine atomic broadcast, Byzantine fault-tolerant state machine replication, and asynchronous distributed key generation protocols. Recently, a major breakthrough by Abraham, Malkhi, and Spiegelman (AMS) improves the CKPS construction with optimal word complexity and on average 19.5 steps. Lu, Lu, Tang, and Wang propose Dumbo-MVBA using erasure coding to reduce the communication of AMS MVBA and Dumbo-MVBA* which is a self-bootstrap framework transforming any MVBA into a communication-efficient implementation. This paper introduces a new way of building MVBA that shares the same communication as Dumbo-MVBA but has about 7/25 as many steps as Dumbo-MVBA. A central building block for our MVBA is a new distributed computing primitive—verifiable and validated asynchronous consistent information dispersal (VVCID) that is of independent interest. We provide two instantiations, one being based on fingerprinted cross-checksum (Hendricks, Ganger, and Reiter), and the other relying on erasure-coding proof systems (Alhaddad, Duan, Varia, and Zhang).</div><div>We further show that in the case where <span><math><mi>n</mi><mo>></mo><mn>4</mn><mi>f</mi></math></span>, we can build even more efficient protocols. In particular, we present the first asynchronous binary agreement (ABA) protocol that has strictly 2 steps in each round and achieves optimal word complexity, while prior such protocols require <span><math><mi>n</mi><mo>></mo><mn>5</mn><mi>f</mi></math></span>. Our ABA additionally has a new biased validity property allowing us to optimize our MVBA framework further: our new MVBA for <span><math><mi>n</mi><mo>></mo><mn>4</mn><mi>f</mi></math></span> has about one fifth as many steps as Dumbo-MVBA.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105132"},"PeriodicalIF":3.4,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144337925","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

QPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements QPOPSS：查找频繁流元素的查询和并行优化节省空间

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-17 DOI: 10.1016/j.jpdc.2025.105134

Victor Jarlow , Charalampos Stylianopoulos , Marina Papatriantafilou

The frequent elements problem, a key component in demanding stream-data analytics, involves selecting elements whose occurrence exceeds a user-specified threshold. Fast, memory-efficient ϵ-approximate synopsis algorithms select all frequent elements but may overestimate them depending on ϵ (user-defined parameter). Evolving applications demand performance only achievable by parallelization. However, algorithmic guarantees concerning concurrent updates and queries have been overlooked. We propose Query and Parallelism Optimized Space-Saving (QPOPSS ), providing concurrency guarantees. A cornerstone of the design is a new approach for the main data structure for the Space-Saving algorithm, enabling support of very fast queries. QPOPSS combines minimal overlap with concurrent updates, distributing work and using fine-grained thread synchronization to achieve high throughput, accuracy, and low memory use. Our analysis shows space and approximation bounds under various concurrency and data distribution conditions. Our empirical evaluation relative to representative state-of-the-art methods reveals that QPOPSS 's multithreaded throughput scales linearly while maintaining the highest accuracy, with orders of magnitude smaller memory footprint.

频繁元素问题是要求苛刻的流数据分析中的一个关键组成部分，它涉及选择出现次数超过用户指定阈值的元素。快速、内存高效ϵ-approximate概要算法选择所有频繁元素，但可能会高估它们，这取决于λ（用户定义的参数）。不断发展的应用程序需要的性能只有通过并行化才能实现。然而，关于并发更新和查询的算法保证一直被忽视。我们提出了查询和并行优化节省空间（QPOPSS），提供并发性保证。该设计的一个基础是为节省空间算法的主数据结构提供了一种新方法，支持非常快的查询。QPOPSS将最小重叠与并发更新、分配工作和使用细粒度线程同步相结合，以实现高吞吐量、准确性和低内存使用。我们的分析显示了在各种并发性和数据分布条件下的空间和近似边界。我们的经验评估相对于代表性的最先进的方法表明，QPOPSS的多线程吞吐量线性扩展，同时保持最高的精度，具有更小的内存占用数量级。

{"title":"QPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements","authors":"Victor Jarlow , Charalampos Stylianopoulos , Marina Papatriantafilou","doi":"10.1016/j.jpdc.2025.105134","DOIUrl":"10.1016/j.jpdc.2025.105134","url":null,"abstract":"<div><div>The frequent elements problem, a key component in demanding stream-data analytics, involves selecting elements whose occurrence exceeds a user-specified threshold. Fast, memory-efficient <em>ϵ</em>-approximate synopsis algorithms select all frequent elements but may overestimate them depending on <em>ϵ</em> (user-defined parameter). Evolving applications demand performance only achievable by parallelization. However, algorithmic guarantees concerning concurrent updates and queries have been overlooked. We propose Query and Parallelism Optimized Space-Saving (QPOPSS ), providing concurrency guarantees. A cornerstone of the design is a new approach for the main data structure for the <em>Space-Saving</em> algorithm, enabling support of very fast queries. QPOPSS combines minimal overlap with concurrent updates, distributing work and using fine-grained thread synchronization to achieve high throughput, accuracy, and low memory use. Our analysis shows space and approximation bounds under various concurrency and data distribution conditions. Our empirical evaluation relative to representative state-of-the-art methods reveals that QPOPSS 's multithreaded throughput scales linearly while maintaining the highest accuracy, with orders of magnitude smaller memory footprint.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105134"},"PeriodicalIF":3.4,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144472089","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

Lightweight path aggregation network for pedestrian detection on FPGA board 基于FPGA板的行人检测轻量级路径聚合网络

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-16 DOI: 10.1016/j.jpdc.2025.105137

Riadh Ayachi , Mouna Afif , Yahia Said , Abdessalem Ben Abdelali

In urban environments, pedestrian safety stands as a pivotal metric dictating the accuracy and efficacy of cutting-edge technologies like Advanced Driver Assistance Systems (ADAS) and autonomous vehicles. However, the deployment of such technologies introduces various constraints, notably including the computational resources of processing boards. Therefore, constructing a robust pedestrian detection system necessitates achieving a delicate balance between performance and computational complexity. In this study, we propose the development of a lightweight Convolutional Neural Network (CNN) model specifically tailored for pedestrian detection. The backbone architecture of the model was meticulously searched using a network search engine predicated on the Multi-Objective Genetic Algorithm (NSGA-II) with a customized strategy. Notably, we shifted the search space from central processing units to Multi-Processor System-on-Chip (MPSoC) devices, aligning with the practical considerations of real-world applications. Our proposed model capitalizes on the path aggregation architecture coupled with a lightweight backbone design. The core concept revolves around the efficient transfer of high semantic features from the network's bottom to its top via the shortest path, thereby enhancing detection rates without introducing undue computational complexity. To ensure compatibility with embedded devices with limited memory, the proposed model underwent compression via quantization and pruning techniques. For rigorous evaluation, we tested the pedestrian detection model on the Xilinx ZCU 102 board, utilizing the Karlsruhe Institute of Technology and Toyota Technological Institute (KITTI) dataset for training and evaluation purposes. The reported results substantiate the efficacy of our proposed model, boasting a mean average precision (mAP) of 93.6 % alongside a commendable processing speed of 13 frames per second (FPS). These outcomes underscore the suitability of the proposed model for real-life scenarios, wherein ensuring a high level of safety remains paramount.

在城市环境中，行人安全是决定先进驾驶辅助系统（ADAS）和自动驾驶汽车等尖端技术准确性和有效性的关键指标。然而，这些技术的部署引入了各种限制，特别是包括处理板的计算资源。因此，构建一个鲁棒的行人检测系统需要在性能和计算复杂度之间取得微妙的平衡。在这项研究中，我们提出了一种专门为行人检测量身定制的轻量级卷积神经网络（CNN）模型的开发。使用基于多目标遗传算法（NSGA-II）的网络搜索引擎和定制策略对模型的主干架构进行精细搜索。值得注意的是，我们将搜索空间从中央处理单元转移到多处理器片上系统（MPSoC）设备，以符合实际应用的实际考虑。我们提出的模型利用了路径聚合架构和轻量级主干设计。核心概念围绕着通过最短路径将高语义特征从网络的底部有效地转移到网络的顶部，从而在不引入过度计算复杂性的情况下提高检测率。为了确保与有限内存的嵌入式设备兼容，所提出的模型通过量化和修剪技术进行压缩。为了进行严格的评估，我们在赛灵思ZCU 102板上测试了行人检测模型，利用卡尔斯鲁厄理工学院和丰田理工学院（KITTI）的数据集进行训练和评估。报告的结果证实了我们提出的模型的有效性，拥有93.6%的平均精度（mAP）以及令人称道的每秒13帧（FPS）的处理速度。这些结果强调了所提出的模型对现实场景的适用性，在现实场景中，确保高水平的安全性仍然是至关重要的。

{"title":"Lightweight path aggregation network for pedestrian detection on FPGA board","authors":"Riadh Ayachi , Mouna Afif , Yahia Said , Abdessalem Ben Abdelali","doi":"10.1016/j.jpdc.2025.105137","DOIUrl":"10.1016/j.jpdc.2025.105137","url":null,"abstract":"<div><div>In urban environments, pedestrian safety stands as a pivotal metric dictating the accuracy and efficacy of cutting-edge technologies like Advanced Driver Assistance Systems (ADAS) and autonomous vehicles. However, the deployment of such technologies introduces various constraints, notably including the computational resources of processing boards. Therefore, constructing a robust pedestrian detection system necessitates achieving a delicate balance between performance and computational complexity. In this study, we propose the development of a lightweight Convolutional Neural Network (CNN) model specifically tailored for pedestrian detection. The backbone architecture of the model was meticulously searched using a network search engine predicated on the Multi-Objective Genetic Algorithm (NSGA-II) with a customized strategy. Notably, we shifted the search space from central processing units to Multi-Processor System-on-Chip (MPSoC) devices, aligning with the practical considerations of real-world applications. Our proposed model capitalizes on the path aggregation architecture coupled with a lightweight backbone design. The core concept revolves around the efficient transfer of high semantic features from the network's bottom to its top via the shortest path, thereby enhancing detection rates without introducing undue computational complexity. To ensure compatibility with embedded devices with limited memory, the proposed model underwent compression via quantization and pruning techniques. For rigorous evaluation, we tested the pedestrian detection model on the Xilinx ZCU 102 board, utilizing the Karlsruhe Institute of Technology and Toyota Technological Institute (KITTI) dataset for training and evaluation purposes. The reported results substantiate the efficacy of our proposed model, boasting a mean average precision (mAP) of 93.6 % alongside a commendable processing speed of 13 frames per second (FPS). These outcomes underscore the suitability of the proposed model for real-life scenarios, wherein ensuring a high level of safety remains paramount.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105137"},"PeriodicalIF":3.4,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144321376","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

Fog computing based public key encryption with multi-keyword search for Internet of vehicles 基于雾计算的车联网多关键字公钥加密

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-13 DOI: 10.1016/j.jpdc.2025.105131

Mandira Banik, Sanjay Kumar

Fog-based computation is an interesting computing paradigm developed for giving end users access to real-time services in the Internet of Vehicles (IoV). Achieving safe and effective data sharing is a huge challenge in such a dynamic system architecture. As a promising cryptographic primitive, searchable encryption (SE) aims to maintain data searchability while maintaining data confidentiality. Nonetheless, the majority of current methods are open to attacks by leaking exploitation. So, we develop a fog-based searchable public key encryption scheme (FC-PEMKS) that achieves forward security and multi-keyword search in the IoV network. The security proof shows that our model achieves the indistinguishability of trapdoor and keyword index. The outcomes of the comparative simulations and performance analysis demonstrate the viability and effectiveness of the FC-PEMKS scheme in fog-enabled vehicular networks.

基于雾的计算是一种有趣的计算范式，用于为最终用户提供车辆互联网（IoV）中的实时服务。在这样一个动态的系统架构中，实现安全有效的数据共享是一个巨大的挑战。可搜索加密（SE）是一种很有前途的加密原语，其目的是在保持数据机密性的同时保持数据的可搜索性。尽管如此，目前的大多数方法都容易受到泄漏利用的攻击。为此，我们开发了一种基于雾的可搜索公钥加密方案（FC-PEMKS），实现了车联网中的前向安全和多关键字搜索。安全性证明表明，该模型实现了活板门和关键字索引的不可区分性。对比仿真和性能分析的结果证明了FC-PEMKS方案在雾化车辆网络中的可行性和有效性。

引用次数: 0

SHAP-based intrusion detection in IoT networks using quantum neural networks on IonQ hardware 在IonQ硬件上使用量子神经网络的物联网网络中基于shap的入侵检测

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-13 DOI: 10.1016/j.jpdc.2025.105133

K Rajkumar, S. Mercy Shalinie

Securing IoT networks against cyber-attacks, especially Distributed Denial of Service (DDoS) attacks, is a growing challenge due to their ability to disrupt services and overwhelm network resources. This study introduces a novel post-processing methodology that integrates Explainable AI (XAI) with Quantum Neural Networks (QNN) to enhance the interpretability of DDoS attack detection. We utilize the CICFlowMeter tool for feature extraction, processing bidirectional network traffic data and generating up to 87 distinct features. Notably, the CICFlowMeter removes potentially tampered features such as IP addresses and ports to prevent manipulation, addressing the limitations associated with the use of these features in the presence of attackers. After a QNN generates expectation values for a given input, SHAP (SHapley Additive exPlanations) values are applied to interpret the contributions of individual features in the decision-making process. Although the QNN output indicates whether a network flow is benign or malicious, the quantum model's complexity makes it difficult to interpret. By using SHAP values, we identify which features such as IP addresses, ports, and traffic patterns significantly influence the QNN’s classification, providing human-understandable explanations for the model's predictions. For evaluation, we used the CIC-IoT 2022and proposed SDN-DDoS24 datasets, with SDN-DDoS24 outperforming others when integrated with the proposed methodology. The QNN was implemented on IonQ quantum hardware through Amazon Braket, achieving an expectation value of 0.98 with a low latency of 113 milliseconds, making it suitable for applications requiring both precision and speed. This study demonstrates that integrating XAI with QNN not only improves DDoS attack detection accuracy but also enhances transparency, making the model more trustworthy for real-world cybersecurity applications. By offering clear explanations of model behavior, the approach ensures that security experts can make informed decisions based on the quantum-enhanced detection system, improving its reliability and usability in dynamic network environments.

保护物联网网络免受网络攻击，特别是分布式拒绝服务（DDoS）攻击，是一项日益严峻的挑战，因为它们能够破坏服务并压倒网络资源。本研究介绍了一种新的后处理方法，该方法将可解释人工智能（XAI）与量子神经网络（QNN）相结合，以增强DDoS攻击检测的可解释性。我们利用CICFlowMeter工具进行特征提取，处理双向网络流量数据，并生成多达87个不同的特征。值得注意的是，CICFlowMeter删除了潜在的篡改功能，如IP地址和端口，以防止操作，解决了在攻击者存在的情况下使用这些功能的限制。在QNN为给定输入生成期望值后，应用SHapley加性解释（SHapley Additive explanation）值来解释决策过程中各个特征的贡献。尽管QNN的输出表明网络流是良性的还是恶意的，但量子模型的复杂性使其难以解释。通过使用SHAP值，我们确定哪些特征（如IP地址、端口和流量模式）显著影响QNN的分类，为模型的预测提供人类可以理解的解释。为了进行评估，我们使用了CIC-IoT 2022和建议的SDN-DDoS24数据集，其中SDN-DDoS24在与建议的方法集成时优于其他数据集。该QNN通过Amazon rack在IonQ量子硬件上实现，实现了0.98的期望值和113毫秒的低延迟，使其适合同时要求精度和速度的应用。该研究表明，将XAI与QNN集成不仅可以提高DDoS攻击检测的准确性，还可以增强透明度，使模型在现实世界的网络安全应用中更值得信赖。通过提供模型行为的清晰解释，该方法确保安全专家能够根据量子增强检测系统做出明智的决策，提高其在动态网络环境中的可靠性和可用性。

{"title":"SHAP-based intrusion detection in IoT networks using quantum neural networks on IonQ hardware","authors":"K Rajkumar, S. Mercy Shalinie","doi":"10.1016/j.jpdc.2025.105133","DOIUrl":"10.1016/j.jpdc.2025.105133","url":null,"abstract":"<div><div>Securing IoT networks against cyber-attacks, especially Distributed Denial of Service (DDoS) attacks, is a growing challenge due to their ability to disrupt services and overwhelm network resources. This study introduces a novel post-processing methodology that integrates Explainable AI (XAI) with Quantum Neural Networks (QNN) to enhance the interpretability of DDoS attack detection. We utilize the CICFlowMeter tool for feature extraction, processing bidirectional network traffic data and generating up to 87 distinct features. Notably, the CICFlowMeter removes potentially tampered features such as IP addresses and ports to prevent manipulation, addressing the limitations associated with the use of these features in the presence of attackers. After a QNN generates expectation values for a given input, SHAP (SHapley Additive exPlanations) values are applied to interpret the contributions of individual features in the decision-making process. Although the QNN output indicates whether a network flow is benign or malicious, the quantum model's complexity makes it difficult to interpret. By using SHAP values, we identify which features such as IP addresses, ports, and traffic patterns significantly influence the QNN’s classification, providing human-understandable explanations for the model's predictions. For evaluation, we used the CIC-IoT 2022and proposed SDN-DDoS24 datasets, with SDN-DDoS24 outperforming others when integrated with the proposed methodology. The QNN was implemented on IonQ quantum hardware through Amazon Braket, achieving an expectation value of 0.98 with a low latency of 113 milliseconds, making it suitable for applications requiring both precision and speed. This study demonstrates that integrating XAI with QNN not only improves DDoS attack detection accuracy but also enhances transparency, making the model more trustworthy for real-world cybersecurity applications. By offering clear explanations of model behavior, the approach ensures that security experts can make informed decisions based on the quantum-enhanced detection system, improving its reliability and usability in dynamic network environments.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105133"},"PeriodicalIF":3.4,"publicationDate":"2025-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144321377","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

Line formation and scattering in silent programmable matter 无声可编程物质中的线形成和散射

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-11 DOI: 10.1016/j.jpdc.2025.105129

Alfredo Navarra , Francesco Piselli , Giuseppe Prencipe

Programmable Matter (PM) has been widely investigated in recent years. It refers to some kind of substance with the ability to change its physical properties (e.g., shape or color) in a programmable way. In this paper, we refer to the

SILBOT

model, where the particles live and move on a triangular grid, are asynchronous in their computations and movements, and do not possess any direct means of communication (silent) or memory of past events (oblivious).

Within

SILBOT

, we aim at studying Spanning problems, i.e., problems where the particles are required to suitably span all over the grid. We first address the Line Formation problem where the particles are required to end up in a configuration where they all lie on a line, i.e., they are aligned and connected. Secondly, we deal with the more general Scattering problem: starting from any initial configuration, we aim at reaching a final one where no particles occupy neighboring nodes. Furthermore, we investigate configurations where some nodes of the grid can be occupied by unmovable elements (i.e., obstacles) from both theoretical and experimental view points.

可编程物质（PM）近年来得到了广泛的研究。它指的是某种能够以可编程的方式改变其物理特性（例如形状或颜色）的物质。在本文中，我们引用了SILBOT模型，其中粒子在三角形网格上生活和移动，它们的计算和运动是异步的，并且不具有任何直接的通信手段（沉默）或过去事件的记忆（遗忘）。在SILBOT中，我们的目标是研究跨越问题，即要求粒子适当地跨越整个网格的问题。我们首先解决线的形成问题，其中粒子被要求最终在一个配置，他们都躺在一条线上，即，他们是对齐和连接。其次，我们处理更一般的散射问题：从任何初始配置开始，我们的目标是达到没有粒子占据邻近节点的最终配置。此外，我们从理论和实验的角度研究了网格的一些节点可以被不可移动的元素（即障碍物）占用的配置。

{"title":"Line formation and scattering in silent programmable matter","authors":"Alfredo Navarra , Francesco Piselli , Giuseppe Prencipe","doi":"10.1016/j.jpdc.2025.105129","DOIUrl":"10.1016/j.jpdc.2025.105129","url":null,"abstract":"<div><div>Programmable Matter (PM) has been widely investigated in recent years. It refers to some kind of substance with the ability to change its physical properties (e.g., shape or color) in a programmable way. In this paper, we refer to the <span><math><mi>SILBOT</mi></math></span> model, where the particles live and move on a triangular grid, are asynchronous in their computations and movements, and do not possess any direct means of communication (silent) or memory of past events (oblivious).</div><div>Within <span><math><mi>SILBOT</mi></math></span>, we aim at studying <em>Spanning</em> problems, i.e., problems where the particles are required to suitably span all over the grid. We first address the <span>Line Formation</span> problem where the particles are required to end up in a configuration where they all lie on a line, i.e., they are aligned and connected. Secondly, we deal with the more general <span>Scattering</span> problem: starting from any initial configuration, we aim at reaching a final one where no particles occupy neighboring nodes. Furthermore, we investigate configurations where some nodes of the grid can be occupied by unmovable elements (i.e., obstacles) from both theoretical and experimental view points.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105129"},"PeriodicalIF":3.4,"publicationDate":"2025-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144271562","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

Mitigating DDoS attacks in containerized environments: A comparative analysis of Docker and Kubernetes 减轻容器化环境中的DDoS攻击：Docker和Kubernetes的比较分析

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-11 DOI: 10.1016/j.jpdc.2025.105130

Yung-Ting Chuang, Chih-Han Tu

Containerization has become the primary method for deploying applications, with web services being the most prevalent. However, exposing server IP addresses to external connections renders containerized services vulnerable to DDoS attacks, which can deplete server resources and hinder legitimate user access. To address this issue, we implement twelve different mitigation strategies, test them across three common types of web services, and conduct experiments on both Docker and Kubernetes deployment platforms. Furthermore, this study introduces a cross-platform, orchestration-aware evaluation framework that simulates realistic multi-service workloads and analyzes defense strategy performance under varying concurrency conditions. Experimental results indicate that Docker excels in managing white-listed traffic and delaying attacker responses, while Kubernetes achieves low completion times, minimum response times, and low failure rates by processing all requests simultaneously. Based on these findings, we provide actionable insights for selecting appropriate mitigation strategies tailored to different orchestration environments and workload patterns, offering practical guidance for securing containerized deployments against low-rate DDoS threats. Our work not only provides empirical performance evaluations but also reveals deployment-specific trade-offs, offering strategic recommendations for building resilient cloud-native infrastructures.

容器化已经成为部署应用程序的主要方法，其中web服务最为流行。但是，将服务器IP地址暴露给外部连接会使容器化服务容易受到DDoS攻击，从而耗尽服务器资源并阻碍合法用户访问。为了解决这个问题，我们实施了12种不同的缓解策略，在三种常见的web服务类型上进行了测试，并在Docker和Kubernetes部署平台上进行了实验。此外，本研究引入了一个跨平台的、编排感知的评估框架，该框架模拟了现实的多服务工作负载，并分析了不同并发条件下的防御策略性能。实验结果表明，Docker在管理白名单流量和延迟攻击者响应方面表现出色，而Kubernetes通过同时处理所有请求，实现了低完成时间、最小响应时间和低故障率。基于这些发现，我们为选择适合不同编排环境和工作负载模式的适当缓解策略提供了可操作的见解，并为保护容器化部署免受低速率DDoS威胁提供了实用指导。我们的工作不仅提供了经验性能评估，还揭示了部署特定的权衡，为构建弹性云原生基础设施提供了战略建议。

{"title":"Mitigating DDoS attacks in containerized environments: A comparative analysis of Docker and Kubernetes","authors":"Yung-Ting Chuang, Chih-Han Tu","doi":"10.1016/j.jpdc.2025.105130","DOIUrl":"10.1016/j.jpdc.2025.105130","url":null,"abstract":"<div><div>Containerization has become the primary method for deploying applications, with web services being the most prevalent. However, exposing server IP addresses to external connections renders containerized services vulnerable to DDoS attacks, which can deplete server resources and hinder legitimate user access. To address this issue, we implement twelve different mitigation strategies, test them across three common types of web services, and conduct experiments on both Docker and Kubernetes deployment platforms. Furthermore, this study introduces a cross-platform, orchestration-aware evaluation framework that simulates realistic multi-service workloads and analyzes defense strategy performance under varying concurrency conditions. Experimental results indicate that Docker excels in managing white-listed traffic and delaying attacker responses, while Kubernetes achieves low completion times, minimum response times, and low failure rates by processing all requests simultaneously. Based on these findings, we provide actionable insights for selecting appropriate mitigation strategies tailored to different orchestration environments and workload patterns, offering practical guidance for securing containerized deployments against low-rate DDoS threats. Our work not only provides empirical performance evaluations but also reveals deployment-specific trade-offs, offering strategic recommendations for building resilient cloud-native infrastructures.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105130"},"PeriodicalIF":3.4,"publicationDate":"2025-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144280939","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

Leveraging Multi-Instance GPUs through moldable task scheduling 通过可建模的任务调度利用多实例gpu

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-06 DOI: 10.1016/j.jpdc.2025.105128

Jorge Villarrubia, Luis Costero, Francisco D. Igual, Katzalin Olcoz

NVIDIA MIG (Multi-Instance GPU) allows partitioning a physical GPU into multiple logical instances with fully-isolated resources, which can be dynamically reconfigured. This work highlights the untapped potential of MIG through moldable task scheduling with dynamic reconfigurations. Specifically, we propose a makespan minimization problem for multi-task execution under MIG constraints. Our profiling shows that assuming monotonicity in task work with respect to resources is not viable, as is usual in multicore scheduling. Relying on a state-of-the-art proposal that does not require such an assumption, we present FAR, a 3-phase algorithm to solve the problem. Phase 1 of FAR builds on a classical task moldability method, phase 2 combines Longest Processing Time First and List Scheduling with a novel repartitioning tree heuristic tailored to MIG constraints, and phase 3 employs local search via task moves and swaps. FAR schedules tasks in batches offline, concatenating their schedules on the fly in an improved way that favors resource reuse. Excluding reconfiguration costs, the List Scheduling proof shows an approximation factor of 7/4 on the NVIDIA A30 model. We adapt the technique to the particular constraints of an NVIDIA A100/H100 to obtain an approximation factor of 2. Including the reconfiguration cost, our real-world experiments reveal a makespan with respect to the optimum no worse than 1.22× for a well-known suite of benchmarks, and 1.10× for synthetic inputs inspired by real kernels. We obtain good experimental results for each batch of tasks, but also in the concatenation of batches, with large improvements over the state-of-the-art and proposals without GPU reconfiguration. Moreover, we show that the proposed heuristics allow a correct adaptation to tasks of very different characteristics. Beyond the specific algorithm, the paper demonstrates the research potential of the MIG technology and suggests useful metrics, workload characterizations and evaluation techniques for future work in this field.

NVIDIA MIG （Multi-Instance GPU）允许将一个物理GPU划分为多个逻辑实例，这些实例具有完全隔离的资源，可以动态重新配置。这项工作通过动态重新配置的可建模任务调度突出了MIG尚未开发的潜力。具体来说，我们提出了在MIG约束下多任务执行的最大完成时间最小化问题。我们的分析表明，假设任务工作相对于资源是单调的，这在多核调度中是不可行的。依靠最先进的建议，不需要这样的假设，我们提出FAR，一个三阶段算法来解决这个问题。FAR的第一阶段建立在经典的任务可塑性方法之上，第二阶段结合了最长处理时间优先和列表调度以及针对MIG约束的新颖的重新划分树启发式方法，第三阶段通过任务移动和交换使用本地搜索。FAR脱机分批调度任务，以一种有利于资源重用的改进方式动态地连接它们的调度。排除重新配置成本，列表调度证明显示NVIDIA A30模型上的近似因子为7/4。我们将该技术应用于NVIDIA A100/H100的特定约束，以获得近似因子2。包括重新配置成本在内，我们的真实世界实验表明，对于一组著名的基准测试，相对于最优的makespan不低于1.22倍，对于由真实内核启发的合成输入，makespan不低于1.10倍。我们对每批任务都获得了良好的实验结果，而且在批的串联中也获得了良好的实验结果，比最新的技术和建议有了很大的改进，而不需要重新配置GPU。此外，我们表明，提出的启发式允许正确的适应任务非常不同的特点。除了具体的算法之外，本文还展示了MIG技术的研究潜力，并为该领域的未来工作提出了有用的度量、工作量表征和评估技术。

{"title":"Leveraging Multi-Instance GPUs through moldable task scheduling","authors":"Jorge Villarrubia, Luis Costero, Francisco D. Igual, Katzalin Olcoz","doi":"10.1016/j.jpdc.2025.105128","DOIUrl":"10.1016/j.jpdc.2025.105128","url":null,"abstract":"<div><div>NVIDIA MIG (Multi-Instance GPU) allows partitioning a physical GPU into multiple logical instances with fully-isolated resources, which can be dynamically reconfigured. This work highlights the untapped potential of MIG through moldable task scheduling with dynamic reconfigurations. Specifically, we propose a makespan minimization problem for multi-task execution under MIG constraints. Our profiling shows that assuming monotonicity in task work with respect to resources is not viable, as is usual in multicore scheduling. Relying on a state-of-the-art proposal that does not require such an assumption, we present <span>FAR</span>, a 3-phase algorithm to solve the problem. Phase 1 of FAR builds on a classical task moldability method, phase 2 combines Longest Processing Time First and List Scheduling with a novel repartitioning tree heuristic tailored to MIG constraints, and phase 3 employs local search via task moves and swaps. <span>FAR</span> schedules tasks in batches offline, concatenating their schedules on the fly in an improved way that favors resource reuse. Excluding reconfiguration costs, the List Scheduling proof shows an approximation factor of 7/4 on the NVIDIA A30 model. We adapt the technique to the particular constraints of an NVIDIA A100/H100 to obtain an approximation factor of 2. Including the reconfiguration cost, our real-world experiments reveal a makespan with respect to the optimum no worse than 1.22× for a well-known suite of benchmarks, and 1.10× for synthetic inputs inspired by real kernels. We obtain good experimental results for each batch of tasks, but also in the concatenation of batches, with large improvements over the state-of-the-art and proposals without GPU reconfiguration. Moreover, we show that the proposed heuristics allow a correct adaptation to tasks of very different characteristics. Beyond the specific algorithm, the paper demonstrates the research potential of the MIG technology and suggests useful metrics, workload characterizations and evaluation techniques for future work in this field.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105128"},"PeriodicalIF":3.4,"publicationDate":"2025-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144254815","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

Privacy-enabled academic certificate authentication and deep learning-based student performance prediction system using hyperledger blockchain technology 支持隐私的学术证书认证和基于深度学习的学生成绩预测系统，使用超级账本区块链技术

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-05 DOI: 10.1016/j.jpdc.2025.105119

Sangeetha A․S , Shunmugan S

Blockchain systems do not rely on trust for electronic transactions and it emerged as a popular technology due to its attributes like immutability, transparency, distributed storage, and decentralized control. Student certificates and skill verification play crucial roles in job applications and other purposes. In traditional systems, certificate forgery is a common problem, especially in online education. Processes, such as issuing and verifying student certifications along with student performance prediction for higher education or job recruitment are often lengthy and time-consuming. Integrating blockchain into certificate verification protocols offers authenticity and significantly reduces processing times. Hence, this research introduced a novel secure privacy preservation-based academic certificate authentication system (CertAuthSystem) for verifying the academic certificates of students. The CertAuthSystem contains different entities, such as Student, System, University, Blockchain, and Company. The university issues certificates to students, which are stored in Blockchain, and when the student applies for a job/scholarship, he/she transmits the certificate and the blockID to the organization, based on which verification is performed. Moreover, the student’s performance is predicted by a classifier named Deep Long Short-Term Memory (DLSTM). Then, CertAuthSystem is examined for its superiority considering measures, like validation time, memory, throughput and execution time and has achieved values of 53.412 ms, 86.6 MB, 94.876 Mbps, and 73.57 ms, correspondingly for block size 7. Finally, the prediction analysis of the DLSTM classifier is done based on evaluation metrics, such as precision, recall and F measure, which attained superior values of 90.77 %, 92.99 %, and 91.86 %.

区块链系统不依赖于电子交易的信任，由于其不变性、透明度、分布式存储和分散控制等属性，它成为一种流行的技术。学生证书和技能验证在工作申请和其他目的中起着至关重要的作用。在传统的教育系统中，证书伪造是一个常见的问题，特别是在网络教育中。诸如颁发和验证学生证书以及高等教育或工作招聘的学生表现预测等过程通常是漫长而耗时的。将区块链集成到证书验证协议中提供了真实性，并大大缩短了处理时间。因此，本研究提出了一种基于安全隐私保护的新型学历证书认证系统（CertAuthSystem），用于对学生的学历证书进行验证。CertAuthSystem包含不同的实体，如Student、System、University、区块链和Company。大学向学生颁发证书，这些证书存储在区块链中，当学生申请工作/奖学金时，他/她将证书和blockID传送给组织，根据该组织进行验证。此外，学生的表现是由一个分类器称为深长短期记忆（DLSTM）预测。然后，考虑验证时间、内存、吞吐量和执行时间等指标，对CertAuthSystem的优越性进行了检验，在块大小为7的情况下，CertAuthSystem的值分别为53.412 ms、86.6 MB、94.876 Mbps和73.57 ms。最后，基于准确率、召回率和F度量等评价指标对DLSTM分类器进行预测分析，得到了90.77%、92.99%和91.86%的优值。

{"title":"Privacy-enabled academic certificate authentication and deep learning-based student performance prediction system using hyperledger blockchain technology","authors":"Sangeetha A․S , Shunmugan S","doi":"10.1016/j.jpdc.2025.105119","DOIUrl":"10.1016/j.jpdc.2025.105119","url":null,"abstract":"<div><div>Blockchain systems do not rely on trust for electronic transactions and it emerged as a popular technology due to its attributes like immutability, transparency, distributed storage, and decentralized control. Student certificates and skill verification play crucial roles in job applications and other purposes. In traditional systems, certificate forgery is a common problem, especially in online education. Processes, such as issuing and verifying student certifications along with student performance prediction for higher education or job recruitment are often lengthy and time-consuming. Integrating blockchain into certificate verification protocols offers authenticity and significantly reduces processing times. Hence, this research introduced a novel secure privacy preservation-based academic certificate authentication system (CertAuthSystem) for verifying the academic certificates of students. The CertAuthSystem contains different entities, such as Student, System, University, Blockchain, and Company. The university issues certificates to students, which are stored in Blockchain, and when the student applies for a job/scholarship, he/she transmits the certificate and the blockID to the organization, based on which verification is performed. Moreover, the student’s performance is predicted by a classifier named Deep Long Short-Term Memory (DLSTM). Then, CertAuthSystem is examined for its superiority considering measures, like validation time, memory, throughput and execution time and has achieved values of 53.412 ms, 86.6 MB, 94.876 Mbps, and 73.57 ms, correspondingly for block size 7. Finally, the prediction analysis of the DLSTM classifier is done based on evaluation metrics, such as precision, recall and F measure, which attained superior values of 90.77 %, 92.99 %, and 91.86 %.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105119"},"PeriodicalIF":3.4,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144289001","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

Front Matter 1 - Full Title Page (regular issues)/Special Issue Title page (special issues) 封面1 -完整的扉页（每期）/特刊扉页（每期）

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing

Pub Date : 2025-06-05 DOI: 10.1016/S0743-7315(25)00089-9

引用次数: 0