37 results about "Parallel sorting" patented technology

The invention discloses a combined sorting optimization method for a small piece sorting machine in a logistics transfer field, which comprises the following steps: sorting modes are divided into serial sorting and parallel sorting, and sorting strategies are respectively constructed for the serial sorting and the parallel sorting; selecting one sorting strategy from serial sorting and parallel sorting to sort the parcels according to the parcel quantity in the sorting shift; and under the selected sorting strategy, constructing a Markov decision process model for a logistics sorting scheduling problem, and solving based on a multi-agent near-end strategy optimization algorithm. According to the method, high-precision simulation and real-time feedback of an actual system are achieved through the digital twinborn technology, combined scheduling and self-adaptive optimization of the MAPPO algorithm in multi-agent reinforcement learning under an MDP framework are combined, the response capacity of the system to complex dynamic changes is effectively improved, and the overall efficiency of the logistics sorting system is remarkably improved.

Described and illustrated is a method for redistributing packages (2) in a sorting station (1), in which the packages (2) are transported successively to a scanning device (7) in at least one transport sequence (4) and are scanned successively according to the at least one transport sequence (4) to record at least one dimension and at least one sorting parameter, in which the scanned packages (2) are sorted according to the at least one sorting parameter and divided into at least two parallel sorting sequences (10) of packages (2) and are successively loaded into different transport units (12) by at least one robot (11) according to the sorting sequences (10) and transported away from the sorting station (1) with the transport units (12), in which a control device (6) determines at least two parallel, optimized theoretical sorting sequences (10),in which only individual packages (2) are removed from the transport sequence (4) and / or the sorting sequences (10) and reintroduced elsewhere into the transport sequence (4) and / or sorting sequences (10) to form the optimized sorting sequences (10) determined by the control device (8), and in which the packages (2) are loaded into the transport units (12) by at least one robot according to the optimized sorting sequences (10).

A method for redistributing packages in a sorting station, in which the packages are delivered in a bundled manner in separate transport units to the sorting station, unloaded in the sorting station and transported successively to a scanning device in at least one transport sequence. The packages of the at least one transport sequence are scanned successively in accordance with the at least one transport sequence in order to detect respectively at least one size measurement and respectively at least one sorting parameter. The scanned packages are sorted in the at least one transport sequence in a sorting device on the basis of the at least one sorting parameter and divided into at least two parallel sorting sequences of packages. The packages of the parallel sorting sequences are successively loaded into different transport units by at least one robot in accordance with the sorting sequences and are transported away from the sorting station by the transport units. A control device determines at least two parallel, theoretical sorting sequences based on the at least one transport sequence and the at least one sorting parameter of the packages of the at least one transport sequence. The control device determines optimized sorting sequences to be loaded successively into the transport units in a space-saving manner based on the theoretical sorting sequences, based on the at least one size measurement of the packages of the theoretical sorting sequences and based on a loading algorithm. Only individual packages are removed from the transport sequence and / or from the sorting sequences and are reintroduced into the transport sequence and / or sorting sequences at another position in order to form the optimized sorting sequences determined by the control device. The packages are loaded into the transport units by the at least one robot in accordance with the optimized sorting sequences.

A method for redistributing packages in a sorting station is described and illustrated. In order to enable a further increased efficiency of sorting stations with reasonable effort, it is provided that the packages are scanned successively in at least one transport sequence in order to respectively detect at least one sorting parameter in accordance with the at least one transport sequence, that the scanned packages are sorted in the at least one transport sequence in a sorting device on the basis of the at least one sorting parameter and are divided into at least two parallel sorting sequences of packages, that the packages of the parallel sorting sequences are loaded one after the other into at least one transport unit with at least one common robot in accordance with the sorting parameters, that a control device determines an optimized loading sequence for the at least one common robot based on the at least one sorting parameter of the packages of the at least two parallel sorting sequences and, preferably, based on at least one loading state of the at least one transport unit, and that the packages are loaded into the at least one transport unit by the at least one common robot in accordance with the optimized loading sequence.

