Journal of Parallel and Distributed Computing最新文献

{"title":"Dispersion of mobile robots on directed anonymous graphs","authors":"Giuseppe F. Italiano ,&nbsp;Debasish Pattanayak ,&nbsp;Gokarna Sharma","doi":"10.1016/j.jpdc.2025.105139","DOIUrl":"10.1016/j.jpdc.2025.105139","url":null,"abstract":"<div><div>Given any arbitrary initial configuration of <span><math><mi>k</mi><mo>≤</mo><mi>n</mi></math></span> robots positioned on the nodes of an <em>n</em>-node anonymous graph, the problem of dispersion is to autonomously reposition the robots such that each node will contain at most one robot. This problem gained significant interest due to its resemblance with several fundamental problems such as exploration, scattering, load balancing, relocation of electric cars to charging stations, etc. The objective is to solve dispersion simultaneously minimizing (or providing trade-off between) time and memory requirement at each robot. The literature mainly dealt with dispersion on undirected anonymous graphs. In this paper, we initiate the study of dispersion on directed anonymous graphs. We first show that it may not always be possible to solve dispersion when the directed graph is not strongly connected. We then establish some lower bounds on both time and memory requirement at each robot for solving dispersion on a strongly connected directed graph. Finally, we provide three deterministic algorithms solving dispersion on any strongly connected directed graph. Let <em>D</em> be the graph diameter, <span><math><msub><mrow><mi>Δ</mi></mrow><mrow><mi>o</mi><mi>u</mi><mi>t</mi></mrow></msub></math></span> be its maximum out-degree, and <em>d</em> be the deficiency (the minimum number of edges needed to add to the graph to make it Eulerian). The first algorithm solves dispersion in <span><math><mi>O</mi><mo>(</mo><mi>d</mi><mo>⋅</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> time with <span><math><mi>O</mi><mo>(</mo><mi>k</mi><mo>⋅</mo><mi>log</mi><mo>⁡</mo><mo>(</mo><mi>k</mi><mo>+</mo><msub><mrow><mi>Δ</mi></mrow><mrow><mi>o</mi><mi>u</mi><mi>t</mi></mrow></msub><mo>)</mo><mo>)</mo></math></span> bits at each robot. The second algorithm solves dispersion in <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>⋅</mo><msub><mrow><mi>Δ</mi></mrow><mrow><mi>o</mi><mi>u</mi><mi>t</mi></mrow></msub><mo>)</mo></math></span> time with <span><math><mi>O</mi><mo>(</mo><mi>log</mi><mo>⁡</mo><mo>(</mo><mi>k</mi><mo>+</mo><msub><mrow><mi>Δ</mi></mrow><mrow><mi>o</mi><mi>u</mi><mi>t</mi></mrow></msub><mo>)</mo><mo>)</mo></math></span> bits at each robot. The third algorithm solves dispersion in <span><math><mi>O</mi><mo>(</mo><mi>k</mi><mo>⋅</mo><mi>D</mi><mo>)</mo></math></span> time with <span><math><mi>O</mi><mo>(</mo><mi>k</mi><mo>⋅</mo><mi>log</mi><mo>⁡</mo><mo>(</mo><mi>k</mi><mo>+</mo><msub><mrow><mi>Δ</mi></mrow><mrow><mi>o</mi><mi>u</mi><mi>t</mi></mrow></msub><mo>)</mo><mo>)</mo></math></span> bits at each robot, provided that robots in the 1-hop neighborhood can communicate. All three algorithms extend to handle crash faults.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105139"},"PeriodicalIF":3.4,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144489471","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}

{"title":"Privacy-enabled academic certificate authentication and deep learning-based student performance prediction system using hyperledger blockchain technology","authors":"Sangeetha A․S ,&nbsp;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-10-01","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}

{"title":"Edge metric basis and its fault tolerance over certain interconnection networks","authors":"S. Prabhu ,&nbsp;T. Jenifer Janany ,&nbsp;M. Arulperumjothi ,&nbsp;I.G. Yero","doi":"10.1016/j.jpdc.2025.105141","DOIUrl":"10.1016/j.jpdc.2025.105141","url":null,"abstract":"<div><div>The surveillance of elements in an interconnection network is a classical problem in computer engineering. In addition, it is a problem closely related to uniquely identifying the elements of the network, which is indeed a classical distance-related problem in graph theory. This surveillance can be considered for different styles of elements in the network. The classical version centers the attention on the nodes, while some recent variations of it consider monitoring also the edges or both, vertices and edges at the same time. The first style gave rise to graph structures, called edge resolving set and edge metric basis, which is used to uniquely identify the edges of a given network by means of distance vectors. A vertex <em>x</em> in a graph <em>G</em> uniquely recognizes (resolves or identifies) two edges <em>e</em> and <em>f</em> in <em>G</em> if <span><math><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>[</mo><mi>e</mi><mo>,</mo><mi>x</mi><mo>]</mo><mo>≠</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>[</mo><mi>f</mi><mo>,</mo><mi>x</mi><mo>]</mo></math></span>, where <span><math><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>[</mo><mi>e</mi><mo>,</mo><mi>x</mi><mo>]</mo></math></span> stands for the distance between a vertex <em>x</em> and an edge <em>e</em> of <em>G</em>. A set <em>S</em> with the smallest number of vertices, such that every couple of edges is uniquely recognized by a minimum of one vertex in <em>S</em>, is an edge metric basis, and the edge metric dimension refers to the cardinality of such <em>S</em>. Fault tolerance of a working system is the ability of such a system to keep functioning even if one of its parts stops working properly. The fault tolerance property of the edge metric basis is considered in this work. This results in a concept called fault-tolerant edge metric basis. That is, an edge metric basis <em>S</em> of a graph <em>G</em> is fault-tolerant if every pair of edges of <em>G</em> are resolved by a minimum of two vertices in <em>S</em>, and the minimum possible cardinality of such sets is coined as the fault-tolerant edge metric dimension of <em>G</em>. In this work, we present bounds for the edge metric dimension of graphs and its fault tolerance version. In addition, we investigate these parameters for butterfly, Beneš and fractal cubic networks, and found the exact value for their (fault-tolerant) edge metric dimensions.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105141"},"PeriodicalIF":3.4,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144489472","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}

