Journal of Parallel and Distributed Computing最新文献

筛选
英文 中文
SpecSeq++: A high parallel boundary matrix reduction to support real large-scale point clouds specseq++:一个高并行边界矩阵简化,支持真正的大规模点云
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2025-01-14 DOI: 10.1016/j.jpdc.2025.105036
Quming Li , Zhibin Huang , Yiming Chen , Di Hu , Zhitao Dai , Min Yu , Zhou Liu
{"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}
引用次数: 0
Front Matter 1 - Full Title Page (regular issues)/Special Issue Title page (special issues) 封面1 -完整的扉页(每期)/特刊扉页(每期)
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2025-01-03 DOI: 10.1016/S0743-7315(24)00194-1
{"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}
引用次数: 0
A comparative hardware implementation of histogram of oriented gradients as a descriptor in embedded tracking of swarm robots 面向梯度直方图描述符在群机器人嵌入式跟踪中的比较硬件实现
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2024-12-17 DOI: 10.1016/j.jpdc.2024.105026
Diego Legarda, Karen Pérez, Daniel M. Muñoz
{"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}
引用次数: 0
Verifiable searchable encryption scheme with flexible access control in the cloud 可验证的可搜索加密方案,在云中具有灵活的访问控制
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2024-12-16 DOI: 10.1016/j.jpdc.2024.105025
Yang Li , Chungen Xu , Lei Xu , Lin Mei , Yanzhe Zhu
{"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}
引用次数: 0
Fault-tolerance and unique identification of vertices and edges in a graph: The fault-tolerant mixed metric dimension 图中顶点和边的容错和唯一识别:容错混合度量维
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2024-12-16 DOI: 10.1016/j.jpdc.2024.105024
Asad Khan , Sikander Ali , Sakander Hayat , Muhammad Azeem , Yubin Zhong , Manzoor Ahmad Zahid , Mohammed J.F. Alenazi
{"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}
引用次数: 0
OWL: Worker-assisted server bandwidth optimization for efficient communication federated learning OWL:工作人员辅助的服务器带宽优化,用于有效的通信联合学习
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2024-12-16 DOI: 10.1016/j.jpdc.2024.105027
Xiaoming Han , Boan Liu , Chuang Hu , Dazhao Cheng
{"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}
引用次数: 0
On fractal cubic network graphs 关于分形三次网络图
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2024-12-11 DOI: 10.1016/j.jpdc.2024.105023
Ayse Nur Altintas Tankul , Burhan Selcuk , Muhammed Kamil Turan
{"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}
引用次数: 0
ERT: Data placement based on estimated response time for P2P storage systems ERT:基于P2P存储系统的估计响应时间的数据放置
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2024-12-10 DOI: 10.1016/j.jpdc.2024.105022
Fitrio Pakana , Nasrin Sohrabi , Hai Dong , Zahir Tari , Nour Moustafa
{"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}
引用次数: 0
Front Matter 1 - Full Title Page (regular issues)/Special Issue Title page (special issues) 封面1 -完整的扉页(每期)/特刊扉页(每期)
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2024-11-28 DOI: 10.1016/S0743-7315(24)00182-5
{"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}
引用次数: 0
Content delivery network solutions for the CMS experiment: The evolution towards HL-LHC CMS 实验的内容交付网络解决方案:向 HL-LHC 演进
IF 3.4 3区 计算机科学
Journal of Parallel and Distributed Computing Pub Date : 2024-11-22 DOI: 10.1016/j.jpdc.2024.105014
Carlos Perez Dengra , Josep Flix , Anna Sikora , the CMS Collaboration
{"title":"Content delivery network solutions for the CMS experiment: The evolution towards HL-LHC","authors":"Carlos Perez Dengra ,&nbsp;Josep Flix ,&nbsp;Anna Sikora ,&nbsp;the CMS Collaboration","doi":"10.1016/j.jpdc.2024.105014","DOIUrl":"10.1016/j.jpdc.2024.105014","url":null,"abstract":"<div><div>The Large Hadron Collider at CERN in Geneva is poised for a transformative upgrade, preparing to enhance both its accelerator and particle detectors. This strategic initiative is driven by the tenfold increase in proton-proton collisions anticipated for the forthcoming high-luminosity phase scheduled to start by 2029. The vital role played by the underlying computational infrastructure, the World-Wide LHC Computing Grid, in processing the data generated during these collisions underlines the need for its expansion and adaptation to meet the demands of the new accelerator phase. The provision of these computational resources by the worldwide community remains essential, all within a constant budgetary framework. While technological advancements offer some relief for the expected increase, numerous research and development projects are underway. Their aim is to bring future resources to manageable levels and provide cost-effective solutions to effectively handle the expanding volume of generated data. In the quest for optimized data access and resource utilization, the LHC community is actively investigating Content Delivery Network (CDN) techniques. These techniques serve as a mechanism for the cost-effective deployment of lightweight storage systems that support both, traditional and opportunistic compute resources. Furthermore, they aim to enhance the performance of executing tasks by facilitating the efficient reading of input data via caching content near the end user. A comprehensive study is presented to assess the benefits of implementing data cache solutions for the Compact Muon Solenoid (CMS) experiment. This in-depth examination serves as a use-case study specifically conducted for the Spanish compute facilities, playing a crucial role in supporting CMS activities. Data access patterns and popularity studies suggest that user analysis tasks benefit the most from CDN techniques. Consequently, a data cache has been introduced in the region to acquire a deeper understanding of these effects. In this paper, the details of the implementation of a data cache system in the PIC Tier-1 compute facility are presented. It includes insights into the developed monitoring tools and discusses the positive impact on CPU usage for analysis tasks executed in the region. The study is augmented by simulations of data caches, with the objective of discerning the most optimal requirements in both size and network connectivity for a data cache serving the Spanish region. Additionally, the study delves into the cost benefits associated with deploying such a solution in a production environment. Furthermore, it investigates the potential impact of incorporating this solution into other regions of the CMS computing infrastructure.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"197 ","pages":"Article 105014"},"PeriodicalIF":3.4,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信