The utility model relates to the technical field of material sorting, in particular to an auxiliary device, sorting equipment and a parallel sorting system. The auxiliary device for parallel sorting of the multiple sorting devices comprises a top-layer support, a bottom-layer support, a top-layer support, a top-layer support, a top-layer support and a bottom-layer support, the bottom-layer bracket is arranged below the top-layer bracket and is used for supporting a plurality of sorting devices side by side; the scraper conveyor is arranged on the top-layer bracket and comprises a middle groove which is provided with a plurality of material leakage notches, is arranged in one-to-one correspondence with the feeding ports and is used for enabling materials to fall down from the material leakage notches; and the scraper chain surrounds the middle groove and is used for conveying materials. According to the material supply device, materials can be uniformly supplied to a plurality of sorting devices through one scraper conveyor, so that the material supply process is simpler and more convenient, and the material sorting efficiency is effectively improved. Parallel sorting can be achieved through multiple sorting devices, the material sorting efficiency is improved, and the yield is increased. And a plurality of sorting devices are mounted on the auxiliary device, so that the sorting devices can be arranged more compactly, and the space is effectively saved.

Systems and methods for parallel sorting of seismic data are disclosed. The methods include obtaining a seismic dataset comprising a plurality of shot gathers; dividing headers from the plurality of shot gathers among a plurality of computer nodes; sorting the headers separately on each of the plurality of computer nodes; saving the sorted headers from the plurality of computer nodes to a temporary file; sorting the sorted headers saved to the temporary file into a cross spread gather ordering; and sorting seismic traces according to the cross spread gather ordering to create cross spread gathers. The methods further include applying a seismic imaging algorithm to the cross spread gathers to create a seismic image.

This application relates to a hardware-implemented sorting method, apparatus, computer device, readable storage medium, and program product. The method includes: acquiring a first data sequence to be sorted, where each data element in the first data sequence contains a key value and its position index within the sequence; concatenating the key value and position index of each data element according to a preset sorting direction to obtain the first data elements to be sorted; and performing hardware parallel sorting on the first data elements using a bitonic merge sort network to obtain a sorted second data sequence, wherein the sorting order of the data elements in the second data sequence retains the relative positional relationships in the first data sequence. This allows the primary sorting order to be determined based on the key value, and the relative order of data with the same key value to be determined based on the positional information. While maintaining sorting stability, it inherits the hardware parallel advantages of bitonic merge sort, resulting in fast sorting speed suitable for real-time video decoding requirements.

Embodiments relate to a neural engine circuit of a neural network processor circuit that performs a convolution operation on input data in a first mode and a parallel sorting operation on input data in a second mode. The neural engine circuit includes a plurality of operation circuits and an accumulator circuit coupled to the plurality of operation circuits. The plurality of operation circuits receives input data. In the first mode, the plurality of operation circuits performs multiply-add operations of a convolution on the input data using a kernel. In the second mode, the plurality of operation circuits performs a portion of a parallel sorting operation on the input data. In the first mode, the accumulator circuit receives and stores first results of the multiply-add operations. In the second mode, the accumulator circuit receives and stores second results of the parallel sorting operation.

The data sorting method, device, terminal and storage medium provided by the application, the method comprises the following steps: determining a composite sorting key of a database in a CPU memory, the composite sorting key comprising a primary sorting key and a secondary sorting key; constructing a key-value pair based on the row pointer of the extracted original data of the database record and the composite sorting key; constructing a target data group suitable for the parallel sorting structure based on the key-value pair; executing the pre-adjusted double-sorting based on the target data group through the GPU; triggering the secondary sorting key comparison when the primary sorting keys of the two data of the to-be-compared data group in the double-sorting sequence constructed based on the target data group are the same in the process of executing the pre-adjusted double-sorting; and assembling the result set in the order of the row pointer of the sorting result through the CPU. When the pre-adjusted double-sorting is executed based on the target data group through the GPU, the comparison logic of the composite sorting key is introduced, so that the secondary sorting key is compared when the primary sorting keys are the same, and the sorting is strictly monotonic.