{"title":"How to reduce the number of steps for (multi-valued validated) Byzantine agreement?","authors":"Baohan Huang ,&nbsp;Haibin Zhang ,&nbsp;Chao Liu ,&nbsp;Shengli Liu ,&nbsp;Yong Yu ,&nbsp;Fangguo Zhang ,&nbsp;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>&gt;</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>&gt;</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>&gt;</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-10-01","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}

{"title":"Power, energy, and performance analysis of single- and multi-threaded applications in the ARM ThunderX2","authors":"Ibai Calero,&nbsp;Salvador Petit,&nbsp;María E. Gómez,&nbsp;Julio Sahuquillo","doi":"10.1016/j.jpdc.2025.105118","DOIUrl":"10.1016/j.jpdc.2025.105118","url":null,"abstract":"<div><div>Energy efficiency has been a major concern in data centers, and the problem is exacerbated as its size continues to rise. However, the lack of tools to measure and handle this energy at a fine granularity (e.g., processor core or last-level cache) has translated into slow research advances in this topic. Understanding where (i.e., which components) and when (the point in time) energy consumption translates into minor performance improvements is of paramount importance to design any energy-aware scheduler. This paper characterizes the relationship between energy consumption and performance in a 28-core ARM ThunderX2 processor for both single-threaded and multi-threaded applications.</div><div>This paper shows that single-threaded applications with high CPU activity maintain their performance in spite of the inter-application interference at shared resources, but this comes at the expense of higher power consumption. Conversely, applications that heavily utilize the L3 cache and memory consume less power but suffer significant performance degradation as interference levels rise.</div><div>In contrast, multi-threaded applications show two distinct behaviors. On the one hand, some of them experience significant performance gains when they execute in a higher number of cores with more threads, which outweighs the increase in power consumption, leading to high energy efficiency.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105118"},"PeriodicalIF":3.4,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144242749","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}

{"title":"SHAP-based intrusion detection in IoT networks using quantum neural networks on IonQ hardware","authors":"K Rajkumar,&nbsp;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-10-01","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}

{"title":"Front Matter 1 - Full Title Page (regular issues)/Special Issue Title page (special issues)","authors":"","doi":"10.1016/S0743-7315(25)00116-9","DOIUrl":"10.1016/S0743-7315(25)00116-9","url":null,"abstract":"","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105149"},"PeriodicalIF":3.4,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144604858","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}

{"title":"QPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements","authors":"Victor Jarlow ,&nbsp;Charalampos Stylianopoulos ,&nbsp;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-10-01","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}

{"title":"Leveraging Multi-Instance GPUs through moldable task scheduling","authors":"Jorge Villarrubia,&nbsp;Luis Costero,&nbsp;Francisco D. Igual,&nbsp;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-10-01","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}

{"title":"Optimal scheduling algorithms for software-defined radio pipelined and replicated task chains on multicore architectures","authors":"Diane Orhan ,&nbsp;Laércio Lima Pilla ,&nbsp;Denis Barthou ,&nbsp;Adrien Cassagne ,&nbsp;Olivier Aumage ,&nbsp;Romain Tajan ,&nbsp;Christophe Jégo ,&nbsp;Camille Leroux","doi":"10.1016/j.jpdc.2025.105106","DOIUrl":"10.1016/j.jpdc.2025.105106","url":null,"abstract":"<div><div>Software-Defined Radio (SDR) represents a move from dedicated hardware to software implementations of digital communication standards. This approach offers flexibility, shorter time to market, maintainability, and lower costs, but it requires an optimized distribution tasks in order to meet performance requirements. Thus, we study the problem of scheduling SDR linear task chains of stateless and stateful tasks for streaming processing. We model this problem as a pipelined workflow scheduling problem based on pipelined and replicated parallelism on homogeneous resources. We propose an optimal dynamic programming solution and an optimal greedy algorithm named OTAC for maximizing throughput while also minimizing resource utilization. Moreover, the optimality of the proposed scheduling algorithm is proved. We evaluate our solutions and compare their execution times and schedules to other algorithms using synthetic task chains and an implementation of the DVB-S2 communication standard on the AFF3CT SDR Domain Specific Language. Our results demonstrate how OTAC quickly finds optimal schedules, leading consistently to better results than other algorithms, or equivalent results with fewer resources.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"204 ","pages":"Article 105106"},"PeriodicalIF":3.4,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144195960","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}