Search

The sparse triangular solver (SpTRSV) is mostly used for scientific and engineering applications. The structured-grid triangular solver of regular dependencies (STRSV) is a special kind of SpTRSV. Some general SpTRSVs that disregards the regularity of the matrix are unsuitable for solving this problem. This paper proposes an efficient parallel algorithm for STRSV on the SW26010 (a kind of China independently designed many-core processors), namely swStructTRSV. The algorithm makes full use of the fine-grained and low latency communication characteristics of the SW26010 to reduce the waiting time for synchronization, maximizes the regularity of access to improve memory access bandwidth, and achieves overlap between memory access and computation simultaneously. Moreover, the idea of the algorithm can be extended to incomplete LU factorization (ILU factorization) because of consistent dependencies. The experimental results on a core group(8 * 8 network composed of 64 cores) of SW26010 show that swStructTRSV can achieve an average speedup of over 30 in the sequential version. swStructTRSV on SW26010 achieves solving speedups of 2.2 and 6.3 over the fast STRSV (fSpTRSV) previously implemented on SW26010 and MKL on Intel Xeon Gold 6132, respectively. swStructTRSV significantly outperforms cuSparse on NVIDIA TITAN RTX in terms of overall execution time. [ABSTRACT FROM AUTHOR]

This paper presents a massively parallel approach of the multilevel fast multipole algorithm (PMLFMA) on homegrown many-core SW26010 cluster of China, noted as (SW-PMLFMA), for 3-D electromagnetic scattering problems. In this approach, the multilevel fast multipole algorithm (MLFMA) octree is first partitioned among management processing elements (MPEs) of SW26010 processors following the ternary partitioning scheme using the message passing interface (MPI). Then, the computationally intensive parts of the PMLFMA on each MPI process, matrix filling, aggregation and disaggregation are accelerated by using all the 64 computing processing elements (CPEs) in the same core group of the MPE via the Athread parallel programming model. Different parallelization strategies are designed for many-core accelerators to ensure a high computational throughput. In coincidence with the special characteristic of local Lagrange interpolation, the compressed sparse row (CSR) and the compressed sparse column (CSC) sparse matrix storage format is used for storing interpolation and anterpolation matrices, respectively, together with a specially designed cache mechanism of hybrid dynamic and static buffers using the scratchpad memory (SPM) to improve data access efficiency. Numerical results are included to demonstrate the efficiency and versatility of the proposed method. The proposed parallel scheme is shown to have excellent speedup. [ABSTRACT FROM AUTHOR]

A trend in the development of spaceborne Synthetic Aperture Radar (SAR) technology is the shift from a single-satellite repeated observation mode to a multi-satellite collaborative observation mode. However, current multi-satellite collaborative geolocation algorithms face challenges, such as geometric model mismatch and poor baseline estimation accuracy, arising from highly dynamic changes among multi-satellites. This paper introduces a high-precision and efficient geolocation algorithm for a spaceborne bistatic interferometric SAR (BiInSAR) system based on an improved range–Doppler (IRD) model. The proposed algorithm encompasses three key contributions. Firstly, a comprehensive description of the spatial baseline geometric model unique to the bistatic configuration is provided, with a specific focus on deriving the perpendicular baseline expression. Secondly, IRD geolocation functions are established to meet the specific requirements of the bistatic configuration. Then, a novel BiInSAR geolocation algorithm based on the IRD's functions is proposed, which can significantly improve the target geolocation accuracy by modifying the range–Doppler equation to suit the bistatic configuration. Meanwhile, a low-coupling parallel calculation method is proposed, which can improve the calculation speed by two to three times. Finally, the accuracy and efficiency of the algorithm are demonstrated using experimental data acquired by the TH-2 satellite, which is China's first spaceborne BiInSAR system. The experimental results prove that the IRD algorithm exhibits geolocation accuracy with an average error of less than 1 m and a standard deviation of less than 2.5 m while maintaining computational efficiency at a calculation speed of 1,429,678 pixels per second. [ABSTRACT FROM AUTHOR]

With the advent of the post-pandemic era, the global economic situation has tightened, and the economic benefits of container ports have also been affected. This paper attempts to build a novel berth-tugboat-quay crane joint scheduling method for container ports to reduce the economic cost of container ports. Firstly, from the perspective of the economic cost of container ports, considering random economic factors, this paper proposes a new berth-tugboat-quay crane joint dispatch optimization model, namely E-BUQC, by taking the minimum time cost of vessels in port, the cost of additional freight distance for trucks, the cost of tugboat operation, and the minimum operation cost of quay cranes as the objective function. Then, in order to obtain a relatively high-quality solution, based on chaotic mapping and quantum computing, this paper constructs a new chaotic quantum adaptive satin bower bird optimizer algorithm, namely CQASBO, formulates exclusive coding rules for the E-BUQC model, develops a feasible integer algorithm, and proposes a new joint scheduling solution method of berth-tugboat-quay crane, named E-BUQC_CQASBO. Subsequently, based on the simulation examples of two ports in northern China, the new solution method is tested. The simulation test results show that the E-BUQC model obtains an appropriate solution; The CQASBO constructed in this paper has better performance than other traditional comparison algorithms selected in this paper and can provide a better solution when solving the E-BUQC model. [ABSTRACT FROM AUTHOR]

The lightning clustering algorithm for spaceborne lightning observations clusters events into flash products and plays a crucial role in lightning-related research. This paper modified the lightning clustering algorithm based on the routine algorithm of Lightning Mapping Imager (LMI) and applied it to lightning events recorded by the LMI in 2019 to study the flash duration and flash area and specially to reveal the extreme lightning. To reveal the temporal and spatial features of lightning, the MCA (modified cluster algorithm) flash products defined flash duration and flash area. The results showed that continental regions have higher lightning frequencies but smaller events per flash, flash durations and flash areas than the ocean. The Tibetan Plateau has a low lightning frequency and smaller flash duration and area than eastern China. The flash count, events per flash, flash duration and flash area are higher during nighttime than during daytime. The relationship between flash duration and flash area showed distinct regional differences. In the MCA flash product, about 0.6% (0.1%) flashes have duration (area) that exceeds 1.0 s (5,000 km2). Finally, we analyzed two extreme lightning cases in eastern China, where the longest flash duration was 4.748 s and the largest flash area was 17,100 km2. This research contributes to advancing our understanding in the features of space-based lightning in the Eastern Hemisphere and applications to convection study. • Clustering algorithm was modified to study lightning with extreme duration and area. • Lightning duration and area both implied regional differences. • Quantitative relationship of duration and area was established in different regions. • The longest flash duration/largest flash area was 4.75 s/17100 km2 in eastern China. [ABSTRACT FROM AUTHOR]