The invention provides a data sorting method and apparatus, an electronic device and a chip. The method comprises the steps of obtaining a first quantity of to-be-sorted data included in a first sorting task; under the condition that the first number is smaller than the Nth power of 2 and larger than the N-1 power of 2, at least one redundant position is determined, and the sum of the number of the at least one redundant position and the first number is the Nth power of 2; performing mask processing on the at least one redundant position; the first number of to-be-sorted data is sorted to obtain a target sequence, the target sequence is a monotone increasing sequence or a monotone decreasing sequence, and under the condition that the first number is smaller than the N power of 2 and larger than the N-1 power of 2, the position of the to-be-sorted data compared with the redundant position in the first number of to-be-sorted data does not change. According to the technical scheme, when the number of the input data is not the power of 2, parallel sorting of the data can be achieved without filling the data, the sorting efficiency can be improved, and the requirement for the storage space can be lowered.

To provide a laundry sorting device and linen supply system that does not require skilled sorting workers, secures workspace for sorting, reduces the workload for input and sorting workers, and reduces the number of belt conveyors used. [Solution] The laundry sorting device sorts a clump of laundry consisting of one or more types of linen products. The laundry sorting device includes an input sorting belt conveyor 11 into which the clump of laundry is fed and which transports one type of linen product that makes up the sorted clump of laundry, and one or more parallel sorting belt conveyors 12 that are arranged in parallel with the input sorting belt conveyor 11 and transport linen products of a different type from the linen products that are sorted from the clump of laundry and transported by the input sorting belt conveyor.

The invention discloses a merge tree enhancement method for a large-scale data set based on pointer doubling and parallelization. The method comprises the steps of obtaining a steepest rising path so as to determine a control area, proposing a horizontal enhancement method and a vertical enhancement method, determining a point set needing to be processed according to different enhancement methods, calculating a binary ancestor table of each key point (saddle point and extreme point), and parallelizing a binary ancestor table construction process so as to quickly find ancestor nodes of the key points. A key interval to which each rule point belongs is positioned by utilizing a multiplication algorithm, point sets corresponding to the key points are sequenced in parallel, the rule points are accurately integrated into a merge tree, and merge tree enhancement is quickly and effectively performed on a large-scale data set. According to the method, a merge tree enhancement process is optimized and innovated by combining a binary ancestor table, a pointer doubling algorithm and a parallelization technology, complex large-scale data can be processed, and horizontal enhancement and vertical enhancement of the merge tree are realized. The overall process is as shown in Figure 1.

The embodiment of the invention provides an FPGA parallel sorting method and system based on hierarchical odd-even rotation, and the method comprises the steps: obtaining input data needing to be sorted, and sequentially dividing the data into a plurality of groups of even index pairs and odd index pairs according to an input sequence; comparing the sizes of the two data in each group of even index pair or each group of odd index pair according to an alternate sequence of odd and even rounds, if the size sequence of the two data in the index pair does not accord with a preset sorting sequence, exchanging the positions of the two data, and alternately carrying out a plurality of comparison rounds; and after each comparison round, judging whether there is an index pair for data exchange in the round, and if there is no index pair for data exchange in two consecutive rounds, judging that sorting is completed, and outputting a sorting completion signal. The sorting efficiency can be greatly improved.

