Journal of Parallel and Distributed Computing最新文献

{"title":"Front Matter 1 - Full Title Page (regular issues)/Special Issue Title page (special issues)","authors":"","doi":"10.1016/S0743-7315(25)00143-1","DOIUrl":"10.1016/S0743-7315(25)00143-1","url":null,"abstract":"","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"206 ","pages":"Article 105176"},"PeriodicalIF":4.0,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145120315","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":"SEDViN: Secure embedding for dynamic virtual network requests using a multi-attribute matching game","authors":"T.G. Keerthan Kumar ,&nbsp;Rahul Kumar ,&nbsp;Anirudh Munnur Achal ,&nbsp;Anurag Satpathy ,&nbsp;Sourav Kanti Addya","doi":"10.1016/j.jpdc.2025.105171","DOIUrl":"10.1016/j.jpdc.2025.105171","url":null,"abstract":"<div><div>Network virtualization (NV) has gained significant attention as it allows service providers (SP) to share substrate network (SN) resources. It is achieved by partitioning them into isolated virtual network requests (VNRs) comprising interrelated virtual machines (VMs) and virtual links (VLs). Although NV provides various advantages, such as service separation, enhanced quality-of-service, reliability, and improved SN utilization, it also presents multiple scientific challenges. In this context, one pivotal challenge encountered by the researchers is secure virtual network embedding (SVNE). The SVNE encompasses assigning SN resources to components of VNR, i.e., VMs and VLs, adhering to the security demands, which is a computationally intractable problem, as it is proven to be <span><math><mi>NP</mi></math></span>-Hard. In this context, maximizing the acceptance and revenue-to-cost ratios remains of utmost priority for SPs as it not only increases the revenue but also effectively utilizes the large pool of SN resources. Though VNE is a well-researched problem, the existing literature has the following flaws: (<em>i</em>.) security features of VMs and VLs are ignored, (<em>ii</em>.) limited consideration of topological attributes, and (<em>iii</em>.) restricted to static VNRs. However, SPs need to develop an embedding framework that overcomes the abovementioned pitfalls. Therefore, this work proposes a framework <strong>S</strong>ecure <strong>E</strong>mbedding for <strong>D</strong>ynamic <strong>Vi</strong>rtual <strong>N</strong>etwork requests using a multi-attribute matching game (SEDViN). In SedViN, the deferred acceptance algorithm (DAA) based matching game is used for effective embedding. SEDViN operates primarily in two steps to obtain a secure embedding of dynamic VNRs. Firstly, it generates a unified ranking for VMs and servers using a combination of entropy and a technique for order of preference by similarity to the ideal solution (TOPSIS), considering network, security, and system attributes. Taking these as inputs, in the second step, VNR embedding is conducted using the deferred acceptance approach based on a one-to-many matching strategy for VM embedding and VL embedding using the shortest path algorithm. The performance of SEDViN is evaluated through simulations and compared against different baseline approaches. The simulation outcomes exhibit that SEDViN surpasses the baselines with a gain of 56% in the acceptance and 44% in the revenue-to-cost ratios.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"206 ","pages":"Article 105171"},"PeriodicalIF":4.0,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144996790","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":"A scalable tensor-based MDTW approach for multi-modal time series patterns clustering","authors":"Bahati Alam Sanga ,&nbsp;Laurence T. Yang ,&nbsp;Shunli Zhang ,&nbsp;Zecan Yang ,&nbsp;Nicholaus Gati","doi":"10.1016/j.jpdc.2025.105173","DOIUrl":"10.1016/j.jpdc.2025.105173","url":null,"abstract":"<div><div>Multi-modal Time Series (MTS) is a vital ingredient to Predictive Multi-modal Artificial Intelligence (PMAI). MTS systems capture varying temporal modalities and their inherent dependencies for their accurate analytics. However, efficiently exploring these cross-modalities relationships is a challenging research due to their complexity facets and information redundancies. MTS patterns' pairwise similarity measures precede PMAI. Multi-modal Dynamic Time Warping (MDTW) is frequently explored to quantify similar MTS. Yet, it's reliant on the orthogonal conditioned local similarity measures that ignore the contributions of MTS' underlying structural relationships in the warping process and, hence, susceptible to unrealistic matching. This paper addresses the setbacks by recommending a scalable MTS recognition model, named Tensor-Slices Distance (TSD)-based MDTW (TSD-MDTW), that's subsequently advanced to two more distinct models termed Weighted modality and TSD (WmTSD-MDTW) and TSD-Mahalanobis (TSDMaha-MDTW). To quantify an alignment's cost, TSD-MDTW incorporates intrinsic spatial dependencies between modalities' coordinates, while WmTSD-MDTW relaxes information redundancies through weighing modalities based on information richness, whereas TSDMaha-MDTW embodies modalities dependencies and their coordinates' innate spatial dependencies. Besides, it proposes a scalable Tensor-based DTW (TDTW) model that re-formulates MDTW into multiple dimensions that are found paralleling warping processes. Theoretical and empirical experimental results on MTS multi-modal datasets encompassing load patterns and meteorological modalities reveal TDTW's efficiency and proposals' superior performances in terms of cluster compactness and separation over MDTW employing the state-of-the-art local similarity measures.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"207 ","pages":"Article 105173"},"PeriodicalIF":4.0,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145098698","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":"Threat to trust: A systematic review on Internet of medical things security","authors":"Elham Shammar ,&nbsp;Xiaohui Cui ,&nbsp;Ammar Zahary ,&nbsp;Saeed Hamood Alsamhi ,&nbsp;Mohammed A.A. Al-qaness","doi":"10.1016/j.jpdc.2025.105172","DOIUrl":"10.1016/j.jpdc.2025.105172","url":null,"abstract":"<div><div>The Internet of Medical Things (IoMT) has transformed healthcare by enabling seamless communication among medical devices, supporting real-time monitoring, diagnostics, vital patient data tracking, improved patient care, disease prediction, early warning, and enhanced operational efficiency. Due to the sensitive nature of health-related data, the adoption of IoMT has raised significant privacy and security concerns, prompting comprehensive evaluation of IoMT security and making it a prime target for cyberattacks such as ransomware, denial-of-service (DoS) attacks, and malware. Securing IoMT requires efficient data processing across distributed systems to ensure both confidentiality and availability. Parallel and distributed computing can address scalability and performance challenges in IoMT security, particularly in enabling real-time monitoring and threat detection across multiple interconnected devices. This survey conducts a systematic literature review (SLR) of IoMT security to analyze key issues, categorize security threats, attack vectors, and vulnerabilities, and examine how emerging technologies such as blockchain, machine learning (ML), and physically unclonable functions (PUF) are strengthening IoMT security. This SLR reviews IoMT security research published between 2020 and 2024 to identify challenges and provide insights for future researchers and developers of new IoMT security models. This SLR offers practitioners and researchers guidance for developing reliable and resilient IoMT security systems in the decentralized healthcare industry.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"206 ","pages":"Article 105172"},"PeriodicalIF":4.0,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145026873","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":"Optimization of single node load balancing for lattice Boltzmann method on heterogeneous high performance computers","authors":"Adrian Kummerländer ,&nbsp;Fedor Bukreev ,&nbsp;Dennis Teutscher ,&nbsp;Marcio Dorn ,&nbsp;Mathias J. Krause","doi":"10.1016/j.jpdc.2025.105169","DOIUrl":"10.1016/j.jpdc.2025.105169","url":null,"abstract":"<div><div>Lattice Boltzmann Methods (LBM) are particularly suited for highly parallel computational fluid dynamics simulations on heterogeneous HPC systems combining CPUs and GPUs. However, the computationally dominant collide-and-stream loops commonly utilize only GPUs, leaving CPU resources underutilized. To overcome this limitation, this article proposes a novel load balancing strategy based on a genetic algorithm for bottom-up, cost-aware optimization of spatial domain decompositions. This approach generates subdomains and rank assignments inherently suited for cooperative execution on both CPUs and GPUs. Implemented in the open source framework OpenLB, the strategy is applied to turbulent flow reference cases, including a multi-physics reactive mixer. A detailed evaluation on heterogeneous HPC nodes demonstrates significant performance gains, achieving speedups of up to 87% compared to traditional GPU-only execution. This work therefore establishes cost-aware, bottom-up decomposition as a suitable strategy for exploiting the native heterogeneity of modern compute nodes.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"206 ","pages":"Article 105169"},"PeriodicalIF":4.0,"publicationDate":"2025-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144895824","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":"HeaPS: Heterogeneity-aware participant selection for efficient federated learning","authors":"Duo Yang ,&nbsp;Bing Hu ,&nbsp;Yunqi Gao ,&nbsp;A-Long Jin ,&nbsp;An Liu ,&nbsp;Kwan L. Yeung ,&nbsp;Yang You","doi":"10.1016/j.jpdc.2025.105168","DOIUrl":"10.1016/j.jpdc.2025.105168","url":null,"abstract":"<div><div>Federated learning enables collaborative model training among numerous clients. However, existing participant/client selection methods fail to fully leverage the advantages of clients with excellent computational or communication capabilities. In this paper, we propose HeaPS, a novel Heterogeneity-aware Participant Selection framework for efficient federated learning. We introduce a finer-grained global selection algorithm to select communication-strong leaders and computation-strong members from candidate clients. The leaders are responsible for communicating with the server to reduce per-round duration, as well as contributing gradients; while the members communicate with the leaders to contribute more gradients obtained from high-utility data to the global model and improve the final model accuracy. Meanwhile, we develop a gradient migration path generation algorithm to match the optimal leader for each member. We also design the client scheduler to facilitate parallel local training of leaders and members based on gradient migration. Experimental results show that, in comparison with state-of-the-art methods, HeaPS achieves a speedup of up to 3.20× in time-to-accuracy performance and improves the final accuracy by up to 3.57%. The code for HeaPS is available at <span><span>https://github.com/Dora233/HeaPS</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"206 ","pages":"Article 105168"},"PeriodicalIF":4.0,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144887402","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":"A scheduler to foster data locality for GPU and out-of-core task-based linear algebra applications","authors":"Maxime Gonthier ,&nbsp;Loris Marchal ,&nbsp;Samuel Thibault","doi":"10.1016/j.jpdc.2025.105170","DOIUrl":"10.1016/j.jpdc.2025.105170","url":null,"abstract":"<div><div>Hardware accelerators like GPUs now provide a large part of the computational power used for scientific simulations. Despite their efficacy, GPUs possess limited memory and are connected to the main memory of the machine via a bandwidth limited bus. Scientific simulations often operate on very large data, that surpasses the GPU's memory capacity. Therefore, one has to turn to <strong>out-of-core</strong> computing: data is kept in a remote, slower memory (CPU memory), and moved back and forth from/to the device memory (GPU memory), a process also present for multicore CPUs with limited memory. In both cases, data movement quickly becomes a performance bottleneck. Task-based runtime schedulers have emerged as a convenient and efficient way to manage large applications on such heterogeneous platforms. <strong>We propose a scheduler for task-based runtimes</strong> that improves <strong>data locality</strong> for out-of-core linear algebra computations, to reduce data movement. We design a data-aware strategy for both task scheduling and data eviction from limited memories. We compare this scheduler to existing schedulers in runtime systems. Using <span>StarPU</span>, we show that our new scheduling strategy achieves comparable performance when memory is not a constraint, and significantly better performance when application input data exceeds memory, on both GPUs and CPU cores.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"206 ","pages":"Article 105170"},"PeriodicalIF":4.0,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144866099","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)00131-5","DOIUrl":"10.1016/S0743-7315(25)00131-5","url":null,"abstract":"","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"205 ","pages":"Article 105164"},"PeriodicalIF":4.0,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144842214","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":"SoRCS: A scalable blockchain model with separation of role, chain and storage","authors":"Bin Yu ,&nbsp;Lei Chen ,&nbsp;He Zhao ,&nbsp;Zhiyu Ma ,&nbsp;Haotian Cheng ,&nbsp;Xiaoting Zhang ,&nbsp;Liang Sun ,&nbsp;Tong Zhou ,&nbsp;Nianzu Sheng","doi":"10.1016/j.jpdc.2025.105160","DOIUrl":"10.1016/j.jpdc.2025.105160","url":null,"abstract":"<div><div>The industrial use of blockchain technology is becoming more widespread, the scalability of blockchain is still one of the primary challenges in large-scale practical applications. Separation schemes are being introduced by many blockchain projects to solve their scalability problems. In this paper, we propose a comprehensive separation scheme SoRCS, which separates the node role, the chain, and the data storage. It makes full use of the resources of each node, reduces the load on the nodes, and improves the degree of decentralization. Ordering of verified transactions, execution of ordered transactions, confirmation of ordering and execution blocks run concurrently within different sub-networks to improve blockchain performance. Based on the results of the block consensus, we provide a three-phase response: documented, executed, and confirmed.</div><div>Based on the SoRCS architecture, we also implement a prototype system that consists of 1200 nodes to evaluate our separation schemes. Its peak throughput is 14.7 Ktps and its latency is around 0.5 s. We use the three-phase response time to avoid the issue of higher latency, and the first response time is around 0.15 s.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"206 ","pages":"Article 105160"},"PeriodicalIF":4.0,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144772622","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":"FSCD: File system controlled coupled defragmenter for mobile storage systems","authors":"Pingyang Huang,&nbsp;Chenxi Liu,&nbsp;Jilong Yang,&nbsp;Ting Chen,&nbsp;Zhiyuan Cheng","doi":"10.1016/j.jpdc.2025.105159","DOIUrl":"10.1016/j.jpdc.2025.105159","url":null,"abstract":"<div><div>NAND-Flash-based mobile devices have gained increasing popularity. However, fragmentation in flash storage significantly impedes the I/O performance of the system, which leads to a poor user experience. Currently, the logical fragmentation is decoupled from the physical fragmentation and garbage collection is typically controlled by the <em>Flash Translation Layer</em> (FTL), degrading the garbage collection efficiency. In this paper, a novel fragmentation handling strategy, namely the <em>File System controlled Coupled Defragmenter</em> (FSCD), is proposed in which the file system is used to control the garbage collection, and couple the logical and physical fragmentations, synchronizing between the logical and physical defragmentation. As a result, FSCD can significantly reduce fragmentation and improve system performance in the fragmented state. Experimental results showed that the performance of Sequential Read/Sequential Write and Random Read/Random Write had been improved by 393.7%, 356.2% and 126.0%, 296.0% over the conventional FTL, respectively. FSCD alleviates fragmentation, improves I/O performance, and enables a better user experience, which provides a solution for the next generation of the NAND-flash-based mobile storage system.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"206 ","pages":"Article 105159"},"PeriodicalIF":4.0,"publicationDate":"2025-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144772621","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}