Journal of Parallel and Distributed Computing最新文献

{"title":"A parallel algorithm for minimum weight set cover with small neighborhood property","authors":"Yingli Ran ,&nbsp;Yaoyao Zhang ,&nbsp;Zhao Zhang","doi":"10.1016/j.jpdc.2025.105034","DOIUrl":"10.1016/j.jpdc.2025.105034","url":null,"abstract":"<div><div>This paper studies the minimum weight set cover (MinWSC) problem with a small neighborhood cover property (<em>τ</em>-SNC). A parallel algorithm is presented, obtaining approximation ratio <span><math><mi>τ</mi><mo>(</mo><mn>1</mn><mo>+</mo><mn>3</mn><mi>ε</mi><mo>)</mo></math></span> in <span><math><mi>O</mi><mo>(</mo><mi>L</mi><msub><mrow><mi>log</mi></mrow><mrow><mn>1</mn><mo>+</mo><mi>ε</mi></mrow></msub><mo>⁡</mo><mfrac><mrow><msup><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow><mrow><msup><mrow><mi>ε</mi></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac><mo>+</mo><mn>4</mn><msup><mrow><mi>τ</mi></mrow><mrow><mn>3</mn></mrow></msup><msup><mrow><mn>2</mn></mrow><mrow><mi>τ</mi></mrow></msup><msup><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msup><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> rounds, where <span><math><mn>0</mn><mo>&lt;</mo><mi>ε</mi><mo>&lt;</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> is a constant, <em>n</em> is the number of elements, and <em>L</em> is the depth of SNC-decomposition. Our results not only improve the approximation ratio obtained in <span><span>[2]</span></span>, but also answer two questions proposed in <span><span>[2]</span></span>.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"198 ","pages":"Article 105034"},"PeriodicalIF":3.4,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129827","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":"SpecSeq++: A high parallel boundary matrix reduction to support real large-scale point clouds","authors":"Quming Li ,&nbsp;Zhibin Huang ,&nbsp;Yiming Chen ,&nbsp;Di Hu ,&nbsp;Zhitao Dai ,&nbsp;Min Yu ,&nbsp;Zhou Liu","doi":"10.1016/j.jpdc.2025.105036","DOIUrl":"10.1016/j.jpdc.2025.105036","url":null,"abstract":"<div><div>The boundary matrix serves as a crucial representation for computing the persistence diagrams, which is a typical topological data analysis method, and its reduction is the most central and time-consuming step. However, most of the current methods do not have a high degree of parallelism. Therefore, a fully GPU-parallelized boundary matrix reduction algorithm, denoted by SpecSeq++, is proposed. It introduces some novel methods, such as the high-dimension guided clearing theorem, the new method for pivot determination within blocks, and a novel dynamic block partition strategy to mitigate load balancing issues and the long-tail effect in intra-block parallel computation. Based on the experiments with three types of boundary matrices of different sizes and different complexes, the results show that SpecSeq++ has better performance, and in the best-case scenario, SpecSeq++ performs more than 700x better than phat-twist optimized with the dualization while its average GPU memory overhead is only twice that of the serial method. It provides strong support for the practical application of topological data analysis on real point cloud data. Codes are available at <span><span>https://github.com/BuptCIAGroup/SpecSeqPlusPlus</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"198 ","pages":"Article 105036"},"PeriodicalIF":3.4,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129828","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(24)00194-1","DOIUrl":"10.1016/S0743-7315(24)00194-1","url":null,"abstract":"","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"197 ","pages":"Article 105030"},"PeriodicalIF":3.4,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143101234","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 comparative hardware implementation of histogram of oriented gradients as a descriptor in embedded tracking of swarm robots","authors":"Diego Legarda,&nbsp;Karen Pérez,&nbsp;Daniel M. Muñoz","doi":"10.1016/j.jpdc.2024.105026","DOIUrl":"10.1016/j.jpdc.2024.105026","url":null,"abstract":"<div><div>The Histogram of Oriented Gradients (HOG) algorithm is widely utilized in image processing for tasks such as detection, classification, and tracking. However, several challenges arise when implementing this algorithm on computing platforms with limited memory and low power consumption, such as mobile robots and drones. This work presents an in-depth analysis and implementation of three innovative hardware architectures for HOG, specifically designed for real-time processing using Field Programmable Gate Arrays (FPGAs) in the context of mobile robot localization. The primary focus of these architectures is to simplify the processing operations involved in gradient magnitude and orientation calculation, histogram generation, and normalization. These simplifications lead to a reduction in resource utilization and energy consumption. Experimental results conducted on a Zynq 7020 device demonstrated minimal relative error values throughout the entire process, along with a significant execution time improvement of over 1000 times when compared to the software-based solution.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"198 ","pages":"Article 105026"},"PeriodicalIF":3.4,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129228","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":"Verifiable searchable encryption scheme with flexible access control in the cloud","authors":"Yang Li ,&nbsp;Chungen Xu ,&nbsp;Lei Xu ,&nbsp;Lin Mei ,&nbsp;Yanzhe Zhu","doi":"10.1016/j.jpdc.2024.105025","DOIUrl":"10.1016/j.jpdc.2024.105025","url":null,"abstract":"<div><div>The exponential growth of digital data demands secure and efficient cloud data management. Encryption technologies, especially searchable encryption and attribute-based encryption, have become tools for protecting data confidentiality while allowing authorized users to access data for ciphertext retrieval. Confronting complex multi-user and multi-owner (M2M) scenarios, certain searchable attribute-based encryption schemes are designed to manage both owner-level and user-level permission simultaneously. However, their permission management depends on the cooperation of an honest server, which may not be practical in the M2M cloud storage environment. Hence, there is a need for a robust scheme that ensures secure and flexible access control, maintains performance and scalability, and is applicable to servers that may not always be honest, thereby accommodating a broader spectrum of real-world scenarios. This paper introduces a <strong>V</strong>erifiable <strong>S</strong>earchable <strong>E</strong>ncryption Scheme with <strong>F</strong>lexible <strong>A</strong>ccess <strong>C</strong>ontrol in the Cloud (VSEFAC), which adeptly manages both owner-level and user-level permission based on searchable attribute-based encryption, with the added advantage of owner-level permission management being independent of a careless cloud server. At the same time, our scheme manages owner-level permission through a lightweight method for updating owner-level permission, providing strong defense against unauthorized searches and attacks. Finally, our scheme further validates the practical efficiency and effectiveness of our scheme in real-world cloud storage applications through rigorous security analysis and performance evaluation.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"197 ","pages":"Article 105025"},"PeriodicalIF":3.4,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143101204","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":"Fault-tolerance and unique identification of vertices and edges in a graph: The fault-tolerant mixed metric dimension","authors":"Asad Khan ,&nbsp;Sikander Ali ,&nbsp;Sakander Hayat ,&nbsp;Muhammad Azeem ,&nbsp;Yubin Zhong ,&nbsp;Manzoor Ahmad Zahid ,&nbsp;Mohammed J.F. Alenazi","doi":"10.1016/j.jpdc.2024.105024","DOIUrl":"10.1016/j.jpdc.2024.105024","url":null,"abstract":"<div><div>The practical and theoretical significance of graph-theoretic resolvability/locating parameters make them important tools, particularly in the context of network analysis. Their significance is seen in diverse scientific fields and various applications including network security, facility location, efficient routing, social network analysis, and the optimization of site selection. In order to enhance the practical applicability of vertex-edge resolvability in graphs, this paper introduces fault-tolerance in it and studies the minimality of this vertex-edge fault-tolerant resolving sets in graphs. Let <em>R</em> be a set that serves as both a locating and an edge-locating (i.e., mixed locating set) in graph <em>G</em>, implying that it uniquely identifies both vertices and edges in <em>G</em>. Introduction of fault-tolerance in <em>R</em>, say <span><math><msup><mrow><mi>R</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span>, would imply that for any <span><math><mi>x</mi><mo>∈</mo><msup><mrow><mi>R</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span> (i.e., fault-detection) <span><math><msup><mrow><mi>R</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∖</mo><mo>{</mo><mi>x</mi><mo>}</mo></math></span> (i.e., fault-tolerance) retains its status of a fault-tolerant mixed locating set. The smallest cardinality of a fault-tolerant mixed locating set is named as the fault-tolerant mixed metric dimension <span><math><mi>d</mi><mi>i</mi><msub><mrow><mi>m</mi></mrow><mrow><mi>m</mi><mo>,</mo><mi>f</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math></span> of <em>G</em>. We consider the Cartesian product of <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> and <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> (<em>n</em>-dimensional path graph) which is also called the ladder network and deliver its applications in electrical, electronics, and wireless communication areas. We compute the exact value of <span><math><mi>d</mi><mi>i</mi><msub><mrow><mi>m</mi></mrow><mrow><mi>m</mi><mo>,</mo><mi>f</mi></mrow></msub></math></span> for the ladder network and deliver its potential applications. The exchange property corresponding to the fault-tolerant mixed metric dimension for the ladder networks is also investigated.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"197 ","pages":"Article 105024"},"PeriodicalIF":3.4,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143101202","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":"OWL: Worker-assisted server bandwidth optimization for efficient communication federated learning","authors":"Xiaoming Han ,&nbsp;Boan Liu ,&nbsp;Chuang Hu ,&nbsp;Dazhao Cheng","doi":"10.1016/j.jpdc.2024.105027","DOIUrl":"10.1016/j.jpdc.2024.105027","url":null,"abstract":"<div><div>Edge computing in federated learning based on centralized architecture often faces communication constraints in large clusters. Although there have been some efforts like computation-communication overlapping and fine-granularity flow scheduling towards how to reduce the communication cost, this is still a matter of ongoing research. Motivated by the underutilization of bandwidth among workers (edge devices) and the replication of deep neural network (DNN) model distributions in data-parallel federated learning, we propose OWL, a novel worker-assisted server bandwidth optimization method. OWL partitions numerous computation branches into groups based on the model's network topology, allowing for overlapping model distribution and computation among workers, thereby leveraging idle communication resources on the workers to compensate for server bandwidth. To address the issue of model distribution congestion on the server, we formulate group partition as an optimization problem, which proves to be NP-hard. We tackle this problem through a divide-and-conquer approach employing an approximation grouping algorithm and a deploying algorithm. Finally, we evaluate the performance of OWL through simulations and a comprehensive real-world case study involving model training on OWL and deployment on edge systems. Experimental results demonstrate that OWL reduces overall training time by up to 20%-69% and improves scalability by over 9.5% compared to state-of-the-art overlapping approaches.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"198 ","pages":"Article 105027"},"PeriodicalIF":3.4,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129229","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":"On fractal cubic network graphs","authors":"Ayse Nur Altintas Tankul ,&nbsp;Burhan Selcuk ,&nbsp;Muhammed Kamil Turan","doi":"10.1016/j.jpdc.2024.105023","DOIUrl":"10.1016/j.jpdc.2024.105023","url":null,"abstract":"<div><div>The fractal cubic network graphs (<span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span>), previously studied by Karci and Selcuk (2015), are reviewed in this paper. First, general information about <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> is provided, and new topological properties of <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> are presented. Simulations of the topological properties of <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span>, hypercube, and 2<em>D</em> square meshes have been performed, and the results are introduced. Secondly, a strategy for the routing problem for <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> is presented. A new strategy for the routing path of <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> is presented and explained with an example, and a recursive algorithm using this strategy is presented. Thirdly, a strategy for the shortest path problem for <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> with a similar routing strategy is also presented, and a recursive algorithm for this strategy is given. An algorithm for mapping network nodes on a 2<em>D</em> plane and an algorithm for computing the minimum distance connection point between fractals used to construct the shortest path are also provided. These algorithms are illustrated with an example. The running times of the algorithms are also calculated.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"197 ","pages":"Article 105023"},"PeriodicalIF":3.4,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143101250","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":"ERT: Data placement based on estimated response time for P2P storage systems","authors":"Fitrio Pakana ,&nbsp;Nasrin Sohrabi ,&nbsp;Hai Dong ,&nbsp;Zahir Tari ,&nbsp;Nour Moustafa","doi":"10.1016/j.jpdc.2024.105022","DOIUrl":"10.1016/j.jpdc.2024.105022","url":null,"abstract":"<div><div>Storage system using P2P architecture is an alternative to traditional client-server system that offers better scalability and fault tolerance while eliminating the single point of failure. P2P storage systems with heterogeneous nodes face performance and scalability challenges, one of which is contributed by their data placement method. Existing data placement methods, such as the implementation of the Kademlia protocol, store data at the closest node, where the distance is measured by bitwise XOR operation between identifiers of data and the node. This approach is highly scalable because it does not require global knowledge for placing and retrieving the data. It does not however consider the heterogeneous performance of the nodes, which can result in imbalanced resource usage. Other works implement criteria-based node selection that addresses the heterogeneity of nodes. However, such approaches often cause subsequent data retrieval to require global knowledge of the data location. This paper introduces a novel data placement method called <em>Estimated Response Time-based (ERT)</em>, which stores data to selected nodes based on dynamic estimation of nodes response time. ERT models the data placement process using queueing theory. Besides, it incorporates the predicted response time, alongside other criteria, for node selection decision-making. The experimental results in a real P2P storage system indicate that ERT reduces the standard deviation of response time of nodes by 17.57% compared to the native Kademlia, 39.01% compared Kademlia with Virtual Node, and by 49.24% compared to Throughput-based data placement. Further, relying on a modified DHT data structure of Kademlia allows ERT to eliminate the need for global knowledge during data retrieval.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"197 ","pages":"Article 105022"},"PeriodicalIF":3.4,"publicationDate":"2024-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143101203","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(24)00182-5","DOIUrl":"10.1016/S0743-7315(24)00182-5","url":null,"abstract":"","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"196 ","pages":"Article 105018"},"PeriodicalIF":3.4,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142745923","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}