The present invention discloses a contact search method based on GPU parallelism, including: calculating the extended domain of contact blocks. Among them, under the CUDA architecture, the calculation method of using a single CUDA thread corresponding to a single contact block is adopted to calculate the extended domain of each contact block and store it in a one-dimensional array in the global video memory for storing the hybrid table; finding the contact points falling within the extended domain of the contact blocks to form test pairs; and finding contact pairs from the test pairs. In view of the demand for an efficient contact search algorithm in the field of contact collision simulation, the present invention proposes a contact search strategy based on GPU parallelism. For the large number of test pairs and contact pairs formed by contact blocks and nodes during the contact search process, a mapping strategy between threads and contact blocks and GPU parallel sorting technology are developed. The multi-core characteristics of the GPU are fully utilized to calculate such data-intensive independent tasks using GPU threads, realizing GPU acceleration for the search of test pairs and contact pairs.

The utility model relates to the field of material sorting, in particular to an auxiliary device and a parallel sorting system.The auxiliary device for parallel sorting of multiple sorting devices comprises a plurality of layers of platforms which are arranged in a staggered mode in the vertical height, and each layer of platform is used for bearing one sorting device; the material conveying pipe is arranged on one side of the multiple layers of platforms, a plurality of discharging openings corresponding to the platforms are formed in the side, facing the platforms, of the material conveying pipe and the bottom end of the material conveying pipe, and the material conveying pipe is used for conveying materials to the sorting equipment borne on the platforms; the one or more guide hoppers are arranged corresponding to the discharge port facing one side of the platform and are used for guiding the materials conveyed by the conveying pipe to the feed port of the sorting equipment; and the discharging pipelines are respectively arranged at the bottom of each layer of platform and are used for receiving the materials sorted by the sorting equipment and discharging the materials. Unified feeding is achieved through the conveying pipe, unified discharging is achieved through the discharging pipeline, the sorting machines work in parallel, the working efficiency is improved, and the cost is reduced.

The present invention belongs to the field of geophysical exploration technology, and discloses a parallel sorting fault node task migration method, device, equipment and storage medium, wherein the parallel sorting fault node task migration method first initializes valid nodes to form a valid node list, and according to the valid node list, the main process communicates with each background service process, and each background service process creates and starts each sub-service process, and the main process sets a keep-alive mechanism for each sub-service process, monitors the node status of the sub-service process, and processes abnormal nodes, and records the number of times each sub-job has been run. When a certain sub-job fails after being repeatedly run three times, the parallel sorting job is terminated. The present invention is suitable for parallel sorting fault node task migration, can provide a fault-tolerant mechanism for parallel sorting of seismic data, migrate erroneous sub-tasks, and provide support for the processing production efficiency of massive seismic data.

This invention discloses a parallel contact detection method for FDEM based on dual-domain activation, comprising: constructing a hash domain and a contact domain; dividing the problem domain into hash units; marking hash units containing TET4 units as active states; and constructing a contact domain centered on the host unit according to spatial neighborhood rules; sorting the TET4 units according to hash keys; traversing the sorted sequence to count the number of units in each hash unit, generating an index interval, marking the active states, and constructing an active unit list; based on the active unit list, sequentially selecting the host hash units, determining the visitor hash unit set according to spatial neighborhood rules, and performing pair detection on the TET4 units in the host and visitor units after activation state filtering; and generating a global contact pair set through two rounds of scanning for subsequent contact mechanics calculations. This invention, through a dual-domain activation mechanism and parallel sorting using GPU, limits the contact search to local active regions, avoiding global traversal and dynamic hash reconstruction.

The invention provides a cross-platform parallel sorting method and system for Web three-dimensional Gaussian sputtering rendering, and relates to the technical field of computers. The method comprises the following steps: explaining each depth key in a to-be-sorted key-value pair array into an N-bit unsigned integer key bit by bit through a sorting controller, and dividing each N-bit unsigned integer key into N / M times according to M data bits; the cardinality of each to-be-sorted data is sorted as a sorting task, and the sorting task is sent to a sorting calculator; dividing to-be-sorted data corresponding to the sorting task into P data blocks through a sorting calculator, and starting P working groups on the GPU to carry out cardinal number sorting on the P data blocks; after each sorting task is completed, the sorting controller takes the sorting result of the sorting task as a sorting reference of the next sorting task and sends the next sorting task to the sorting calculator until N / M sorting tasks are completed, and a completely sorted key-value pair array is obtained.

