Concurrency and Computation-Practice & Experience最新文献

{"title":"An Efficient Lattice-Based Heterogeneous Signcryption Scheme for VANETs","authors":"Jintao Jiao,&nbsp;Lei Guo,&nbsp;Wensen Yu,&nbsp;Sheng Yang,&nbsp;Shaozi Li","doi":"10.1002/cpe.8384","DOIUrl":"https://doi.org/10.1002/cpe.8384","url":null,"abstract":"<div>\u0000 \u0000 <p>Nowadays, vehicular ad-hoc networks (VANETs) offer increased convenience to drivers and enable intelligent traffic management. However, the public wireless transmission channel in VANETs brings challenges related to security vulnerabilities and privacy leakage, in addition, vehicles produced by different manufacturers may use different cryptosystems such as certificateless cryptosystems (CLCs) and identity-based cryptosystems (IBC). To address privacy leakage during cross-cryptosystem communication in VANETs, we propose a lattice-based heterogeneous signcryption scheme named LHS-C2I. The scheme facilitates secure multi-cryptosystem bidirectional communication as CLC-based vehicles to IBC-based vehicles and IBC-based vehicles to CLC-based vehicles. The confidentiality and authenticity of LHS-C2I help to prevent the users from privacy leakage during cross-cryptosystem communication and to authenticate the message integrity and the sender's identity legitimacy. The proposed scheme is proven to achieve Indistinguishability under Chosen Ciphertext Attack (IND-CCA2) and Existential Unforgeability against Adaptive Chosen Messages Attack (EUF-CMA) within the random oracle model. Performance analysis demonstrates that LHS-C2I outperforms existing schemes in terms of computational overhead, communication overhead, and overall security features. It is particularly well-suited for scenarios requiring secure communication across different cryptosystems in VANETs.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143114774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Reliable and Secure Permissioned Blockchain-Assisted Data Transfer Mechanism in Healthcare-Based Cyber-Physical Systems","authors":"P. Vinayasree,&nbsp;A. Mallikarjuna Reddy","doi":"10.1002/cpe.8378","DOIUrl":"https://doi.org/10.1002/cpe.8378","url":null,"abstract":"<div>\u0000 \u0000 <p>Healthcare systems are highly sensitive to cyberattacks as these systems possess most of the sensitive information compared to other systems relying on internet facilities. Due to the stronger security merits and efficiency of blockchain, it is integrated with the healthcare sector to ensure reliable data transfer. However, to improve the reliability and efficiency of the integrated system, a permissioned blockchain-based security framework combining several techniques is proposed. To enable storing and validating blocks containing medical data on the blockchain, the miner is administered using the delegated proof of stake (DPoS) consensus protocol. This protocol is efficient in choosing the miner from the list of participants. Then, the blocks are created using recursive indexing with an Even–Rodeh (RI-ER) coding hashing scheme. This algorithm is an indexing scheme that is much more efficient than the normal hashing algorithms. The validation process is carried out by the miner using the hash values provided to the users. By using the kidney disease dataset from Kaggle, the performance of the proposed method is evaluated. The performance analysis proved the effectiveness of the proposed approach compared to other schemes.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143114714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Comparative Aerodynamic Analysis and Parallel Performance of 2D CFD Simulations of a VAWT Using Sliding Mesh Interface Method","authors":"Hüseyin Can Önel,&nbsp;Ali Ata Adam,&nbsp;Nilay Sezer Uzol","doi":"10.1002/cpe.8353","DOIUrl":"https://doi.org/10.1002/cpe.8353","url":null,"abstract":"<div>\u0000 \u0000 <p>With rapid advancements in computer hardware and numerical modeling methods, Computational Fluid Dynamics (CFD) has gained prominence in simulating complex flows. As parallel computation becomes an industry standard, the computational efficiency of simulations has become critical. The flow around a Vertical Axis Wind Turbine (VAWT), characterized by complex dynamics and challenging rotating geometry, serves as an intriguing case for CFD studies. This study employs the open-source CFD solvers SU2 and OpenFOAM to simulate the incompressible, unsteady, and turbulent flow around an H-type Darrieus VAWT in two dimensions. Spatial and temporal discretization parameters are examined to balance computational cost and accuracy, revealing notable effects on power predictions. Simulations conducted under identical conditions allow for a comparison of the predictions and parallel performances of SU2 and OpenFOAM across three distinct tip speed ratios (TSRs). The findings show that discretization parameters behave differently at various TSRs. While power predictions from SU2 and OpenFOAM generally align with experimental data and with each other, discrepancies arise at lower TSRs, with thrust predictions showing better consistency. Although OpenFOAM provides a faster solution across all parallel configurations, SU2 demonstrates superior parallel scalability, achieving higher speedup and efficiency.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143114713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Correction to “A DSEL for High Throughput and Low Latency Software-Defined Radio on Multicore CPUs”","authors":"","doi":"10.1002/cpe.8354","DOIUrl":"https://doi.org/10.1002/cpe.8354","url":null,"abstract":"<p>A. Cassagne, R. Tajan, O. Aumage, C. Leroux, D. Barthou, and C. Jégo, “A DSEL for high throughput and low latency software-defined radio on multicore CPUs,” <i>Computation: Practice and Experience</i> 35, no. 23 (2023): e7820, https://doi.org/10.1002/cpe.7820.</p><p>The original title of the article is: “A DSEL for high throughput and low latency software-defined radio on multicore CPUs.”</p><p>“<b>StreamPU:</b>” has been added at the beginning of the original title like this: “StreamPU: A DSEL for high throughput and low latency software-defined radio on multicore CPUs.”</p><p>We apologize for this error.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.8354","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143112963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An Echo Pressure Model Based on Mutil-Gaussian Beam Theory for Measuring the Liquid Level in Special Field","authors":"Bin Zhang,&nbsp;Yuejuan Wei,&nbsp;Shuqui Zang,&nbsp;Qing Li,&nbsp;Yan Qiang","doi":"10.1002/cpe.8335","DOIUrl":"https://doi.org/10.1002/cpe.8335","url":null,"abstract":"<div>\u0000 \u0000 <p>In aviation, petroleum and chemical industries and other special areas of production, since the liquid in containers mostly are flammable, explosive, volatile, and corrosive mixtures, the accurate measurement of the liquid level is essential to the real-time control and production process. In this study, an approximation algorithm based on echo pressure model for measuring the liquid level in special field is proposed in this paper. According to the model, a complete lateral incident ultrasonic measurement system is constructed for the inductive liquid level detection technology in special applications, an algorithm model of the echo pressure is established, which provides the determination of the liquid level relying on the characteristic curve of the echo pressure. The model in this study converts complex interaction problems of sound fields into the echo pressure calculation, which quickly determines performance parameters of sound fields, and a virtual reflection method is used to calculate the sound pressure of the receiving transducer in different states, which reduces computational complexity, finally, through the simulation and experiment, the algorithm is validated. The results are consistent with expectations, and the algorithm can be further applied in practice.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143120397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"FPM-SSD: Fast Parallel Multi-Scale Smooth Signed Distance Surface Reconstruction","authors":"Mingxiu Tuo,&nbsp;Chenglei Jia,&nbsp;Siyu Jin,&nbsp;Shunli Zhang","doi":"10.1002/cpe.8360","DOIUrl":"https://doi.org/10.1002/cpe.8360","url":null,"abstract":"<div>\u0000 \u0000 <p>Smooth signed distance surface reconstruction remains a popular technique for generating watertight surfaces from discrete point clouds. However, it frequently encounters issues with geometric detail loss when reconstructing complicated models. In this paper, we introduce a novel reconstruction technique for multi-scale smooth signed distance surfaces based on Gaussian curvature. Initially, the point cloud data is fitted using the moving least squares to calculate the Gaussian curvature. After that, a curvature-adaptive octree is constructed based on the Gaussian curvature, which can dynamically adjust the local resolution. Geometric information can be captured more effectively, improving the accuracy of surface reconstruction. Finally, implicit functions are adopted to perform global fitting, and the zero-level set is obtained through the octree isosurface extraction algorithm. In solving the iterative linear system, multi-thread techniques are implemented for parallel computation to enhance the execution performance of the algorithm. Experimental results demonstrate that the curvature-adaptive octree based on Gaussian curvature, can effectively capture complex geometric details, and the algorithm accomplishes high-precision surface reconstruction at different scales. Furthermore, multi-thread technology enhances local and global computing performance, ensuring the algorithm's effectiveness in processing large-scale data.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143120400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Design of Neko—A Scalable High-Fidelity Simulation Framework With Extensive Accelerator Support","authors":"Niclas Jansson,&nbsp;Martin Karp,&nbsp;Jacob Wahlgren,&nbsp;Stefano Markidis,&nbsp;Philipp Schlatter","doi":"10.1002/cpe.8340","DOIUrl":"https://doi.org/10.1002/cpe.8340","url":null,"abstract":"<p>Recent trends and advancements in including more diverse and heterogeneous hardware in High-Performance Computing (HPC) are challenging scientific software developers in their pursuit of efficient numerical methods with sustained performance across a diverse set of platforms. As a result, researchers are today forced to re-factor their codes to leverage these powerful new heterogeneous systems. We present our design considerations of Neko—a portable framework for high-fidelity spectral element flow simulations. Unlike prior works, Neko adopts a modern object-oriented Fortran 2008 approach, allowing multi-tier abstractions of the solver stack and facilitating various hardware backends ranging from general-purpose processors, accelerators down to exotic vector processors and Field-Programmable Gate Arrays (FPGAs). Focusing on the performance and portability of Neko, we describe the framework's device abstraction layer managing device memory, data transfer and kernel launches from Fortran, allowing for a solver written in a hardware-neutral yet performant way. Accelerator-specific optimizations are also discussed, with auto-tuning of key kernels and various communication strategies using device-aware MPI. Finally, we present performance measurements on a wide range of computing platforms, including the EuroHPC pre-exascale system LUMI, where Neko achieves excellent parallel efficiency for a large direct numerical simulation (DNS) of turbulent fluid flow using up to 80% of the entire LUMI supercomputer.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.8340","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143120399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Research on Industrial Process Fault Diagnosis Based on Deep Spatiotemporal Fusion Graph Convolutional Network","authors":"Qiang Qian,&nbsp;Ping Ma,&nbsp;Nini Wang,&nbsp;Hongli Zhang,&nbsp;Cong Wang,&nbsp;Xinkai Li","doi":"10.1002/cpe.8336","DOIUrl":"https://doi.org/10.1002/cpe.8336","url":null,"abstract":"<div>\u0000 \u0000 <p>Industrial processes are specialized and intricate systems. Current intelligent fault diagnosis methods do not take into account the interactions between individual units and variables, instead using only the temporal or Euclidean geometric space characteristics of industrial process data. How to utilize the complex relationship between variables for fault diagnosis remains an issue to be solved. This study proposed a fault diagnosis framework based on the deep spatiotemporal fusion graph convolutional network (DSTFGCN) for graph representation learning of correlations between variables. First, the maximum information coefficient was introduced to represent the complex correlation between variables in the graph signal construction process. Second, to effectively extract spatiotemporal features from the data, the graph convolutional network (GCN) and the convolutional neural network (CNN) were introduced into the DSTFGCN for mining complex spatial features in the data, and the long short-term memory (LSTM) network was employed to capture the evolution of multivariate time series. Consequently, the fault detection and false-positive rates of the proposed model were, respectively, 94.45% and 0.22% in the Tennessee Eastman Process (TEP), whereas the rates were, respectively, 99.61% and 0.07% on the Three-Phase Flow Facility (TPFF) datasets. These experimental results demonstrate the excellent performance and robustness of the proposed model, compared to those of both machine learning and deep learning models.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143119104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Measuring Thread Timing to Assess the Feasibility of Early-Bird Message Delivery Across Systems and Scales","authors":"W. Pepper Marts,&nbsp;Matthew G. F. Dosanjh,&nbsp;Whit Schonbein,&nbsp;Scott Levy,&nbsp;Patrick G. Bridges","doi":"10.1002/cpe.8342","DOIUrl":"https://doi.org/10.1002/cpe.8342","url":null,"abstract":"<div>\u0000 \u0000 <p>Early-bird communication is a communication/computation overlap technique that leverages fine-grained communication to improve application run-time. Communication is divided such that each individual thread can initiate transmission of its portion of the data upon completion rather than waiting for a dedicated communication phase. The benefit of early-bird communication depends on the completion timing of the individual threads: On the one hand, if all threads are complete at nearly the same time, the overheads of sending multiple messages will accumulate, leading to performance that is worse than if a single message had been sent. On the other hand, if thread completions are spread out in time, those that complete earlier can send data while others continue working, leading to performance that is better than if a single message had been sent. The challenge is that the completion times are currently unknown and can vary based on application, problem size, system software, and underlying hardware. In this paper, we address this lacuna by measuring and evaluating the potential overlap afforded by early-bird communication for a selection of proxy applications. These measurements help us understand whether a given application could benefit from early-bird communication. We present our technique for gathering this data and evaluate data collected from three proxy applications: MiniFE, MiniMD, and MiniQMC. Each application is run on three systems with distinct CPU architectures and strong scales across three run sizes. To characterize the behavior of these workloads, we study the trends of thread timings at both a macro level, across all threads across all runs of an application, and a micro level, that is, within a single process of a single run. We observe that our tested applications exhibit significantly different thread arrival distributions. The machine used had a significant impact, with the window of potential overlap varying by as much as an order of magnitude.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142868169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Multi-Workflow Scheduling Approach With Explicit Evolutionary Multi-Objective Multi-Task Optimization Algorithm in Cloud Environment","authors":"Qiqi Zhang,&nbsp;Bohui Li,&nbsp;Shaojin Geng,&nbsp;Xingjuan Cai","doi":"10.1002/cpe.8337","DOIUrl":"https://doi.org/10.1002/cpe.8337","url":null,"abstract":"<div>\u0000 \u0000 <p>Workflow tasks in the cloud environment are the abstraction and decomposition of large-scale and complex tasks in real-world scenarios, so cloud workflow scheduling problems have important research significance. However, most of the existing cloud workflow scheduling schemes are aimed at a single workflow, and do not make reasonable use of the commonality or complementary knowledge between similar tasks. Moreover, most cloud workflow scheduling models mainly focus on a few objectives such as time or cost, which is not comprehensive enough. Therefore, this paper first proposes a multi-objective cloud workflow scheduling model, which solves the maximum completion time, execution cost and energy consumption as three objectives during task execution. Secondly, to efficiently handle multiple similar cloud workflow scheduling tasks at the same time, this paper treats various cloud workflow scheduling issues as distinct tasks, establishes a multi-task cloud workflow scheduling framework that aims for the same goal while accommodating workflows of differing scales, and a multi-objective evolutionary multi-task optimization algorithm based on elite selection (MOEMT-ES) is designed to solve the above scheduling model. Finally, through algorithm comparison experiments on the CEC2017 evolutionary multi-task optimization competition benchmark problem and multi-workflow test problem, MOEMT-ES shows superior competitiveness.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142868166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}