In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri...
详细信息
ISBN:
(纸本)9781467365932
In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri net is proposed. First, as Petri net system has the characteristics of synchronization and concurrence, provide the place-invariantbased Petri net model partitioning and subnet division conditions and parallelizing analysis;put forward the extended theorem and validation of partitioning condition of parallel subnet;then, provide the formalization of subnet division and the solving process of place invariant and place-invariantbased partitioning algorithm of parallel subnet of Petri net. The experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.
Capacitated Arc Routing Problem (CARP) is one of the hot issues of logistics research. Specifically, Ranking First Cutting Second (RFCS) could be used. This research proposed a novel partitioning algorithm - the Multi...
详细信息
ISBN:
(纸本)9783319251592;9783319251585
Capacitated Arc Routing Problem (CARP) is one of the hot issues of logistics research. Specifically, Ranking First Cutting Second (RFCS) could be used. This research proposed a novel partitioning algorithm - the Multi-Label algorithm which obtained better TSP paths meeting the backpack limit on the basis of a complete TSP return. In addition, by experimental verification on questions in the standard question database, the experimental results showed that compared with general partitioning algorithms, for the same complete TSP return, many TSP paths with the shortest total length could be obtained by the Multi-Label algorithm.
PurposeThis research aims to advance the Isogeometric Scaled Boundary Finite Element Method (IG-SBFEM) by introducing a partitioning approach for solving elastic and viscoelastic problems with cyclic symmetry. The stu...
详细信息
PurposeThis research aims to advance the Isogeometric Scaled Boundary Finite Element Method (IG-SBFEM) by introducing a partitioning approach for solving elastic and viscoelastic problems with cyclic symmetry. The study seeks to mitigate the computational burden associated with eigenvalue problems by proving the block-circulant nature of the system matrices. Through partitioning, the solution scale is reduced, and the study further explores the integration of the Lagrange multiplier scheme and temporally adaptive algorithms (TPAA) to handle complex displacement constraints and viscoelastic properties, ensuring efficient computation even in cyclically symmetric ***/methodology/approachThe methodology centers on the development of a partitioning algorithm integrated into the Isogeometric Scaled Boundary Finite Element Method (IG-SBFEM). By leveraging the block-circulant nature of matrices under cyclic symmetry, the study reduces the solution scale of both eigenvalue and system equations. Displacement constraints are addressed through a Lagrange multiplier scheme. The approach further applies a temporally piecewise adaptive algorithm (TPAA) to convert viscoelastic problems into elastic problems, allowing efficient numerical analysis and computation for cyclically symmetric *** study finds that the partitioning IG-SBFEM efficiently addresses elastic and viscoelastic problems with cyclic symmetry, reducing both the solution scale and computational cost. The block-circulant property of the matrices enables the decomposition of complex equations into smaller sub-problems, improving performance. Additionally, the Lagrange multiplier scheme successfully handles displacement constraints. The temporally piecewise adaptive algorithm (TPAA) further enhances efficiency by transforming viscoelastic problems into elastic equivalents. Numerical results confirm that this approach achieves accurate solutions with reduced computational ***
In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri...
详细信息
In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri net is proposed. First, as Petri net system has the characteristics of synchronization and concurrence, provide the place-invariant-based Petri net model partitioning and subnet division conditions and parallelizing analysis;put forward the extended theorem and validation of partitioning condition of parallel subnet;then, provide the formalization of subnet division and the solving process of place invariant and place-invariantbased partitioning algorithm of parallel subnet of Petri net. The experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.
In order to solve the problem about the partition of Petri net model and subnet division,realize the concurrent execution or simulation runs of Petri net system,the partitioning algorithm of parallel subnet of Petri n...
详细信息
In order to solve the problem about the partition of Petri net model and subnet division,realize the concurrent execution or simulation runs of Petri net system,the partitioning algorithm of parallel subnet of Petri net is ***,as Petri net system has the characteristics of synchronization and concurrence,provide the place-invariantbased Petri net model partitioning and subnet division conditions and parallelizing analysis:put forward the extended theorem and validation of partitioning condition of parallel subnet:then,provide the formalization of subnet division and the solving process of place invariant and place-invariantbased partitioning algorithm of parallel subnet of Petri *** experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.
Multiprocessor System-on-Chip (MPSoC) based on Network-on-Chip (NoC) integrates a large amount of Processor Elements (PEs) to fulfill the performance requirements of several applications. These applications are compos...
详细信息
ISBN:
(纸本)9781479975815
Multiprocessor System-on-Chip (MPSoC) based on Network-on-Chip (NoC) integrates a large amount of Processor Elements (PEs) to fulfill the performance requirements of several applications. These applications are composed of a set of intercommunicating tasks, which are dynamically mapped onto PEs of the target architecture. However, the efficient task-mapping requires some previous steps, among them partitioning, which organizes tasks considering their interaction before applying a mapping process. This paper introduces Partition Reduce (PR) - a task partitioning approach based on the MapReduce algorithm targeting homogeneous NoC based MPSoCs. We analyze the efficiency of PR for energy consumption (EC) minimization and load balance (LB). The results obtained from a set of experiments, with large number of tasks, demonstrate that PR is more effective on processing time and result quality when compared to the classic Simulated Annealing (SA). In addition, PR produces partitions with low energy consumption and rigorous load balance.
The existing improved Raft consensus mechanisms suffer from unreasonable partitioning and an inability to tolerate Byzantine nodes. This paper proposes a Byzantine fault-tolerant Raft consensus mechanism based on comp...
详细信息
ISBN:
(纸本)9798350389913;9798350389906
The existing improved Raft consensus mechanisms suffer from unreasonable partitioning and an inability to tolerate Byzantine nodes. This paper proposes a Byzantine fault-tolerant Raft consensus mechanism based on comprehensive evaluation partitioning (CB-Raft). The nodes are evaluated comprehensively in terms of consensus behaviors and location, and the nodes are partitioned according to the parity of the comprehensive evaluation score ranking, which solves the problem of inefficient consensus;and the nodes communicate with each other based on BLS signatures to tolerate Byzantine nodes. The experimental results show that compared with that of Raft, the latency of CB-Raft is reduced by 70%, and the throughput is improved by 80.8%. CB-Raft has high consensus performance and good resistance to Byzantine nodes, making it suitable for blockchain application scenarios with large-scale nodes.
In the field of computer vision, Field Programmable Gate Array (FGPA) limited de on-chip memory is difficult to meet the power, size and other requirements. To address this phenomenon, the study constructs a partition...
详细信息
In the field of computer vision, Field Programmable Gate Array (FGPA) limited de on-chip memory is difficult to meet the power, size and other requirements. To address this phenomenon, the study constructs a partitioning algorithm to achieve a balance between energy consumption and resource utilisation based on the analysis of memory resource allocation, overall power consumption and resource utilisation from the perspective of image processing technology. The power consumption of the balancing algorithm is lower compared to the optimised utilisation algorithm HLS tool, with both Block Ramdom Access Memory (BRAM) power consumption taking the value of 0.005;the dynamic power consumption takes the value range of 0.014-0.082. Compared to the High Level Synthesis (HLS) tool, the overall power consumption of the balancing algorithm and the optimised utilisation algorithm is significantly lower, with the values of 0.251 and 0.252 respectively, both with a reduction rate of approximately 30%. The accuracy rate of the proposed memory optimisation allocation algorithm is the highest among the four memory optimisation allocation algorithms and strategies on all three types of target scales. FPGA memory optimisation allocation strategy can guarantee to have lower power consumption while satisfying the same resource occupancy, and the model has in-depth application value in visual image vision technology.
Reconfigurable devices are gaining increasing attention as a viable alternative and supplementary solution to traditional CMOS technology. In this paper, we develop a more efficient 2-input look-up table (LUT) based o...
详细信息
ISBN:
(纸本)9798350387186;9798350387179
Reconfigurable devices are gaining increasing attention as a viable alternative and supplementary solution to traditional CMOS technology. In this paper, we develop a more efficient 2-input look-up table (LUT) based on the reconfigurable field-effect transistors (RFETs), leading to a smaller transistor usage and a smaller critical path delay. The cells are organized into regular matrices, known as MClusters, with a fixed interconnection pattern to replace LUTs in field-programmable gate arrays (FPGAs). To improve the efficiency of utilizing this structure, we design a SAT-based delay-aware packing algorithm to better utilize logical gates for the MCluster structure. Finally, we combine this algorithm with FPGA simulation tools to form a comprehensive benchmarking flow. A series of benchmark tests show that under the optimal design, up to 35% and 30% reduction can be achieved in delay and energy-delay product (EDP), respectively, compared to the traditional CMOS FPGAs.
Today, 360 degrees video has become an integral part of people's lives. Despite the fact that the latest generation standard Versatile Video Coding (VVC) demonstrates a significant gain in encoding capacity over H...
详细信息
Today, 360 degrees video has become an integral part of people's lives. Despite the fact that the latest generation standard Versatile Video Coding (VVC) demonstrates a significant gain in encoding capacity over High Efficiency Video Coding (HEVC), it still has room for 360 degrees video encoding improvements. To further enhance the applicability of 360 degrees video coding, an optimized rate control (RC) algorithm in VVC for 360 degrees video is proposed in this paper. We present an efficient extraction algorithm for obtaining the video's saliency feature. Furthermore, for the characteristics of 360 degrees video, a partitioning algorithm is also proposed to divide a frame into demand and non-demand regions. Additionally, to achieve precise and rational RC, a Coding Tree Unit (CTU)-level bit allocation strategy is proposed based on the saliency feature for the above-mentioned regions. The experimental results show that the proposed RC algorithm can achieve 11.77% bitrate savings and more accurate allocation compared with the default algorithm of VVC. Also, performance enhancement has been observed in comparison to the most advanced algorithm.
暂无评论