The invention provides a data sorting method and device, a terminal and a storage medium, and the method comprises the steps: determining a composite sorting key, comprising a primary sorting key and a secondary sorting key, of a database in a CPU (Central Processing Unit) memory, and constructing a key value pair based on row pointers of a plurality of pieces of original data recorded by the extracted database and the composite sorting key, constructing a target data group adaptive to the parallel sorting structure based on the key value pair; executing pre-adjusted dual-adjustment sorting based on the target data set through the GPU; in the process of executing the pre-adjusted double-tone sorting, when main sorting keys of two pieces of data of a to-be-compared data set in a double-tone sequence constructed based on the target data set are the same, triggering secondary sorting key comparison; and assembling a result set according to the row pointer sequence of the sorting result through the CPU. According to the method, when the pre-adjusted double-tone sorting is executed through the GPU based on the target data set, the comparison logic of the composite sorting keys is introduced, and it is ensured that when the primary sorting keys are the same, the secondary sorting keys are compared to ensure that the sorting is strict and monotonous.

The invention provides a self-service medicine selling machine parallel sorting method and system based on multi-axis cooperation, and relates to the technical field of control, and the method comprises the steps: obtaining medicine order information, carrying out spatial topology analysis, and decomposing an order into a plurality of subtask sets; generating an execution path containing avoidance timing constraint; a plurality of moving shafts are driven to grab the medicine in parallel and convey the medicine to a middle cache position; and merging and combining the plurality of medicines and conveying the medicines to a medicine outlet. Multi-axis cooperative work is achieved, physical collision and logic conflicts are avoided, the medicine sorting efficiency is improved, and the waiting time is shortened.

A bare seed arranging device comprises a rack and a controller, the rack is provided with a plurality of parallel arranging channels and a feeding mechanism for feeding the arranging channels, the two ends of each arranging channel are provided with a vibration disc and a discharging mechanism respectively, and the vibration disc is arranged below the feeding mechanism; the material arranging channel comprises a plurality of conveying belts which are connected end to end, and each conveying belt is independently provided with a servo motor for driving; a first sensor is arranged above an outlet of the vibration disc, a second sensor and a third sensor which are used for cooperatively controlling the distance between materials are arranged between the two conveying belts connected front and back, the second sensor is located above the rear side of the output end of the front conveying belt, and the third sensor is located at the input end of the rear conveying belt. A fourth sensor is arranged at the joint of the conveying belt and the discharging mechanism, and a photoelectric camera is arranged on the upper side of the discharging mechanism. The device has the advantages that the material conveying distance can be automatically increased, uniform feeding is guaranteed, and the counting and rechecking functions are achieved.

The invention relates to the technical field of tea leaf production and processing, in particular to a tea leaf sorting process monitoring method and system.The method comprises the steps that tea leaf picking information and tea leaf primary processing information are obtained, a plurality of tea leaf sorting stages are set, and each tea leaf sorting stage corresponds to the screening purpose requirement; the execution sequence of the multiple tea leaf sorting stages is determined, a sorting process preset queue is constructed, and real-time sorting monitoring is conducted on the multiple tea leaf sorting stages; classifying and screening the to-be-sorted tea leaves, and obtaining stage monitoring results of the corresponding tea leaf sorting stages; and setting a collaborative monitoring network, obtaining a segmented monitoring result, calling any tea sorting stage according to the segmented monitoring result, adjusting the sorting process preset queue in real time, and generating a sorting process execution queue. By means of the tea leaf sorting system and method, the problems that in the traditional tea leaf sorting process, the sorting process is not accurate, the dynamic adjusting capacity is lacked, the parallel sorting quality is different, and equipment and requirement matching is insufficient are effectively solved.

This invention discloses an intelligent sorting control system for unmanned warehousing, relating to the field of intelligent sorting technology. The invention includes a sorting mechanism with an infeed mechanism and a sorting mechanism on one side. Through a high-speed conveying system of the infeed mechanism, goods can be quickly transported from trucks to the infeed hopper. This method achieves automated guidance for all types of goods, regardless of size or weight, ensuring accurate positioning of goods upon entering the system. Through the rotation mechanism of the infeed hopper, goods are accurately delivered to the appropriate sorting channel, laying a solid foundation for subsequent sorting operations. The system has multiple sorting channels, each capable of processing different categories of goods in parallel. This parallel sorting method enables the simultaneous processing of multiple items, significantly improving sorting efficiency. Especially during peak hours, the system ensures no bottlenecks occur, maximizing the processing capacity of the logistics center.

The present invention relates to the technical field of tea production and processing, and in particular to a tea sorting process monitoring method and system. The method comprises: obtaining tea picking information and tea primary processing information, setting a number of tea sorting stages, and each tea sorting stage corresponds to a screening purpose requirement; determining the execution order of the several tea sorting stages, constructing a preset sorting process queue, and performing real-time sorting monitoring on the several tea sorting stages; grading and screening the tea to be sorted, and obtaining stage monitoring results of the corresponding tea sorting stages; setting up a collaborative monitoring network, obtaining segmented monitoring results, and calling any tea sorting stage according to the segmented monitoring results, adjusting the preset sorting process queue in real time, and generating a sorting process execution queue. The present invention effectively solves the problems existing in the traditional tea sorting process, such as inaccurate sorting process, lack of dynamic adjustment capability, differences in parallel sorting quality, and insufficient matching of equipment with demand.

Described and illustrated is a method for redistributing packages (2) in a sorting station (1). In order to further increase the efficiency of sorting stations with reasonable effort, it is provided that the packages (2) are scanned one after the other in at least one transport sequence (4) to detect at least one sorting parameter in each case according to the at least one transport sequence (4); that the scanned packages (2) in the at least one transport sequence (4) are sorted in a sorting device (6) based on the at least one sorting parameter and divided into at least two parallel sorting sequences (10) of packages (2); that the packages (2) of the parallel sorting sequences (10) are loaded one after the other into at least one transport unit (12) according to the sorting parameters using at least one common robot (11);that a control device (6) determines an optimized loading sequence for the at least one common robot (11) based on the at least one sorting parameter of the packages (2) of the at least two parallel sorting sequences (10) and, preferably, based on at least one loading state of the at least one transport unit (12), and that the packages (2) are loaded into the at least one transport unit (12) by the at least one common robot (11) according to the optimized loading sequence.

The invention relates to a method for redistributing parcels (2) in a sorting station (1). In order to further increase the efficiency of the sorting station with reasonable investment, the parcels (2) are sequentially scanned in at least one transport sequence (4) according to the at least one transport sequence (4) in order to record at least one sorting parameter in each case, the scanned parcels (2) in at least one transport sequence (4) are sorted in a sorting device (6) according to at least one sorting parameter and are divided into at least two parcel (2) sorting sequences (10) parallel to each other. The parcels (2) in the parallel sorting sequences (10) are sequentially loaded into the at least one transport unit (12) by the at least one common robot (11) according to sorting parameters, and the control device (6) controls the parcels (2) in the parallel sorting sequences (10) according to at least one sorting parameter of the parcels (2) in the at least two parallel sorting sequences (10) and preferably at least one loading state of the at least one transport unit (12). An optimized loading sequence is determined for the at least one common robot (11), and the parcels (2) are loaded into the at least one transport unit (12) by the at least one common robot (11) according to the optimized loading sequence.

Data sorting method and hardware-accelerated parallel sorting circuit, relating to integrated circuit technology. The data sorting method of the present invention includes the following steps: 1) Construct a storage sequence with the same length as the sequence to be sorted, and determine the comparison logic and storage sequence filling method according to a predetermined sorting method; 2) Construct an intermediate sequence and an offset sequence with the same length as the sequence to be sorted; 3) Read an unread address in the sequence to be sorted, and store the value therein to the end of the storage sequence; 4) Read an unread address in the sequence to be sorted, use its value as the newly entered value, and make a traversal comparison with the values of each bit in the storage sequence; 5) Update the storage sequence; 6) If all addresses in the sequence to be sorted have been read, the sorting is completed, otherwise return to step 4). The present invention sorts by means of parallel processing, which can significantly reduce the time overhead and improve the overall operation speed.

The present invention discloses a double - series sorting device, which belongs to the technical field of superconducting magnetic separation devices. It includes a transition cylinder, with a first sorting outer cylinder and a second sorting outer cylinder respectively arranged at both ends of the transition cylinder. A first sorting inner cylinder is arranged inside the first sorting outer cylinder, and a first slurry outlet channel is formed by the gap between the first sorting outer cylinder and the first sorting inner cylinder; a second sorting inner cylinder is arranged inside the second sorting outer cylinder, and a second slurry outlet channel is formed by the gap between the second sorting outer cylinder and the second sorting inner cylinder; the first sorting inner cylinder is communicated with the second slurry outlet channel, and the second sorting inner cylinder is communicated with the first slurry outlet channel; magnetic medium assemblies are arranged inside both the first sorting inner cylinder and the second sorting inner cylinder. The present invention changes the traditional series - tank parallel sorting structure to a series - type sorting cavity to realize the sorting operation. The magnetic separation path is longer, more weakly magnetic impurities can be adsorbed, the feeding time for a single operation is longer, the reciprocating working frequency is less, and the loss of the magnetic separation equipment is smaller.

The application provides a log collection method and system based on parallel sorting, which specifically comprises the following steps: (1) data sampling: collecting log data from different log sources, transmitting the log data to a data processing node, and using a big data-oriented scalable regular sampling method to obtain representative samples from the log data; (2) parallel sorting: distributing the representative samples to multiple nodes in the system according to certain rules, and sorting the log data on each node using a parallel sorting algorithm; (3) parallel writing: collecting the sorted log data representative samples into a file system in parallel; (4) monitoring and optimization: monitoring the space utilization of the file system in real time through a verification file and a checking tool, and regularly checking the integrity of the log data. The application uses a big data-oriented scalable regular sampling method to preprocess and sample the log, and uses parallel sorting technology to efficiently collect the log data. Then, the sampled log sample data is distributed to multiple processing nodes to realize parallel sorting operation. The application disperses sample storage and processing tasks to each process for sorting and iteratively updates the pivot element, thereby improving parallel efficiency, reducing processing bottlenecks caused by uneven data distribution, and improving the overall performance and reliability of the log management system.

The present invention discloses an optimization method for joint sorting of small-piece sorting machines in a logistics transfer yard, including: dividing the sorting methods into two types: serial sorting and parallel sorting, and constructing sorting strategies for serial sorting and parallel sorting respectively; according to the package volume within a sorting shift, selecting one of the sorting strategies from serial sorting and parallel sorting to perform package sorting; under the selected sorting strategy, constructing a Markov decision process model for the logistics sorting and scheduling problem, and solving it based on the multi-agent proximal policy optimization algorithm. The present invention uses digital twin technology to achieve high-precision simulation and real-time feedback of the actual system, and combines the joint scheduling and adaptive optimization of the MAPPO algorithm in multi-agent reinforcement learning under the MDP framework, effectively improving the response ability of the system to complex dynamic changes and significantly improving the overall efficiency of the logistics sorting system.