CN112732433A - Data processing system capable of carrying out priority allocation - Google Patents
Data processing system capable of carrying out priority allocation Download PDFInfo
- Publication number
- CN112732433A CN112732433A CN202110336870.6A CN202110336870A CN112732433A CN 112732433 A CN112732433 A CN 112732433A CN 202110336870 A CN202110336870 A CN 202110336870A CN 112732433 A CN112732433 A CN 112732433A
- Authority
- CN
- China
- Prior art keywords
- data
- module
- sorting
- file
- transmitted
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/22—Arrangements for sorting or merging computer data on continuous record carriers, e.g. tape, drum, disc
- G06F7/24—Sorting, i.e. extracting data from one or more carriers, rearranging the data in numerical or other ordered sequence, and rerecording the sorted data on the original carrier or on a different carrier or set of carriers sorting methods in general
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
Abstract
The invention relates to the technical field of electric digital data processing, in particular to a data processing system capable of carrying out priority allocation. The system comprises a file receiving unit, a data sorting unit, a two-way merging unit and a file processing unit; the data sorting unit comprises a datamation identification module, a data analog computation module, a data comparison module, a gradual change sorting module, a data analysis module, a command receiving module, a positioning sorting module and a transmission module; the two-path merging unit comprises a data integration module, a comparison sorting module, an optimal sorting module and a sorting command transmission module. According to the method, after the data are classified and arranged into the priority sequences, the arranged priority sequences are integrated and ordered again, so that the highest priority sequence of the file is obtained, the load of the cup in calculation is reduced, the speed of cup operation is increased, and the normal operation of the cup is guaranteed.
Description
Technical Field
The invention relates to the technical field of electric digital data processing, in particular to a data processing system capable of carrying out priority allocation.
Background
The priority is a parameter for determining the priority level of each job program to receive system resources when the computer time-sharing operating system processes a plurality of job programs. Before each job is input into the computer, it is assigned a priority according to certain requirements. For example, the priority level is assigned according to the nature of the program or the length of the program, or according to the source of the operation.
In general queuing problems, first-come pre-emption is the most natural queuing rule, but in practical problems, people sometimes use other rules to meet the needs of people, and people are often willing to give higher priority to more urgent events, events with higher delay cost or only easier events.
In the process of processing data, data is usually processed according to the coming and the coming of the data, priority is defined in advance for processing or data processing is performed synchronously, but when large-scale data is processed, if the coming and the coming or the coming of the data is adopted for processing, when the cup calculates complex data firstly, the post-calculation is simple data, the speed of the complex data calculation is too slow, the data are stacked together, the occupation of the cup is increased, the load of the cup is increased, the operation speed of the cup is reduced, even the cup overload calculation is generated, the crash situation of the system is caused, the workload of the cup work is increased, and the speed of coming out of the cup data is reduced.
Disclosure of Invention
It is therefore an object of the present invention to provide a data processing system capable of performing priority scheduling to solve the above-mentioned problems in the prior art.
In order to achieve the above object, the present invention provides a data processing system capable of performing priority scheduling, which includes a file receiving unit, a data sorting unit, a two-way merging unit and a file processing unit;
the file receiving unit is used for identifying and receiving the transmitted file;
the data sorting unit is used for carrying out data identification on the transmitted files and sorting the identified data respectively;
the two-path merging unit performs secondary merging on the data respectively sorted by the data sorting unit, so that the data are sorted in an optimal level;
the file processing unit calculates the data of the two-way merging unit discharging sequence step by step;
the data sorting unit comprises a datamation identification module, a data analog computation module, a data comparison module, a gradual change sorting module, a data analysis module, a command receiving module, a positioning sorting module and a transmission module;
the data identification module is used for carrying out data identification on the file identified and transmitted by the file receiving unit and respectively transmitting the identified data to the data analog computation module and the data analysis module by adopting a data link;
the data simulation calculation module is used for classifying the data transmitted by the datamation identification module, and simulating and calculating the difficulty of finishing calculation of each piece of data and the time required by calculating the data;
the data comparison module is used for receiving the data transmitted by the data calculation module and comparing the data according to the difficulty degree of each piece of data and the time required by calculation;
the gradual change sorting module sorts the data compared by the data comparison module;
the command receiving module is used for receiving a specified sorting command and transmitting the command to the data analysis module;
the data analysis module is used for receiving the data transmitted by the datamation identification module and the command receiving module, comparing and analyzing the data transmitted by the datamation identification module and the command receiving module, and transmitting the data compared and analyzed by the data analysis module to the positioning and sorting module after the data analysis module completes the comparison and analysis;
the positioning sorting module sorts the data transmitted by the data analysis module;
the transmission module is used for receiving and transmitting the data sequenced by the gradual change sequencing module and the positioning sequencing module;
the two-path merging unit comprises a data integration module, a comparison sorting module, an optimal sorting module and a sorting command transmission module;
the data integration module is used for receiving the data transmitted by the transmission module and matching the same data source of the transmitted data;
the comparison and sorting module compares the well-matched data of the data integration module and judges the priority level of the data source;
the optimal ranking module performs optimal ranking on the compared data sources;
the sorting command transmission module transmits the highest priority sequence list arranged by the highest ranking module to the file processing unit, and the file processing unit performs calculation processing on the data transmitted by the file transmission module according to the highest priority sequence list transmitted by the sorting command transmission module.
As a further improvement of the technical solution, the gradual change sorting module adopts a method of selecting sorting, and the idea of selecting sorting is as follows:
the direct selection sorting of the files of n records can obtain an ordered result through n-1 direct selection sorting:
s1, initial state: the disordered region is R1. n, and the ordered region is empty;
s2, sorting in the 1 st time, selecting the record R [ k ] with the smallest key word in the unordered region R [1.. n ], transferring the record R [ k ] into the ordered region, wherein the R [ k ] of the unordered region becomes the ordered region R [1], and the R [1] and the R [2.. n ] respectively become a new ordered region with 1 increased record number and a new unordered region with 1 decreased record number;
s3, repeating S2 until the ith time of sorting, when the ith time of sorting starts, the current ordered area and the unordered area are R1.. i-1 and R (i.. n) respectively, the time of sorting selects the record R k with the smallest key word from the current unordered area, and transfers it to the last transferred R1 in the ordered area, at this time, the R k enters the ordered area to be changed into R, and the R1.. i and R are changed into a new ordered area with 1 increased record number and a new unordered area with 1 decreased record number respectively.
As a further improvement of the technical solution, the sorting method of the positioning sorting module is heap sorting, the heap sorting adopts a large-root heap sorting algorithm, and the algorithm steps are as follows:
s1.1, building a pile: the heap building is a process of continuously adjusting the heap, and the adjustment is started from a len/2 position to a first node, wherein len is the number of elements in the heap;
s1.2, pile adjustment: comparing the node i with its child nodes left (i), right (i), selecting the largest (or smallest) of the three, if the largest (smallest) value is not the node i but one of its child nodes, interchanging the positions of the node i and the child node, and repeating the process;
s1.3, stacking and sorting: heap sorting is performed using the above two processes. Firstly, building a heap according to elements, then taking out a root node of the heap, continuing the process of heap adjustment on the front len-1 nodes, then taking out the root node, and repeating the operations until all nodes are taken out.
As a further improvement of the technical solution, the optimal ranking module adopts a two-way merging algorithm, and the algorithm steps are as follows:
inputting: an initial array A of n elements;
and (3) outputting: e-sorted arrays
；
S2.1, scanning the block A from left to right to obtain m ordered blocks;
s2.2, taking m ordered blocks as leaves, and calling MERGE algorithm generation for every two adjacent leaves
Merging the two paths of subtrees;
s2.3, for two adjacent
The two-path merging subtree recalls the MERGE algorithm to MERGE the two-path merging subtree into
Merging the two paths of subtrees;
s2.4, repeating S2.3 until all subtrees are merged into one two-way merged tree and the root of the merged tree is the solving result
。
As a further improvement of the technical solution, the file receiving unit includes a file identification module, a file storage module and a file transfer module;
the file identification module is used for identifying the transmitted data and acquiring the identified data after identification;
the file storage module stores the data identified and collected by the file identification module;
and the file transmission module transmits the data stored by the file storage module to the datamation identification module.
As a further improvement of the technical solution, the data connection working principle of the data identification module transmitted to the data analog computation module and the data analysis module is as follows:
s3.1, establishing a data link;
the master station sends an SNRM frame with a normal response mode to request the slave station to establish a data link, if the slave station and the master station have consistent information, a unnumbered confirmation UA frame is sent back to the master station, and the slave station and the master station are successfully connected;
wherein the SNRM frame functions as a data link requesting the establishment of a normal response signal;
s3.2, data frame transmission;
the master station sends a signal to the slave station, and the slave station sends a determination signal back to the master station after receiving the signal transmitted by the master station;
s3.3, releasing the data link;
and the master station sends a unnumbered link-breaking frame, the slave station receives the unnumbered link-breaking frame, breaks the link together with the master station, sends a unnumbered confirmation frame to the master station and returns the unnumbered confirmation frame to the master station, and at the moment, the data link is successfully released.
As a further improvement of the technical solution, the data sorting unit further comprises a command entry module and a temporary storage module;
the command input module is used for inputting commands and transmitting the input commands to the command receiving module;
the temporary storage module is used for storing the data sequenced by the gradual change sequencing module and the positioning sequencing module.
As a further improvement of the technical solution, the two-way merging unit further includes an inserted data transmission module, an inserted data comparison module, and an inserted data sequencing transmission module;
the inserting data transmission module is used for inserting data which needs to be processed temporarily;
the inserted data comparison module is used for receiving the data transmitted by the data integration module and the inserted data transmission module and comparing and sequencing the transmitted data;
and the inserting data sorting and transmitting module transmits the inserting data which is sorted in the optimal level.
As a further improvement of the technical solution, the sorting method in the insertion data comparison module is an insertion sorting method, and the algorithm steps thereof are as follows:
s4.1, sorting is carried out from the ordered sequence and the unordered sequence { a2, a3, …, an };
s4.2, when the ith element is processed, the array { a1, a2, …, ai-1} is ordered, and the array { ai, ai +1, …, an } is unordered;
and S4.3 and S4.2, performing insertion processing n-i times in total, and ordering the arrays.
Compared with the prior art, the invention has the beneficial effects that:
in the data processing system capable of carrying out priority allocation, the data acquired by the file receiving unit are processed according to the classes through the arranged data sorting unit, so that the data processing sequence of the optimal class is arranged in each class, the data sorted by the data sorting unit is subjected to secondary merging through the two-way merging unit, and the final sequence of the optimal class is listed side by side, so that when the cup processes the data, the data is reasonably processed, the data processing speed of the cup is accelerated, and the normal operation of the cup is ensured.
Drawings
FIG. 1 is an overall system block diagram of embodiment 1;
FIG. 2 is a block diagram of a file receiving unit of embodiment 1;
FIG. 3 is a block diagram of a data sorting unit of embodiment 1;
fig. 4 is a block diagram of a two-way merging unit of embodiment 1.
The various reference numbers in the figures mean:
1. a file receiving unit; 11. a file identification module; 12. a file storage module; 13. a file transfer module;
2. a data sorting unit; 21. a data identification module; 22. a data quasi-computation module; 23. a data comparison module; 24. a gradual change sorting module; 25. a data analysis module; 26. a command receiving module; 261. a command entry module; 27. a positioning and sorting module; 28. a transmission module; 29. a temporary storage module;
3. two-way merging unit; 31. a data integration module; 32. a comparison and sorting module; 33. an optimal ranking module; 34. a sorting command transmission module; 35. inserting a data transmission module; 36. inserting a data comparison module; 37. inserting a data sequencing transmission module;
4. a file processing unit.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the description of the present invention, it is to be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", "clockwise", "counterclockwise", and the like, indicate orientations and positional relationships based on those shown in the drawings, and are used only for convenience of description and simplicity of description, and do not indicate or imply that the equipment or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be considered as limiting the present invention.
Example 1
The present invention provides a data processing system capable of performing priority allocation, please refer to fig. 1-4, which includes a file receiving unit 1, a data sorting unit 2, a two-way merging unit 3 and a file processing unit 4;
the file receiving unit 1 is used for identifying and receiving the transmitted file;
the data sorting unit 2 identifies the transmitted files and sorts the identified data respectively;
the two-way merging unit 3 performs secondary merging on the data respectively sorted by the data sorting unit 2, so that the data are sorted in an optimal level;
the file processing unit 4 calculates the data of the sequence discharged by the two-way merging unit 3 step by step;
the data sorting unit 2 comprises a datamation identification module 21, a data analog calculation module 22, a data comparison module 23, a gradual change sorting module 24, a data analysis module 25, a command receiving module 26, a positioning sorting module 27 and a transmission module 28;
the data transmitted are sorted by the data sorting unit 2, so that the priority processing sequences are arranged in different sorts, and the two-way merging unit 3 can integrate the sorted priority sequences to accelerate the data calculation speed.
The data identification module 21 is used for performing data identification on the file identified and transmitted by the file receiving unit 1, and respectively transmitting the identified data to the data analog computation module 22 and the data analysis module 25 by adopting a data link;
the data simulation calculation module 22 is used for classifying the data transmitted by the datamation identification module 21, and simulating and calculating the difficulty of finishing calculation of each piece of data and the time required by calculating the data;
the data comparison module 23 is configured to receive the data transmitted by the data calculation module 22, and compare the difficulty level of each piece of data with the time required for calculation;
the gradual change sorting module 24 sorts the data compared by the data comparison module 23;
the command receiving module 26 is used for receiving a specified sorting command and transmitting the command to the data analysis module 25;
the data analysis module 25 is used for receiving the data transmitted from the datamation identification module 21 and the command receiving module 26, comparing and analyzing the data transmitted from the datamation identification module 21 and the command receiving module 26, and after the data analysis module 25 completes the comparison and analysis, transmitting the data compared and analyzed by the data analysis module 25 to the positioning and sorting module 27;
the positioning and sorting module 27 sorts the data transmitted from the data analysis module 25;
the transmission module 28 is used for receiving and transmitting the data sequenced by the gradual change sequencing module 24 and the positioning sequencing module 27;
the two-path merging unit 3 comprises a data integration module 31, a comparison sorting module 32, an optimal-level sorting module 33 and a sorting command transmission module 34;
the priority sequences listed by the data sorting unit 2 in a classified manner are integrated and arranged again through the two-way merging unit 3, so that the arrangement processing sequence of the data with the highest priority is obtained, and the cup is faster and operates stably when processing the data.
The data integration module 31 is used for receiving the data transmitted by the transmission module 28 and matching the same data source of the transmitted data;
the comparison and sorting module 32 compares the matched data of the data integration module 31 and judges the priority level of the data source;
the optimal ranking module 33 performs optimal ranking on the data sources after the comparison is completed;
the sorting command transmission module 34 transmits the top-priority sequence list arranged by the top-priority sorting module 33 to the file processing unit 4, and the file processing unit 4 performs calculation processing on the data transmitted by the file transmission module 13 according to the top-priority sequence list transmitted by the sorting command transmission module 34.
Further, the gradual change sorting module 24 adopts a method of selecting sorting, and the idea of selecting sorting is as follows:
the direct selection sorting of the files of n records can obtain an ordered result through n-1 direct selection sorting:
s1, initial state: the disordered region is R1. n, and the ordered region is empty;
s2, sorting in the 1 st time, selecting the record R [ k ] with the smallest key word in the unordered region R [1.. n ], transferring the record R [ k ] into the ordered region, wherein the R [ k ] of the unordered region becomes the ordered region R [1], and the R [1] and the R [2.. n ] respectively become a new ordered region with 1 increased record number and a new unordered region with 1 decreased record number;
s3, repeating S2 until the ith time of sorting, when the ith time of sorting starts, the current ordered area and the unordered area are R1.. i-1] and R (i.n), respectively, selecting the record R [ k ] with the smallest key word from the current unordered area, transferring the record R [ k ] to the last transferred R [ i-1] in the ordered area, wherein the R [ k ] enters the ordered area to become Ri, and the R [1.. i ] and Ri +1.. n are changed into a new ordered area with 1 increased record number and a new unordered area with 1 decreased record number respectively.
Specifically, the sorting method of the positioning sorting module 27 is heap sorting, and the heap sorting adopts a large-root heap sorting algorithm, and the algorithm steps are as follows:
s1.1, building a pile: the heap building is a process of continuously adjusting the heap, and the adjustment is started from a len/2 position to a first node, wherein len is the number of elements in the heap; the heap building process is a linear process, and the process of adjusting the heap is called from len/2 to 0, which is equivalent to o (h1) + o (h2) … + o (hlen/2), wherein h represents the depth of the node, len/2 represents the number of the nodes, and the process is a summation process, and the result is linear O (n);
s1.2, pile adjustment: comparing the node i with its child node left (i), right (i), selecting the largest (or smallest) of the three, if the largest (smallest) value is not the node i but a child node, interchanging the positions of the node i and the child node, and repeating the process, wherein the time complexity of the process of adjusting the heap is related to the depth of the heap, which is lgn operation, because the adjustment is performed along the depth direction;
s1.3, stacking and sorting: heap sorting is performed using the above two processes. Firstly, building a heap according to elements, then taking out a root node of the heap, continuing the process of heap adjustment on the front len-1 nodes, then taking out the root node, and repeating the operations until all nodes are taken out.
In addition, the optimal ranking module 33 adopts a two-way merging algorithm, which comprises the following steps:
inputting: an initial array A of n elements;
and (3) outputting: e-sorted arrays
；
S2.1, scanning the block A from left to right to obtain m ordered blocks;
s2.2, taking m ordered blocks as leaves, and calling MERGE algorithm generation for every two adjacent leaves
Merging the two paths of subtrees;
s2.3, for two adjacent
The two-path merging subtree recalls the MERGE algorithm to MERGE the two-path merging subtree into
Merging the two paths of subtrees;
s2.4, repeating S2.3 until all subtrees are merged into one two-way merged tree and the root of the merged tree is the solving result
。
Further, the file receiving unit 1 includes a file identification module 11, a file storage module 12 and a file transfer module 13;
the file identification module 11 is used for identifying the transmitted data and acquiring the identified data after identification;
the file storage module 12 stores the data identified and collected by the file identification module 11;
the file transfer module 13 transfers the data stored by the file storage module 12 to the data identification module 21.
Specifically, the data connection operation principle of the data identification module 21 to the data analog computation module 22 and the data analysis module 25 is as follows:
s3.1, establishing a data link;
the master station sends an SNRM frame with a normal response mode to request the slave station to establish a data link, if the slave station and the master station have consistent information, a unnumbered confirmation UA frame is sent back to the master station, and the slave station and the master station are successfully connected;
wherein the SNRM frame functions as a data link requesting the establishment of a normal response signal;
s3.2, data frame transmission;
the master station sends a signal to the slave station, and the slave station sends a determination signal back to the master station after receiving the signal transmitted by the master station;
s3.3, releasing the data link;
and the master station sends a unnumbered link-breaking frame, the slave station receives the unnumbered link-breaking frame, breaks the link together with the master station, sends a unnumbered confirmation frame to the master station and returns the unnumbered confirmation frame to the master station, and at the moment, the data link is successfully released.
In addition, the data sorting unit 2 further includes a command entry module 261 and a temporary storage module 29;
the command input module 261 is used for inputting commands and passing the inputted commands to the command receiving module 26;
the temporary storage module 29 is used for storing the data sorted by the fade sorting module 24 and the positioning sorting module 27.
Further, the two-way merging unit 3 further includes an insertion data transmission module 35, an insertion data comparison module 36, and an insertion data sorting transmission module 37;
the insertion data transmission module 35 is used for inserting data which needs to be processed temporarily;
the inserted data comparison module 36 is used for receiving the data transmitted by the data integration module 31 and the inserted data transmission module 35, and comparing and sequencing the transmitted data;
the insertion data sorting transmission module 37 transmits the insertion data that completes the sorting of the optimal level.
Specifically, the sequencing method inserted into the data comparison module is an insertion sequencing method, and the algorithm steps are as follows:
s4.1, sorting is carried out from the ordered sequence and the unordered sequence { a2, a3, …, an };
s4.2, when the ith element is processed, the array { a1, a2, …, ai-1} is ordered, and the array { ai, ai +1, …, an } is unordered;
and S4.3 and S4.2, performing insertion processing n-i times in total, and ordering the arrays.
The foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and the preferred embodiments of the present invention are described in the above embodiments and the description, and are not intended to limit the present invention. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (9)
1. A data processing system capable of priority deployment, comprising: the system comprises a file receiving unit (1), a data sorting unit (2), a two-way merging unit (3) and a file processing unit (4);
the file receiving unit (1) is used for identifying and receiving the transmitted file;
the data sorting unit (2) identifies the transmitted files and sorts the identified data respectively;
the two-way merging unit (3) performs secondary merging on the data respectively sorted by the data sorting unit (2) so as to enable the data to be sorted in an optimal level;
the file processing unit (4) calculates the data of the sequence discharged by the two-way merging unit (3) step by step;
the data sorting unit (2) comprises a data identification module (21), a data analog computation module (22), a data comparison module (23), a gradient sorting module (24), a data analysis module (25), a command receiving module (26), a positioning sorting module (27) and a transmission module (28);
the data identification module (21) is used for carrying out data identification on the files identified and transmitted by the file receiving unit (1) and respectively transmitting the identified data to the data quasi-computation module (22) and the data analysis module (25) by adopting a data link;
the data simulation calculation module (22) is used for classifying the data transmitted by the data identification module (21), and simulating and calculating the difficulty degree of each piece of data to finish calculation and the time required by the data;
the data comparison module (23) is used for receiving the data transmitted by the data calculation module (22) and comparing the data according to the difficulty degree of each piece of data and the required calculation time;
the gradual change sorting module (24) sorts the data compared by the data comparison module (23);
the command receiving module (26) is used for receiving a specified sorting command and transmitting the command to the data analysis module (25);
the data analysis module (25) is used for receiving the data transmitted by the datamation identification module (21) and the command receiving module (26), carrying out comparative analysis on the data transmitted by the datamation identification module (21) and the command receiving module (26), and after the comparative analysis of the data analysis module (25) is finished, transmitting the data comparatively analyzed by the data analysis module (25) to the positioning sorting module (27);
the positioning and sorting module (27) sorts the data transmitted by the data analysis module (25);
the transmission module (28) is used for receiving and transmitting the data sequenced by the gradual change sequencing module (24) and the positioning sequencing module (27);
the two-way merging unit (3) comprises a data integration module (31), a comparison sorting module (32), an optimal-level sorting module (33) and a sorting command transmission module (34);
the data integration module (31) is used for receiving the data transmitted by the transmission module (28) and matching the same data source of the transmitted data;
the comparison and sorting module (32) compares the matched data of the data integration module (31) and judges the priority level of the data source;
the optimal ranking module (33) performs optimal ranking on the data sources after the comparison is completed;
the sorting command transmission module (34) transmits the highest priority sequence list arranged by the highest priority sorting module (33) to the file processing unit (4), and the file processing unit (4) performs calculation processing on the data transmitted by the file transmission module (13) according to the highest priority sequence list transmitted by the sorting command transmission module (34).
2. The prioritizable data processing system according to claim 1, wherein: the gradual change sorting module (24) adopts a method of selecting sorting, and the idea of selecting sorting is as follows:
the direct selection sorting of the files of n records can obtain an ordered result through n-1 direct selection sorting:
s1, initial state: the disordered region is R1. n, and the ordered region is empty;
s2, sorting in the 1 st time, selecting the record R [ k ] with the smallest key word in the unordered region R [1.. n ], transferring the record R [ k ] into the ordered region, wherein the R [ k ] of the unordered region becomes the ordered region R [1], and the R [1] and the R [2.. n ] respectively become a new ordered region with 1 increased record number and a new unordered region with 1 decreased record number;
s3, repeating S2 until the ith time of sorting, when the ith time of sorting starts, the current ordered area and the unordered area are R1.. i-1 and R (i.. n) respectively, selecting the record R [ k ] with the smallest key word from the current unordered area, transferring the record R [ k ] to the last transferred R [ i-1] in the ordered area, and then, R [ k ] enters the ordered area to be changed into R (i), so that R [1.. i ] and R (i +1.. n) are changed into a new ordered area with 1 increased record number and a new unordered area with 1 decreased record number respectively.
3. The prioritizable data processing system according to claim 1, wherein: the sequencing method of the positioning sequencing module (27) is heap sequencing, the heap sequencing adopts a large-root heap sequencing algorithm, and the algorithm steps are as follows:
s1.1, building a pile: the heap building is a process of continuously adjusting the heap, and the adjustment is started from a len/2 position to a first node, wherein len is the number of elements in the heap;
s1.2, pile adjustment: comparing the node i with its child nodes left (i), right (i), selecting the largest (or smallest) of the three, if the largest (smallest) value is not the node i but one of its child nodes, interchanging the positions of the node i and the child node, and repeating the process;
s1.3, stacking and sorting: the heap sorting is carried out by utilizing the two processes, namely, firstly, building a heap according to elements, then taking out the root node of the heap, continuing the process of heap adjustment on the first len-1 nodes, then taking out the root node, and repeating the operations until all the nodes are taken out.
4. The prioritizable data processing system according to claim 1, wherein: the optimal level sorting module (33) adopts a two-way merging algorithm, and the algorithm steps are as follows:
inputting: an initial array A of n elements;
and (3) outputting: e-sorted arrays
；
S2.1, scanning the block A from left to right to obtain m ordered blocks;
s2.2, taking m ordered blocks as leaves, and calling MERGE algorithm generation for every two adjacent leaves
Merging the two paths of subtrees;
s2.3, for two adjacent
The two-path merging subtree recalls the MERGE algorithm to MERGE the two-path merging subtree into
Merging the two paths of subtrees;
s2.4, repeating S2.3 until all subtrees are merged into one two-way merged tree and the root of the merged tree is the solving result
。
5. The prioritizable data processing system according to claim 1, wherein: the file receiving unit (1) comprises a file identification module (11), a file storage module (12) and a file transmission module (13);
the file identification module (11) is used for identifying the transmitted data and acquiring the identified data after identification;
the file storage module (12) stores the data identified and collected by the file identification module (11);
the file transfer module (13) transfers the data which are stored by the file storage module (12) to the data identification module (21).
6. The prioritizable data processing system according to claim 1, wherein: the working principle of data connection of the data identification module (21) to the data analog computation module (22) and the data analysis module (25) is as follows:
s3.1, establishing a data link;
the master station sends an SNRM frame with a normal response mode to request the slave station to establish a data link, if the slave station and the master station have consistent information, a unnumbered confirmation UA frame is sent back to the master station, and the slave station and the master station are successfully connected;
wherein the SNRM frame functions as a data link requesting the establishment of a normal response signal;
s3.2, data frame transmission;
the master station sends a signal to the slave station, and the slave station sends a determination signal back to the master station after receiving the signal transmitted by the master station;
s3.3, releasing the data link;
and the master station sends a unnumbered link-breaking frame, the slave station receives the unnumbered link-breaking frame, breaks the link together with the master station, sends a unnumbered confirmation frame to the master station and returns the unnumbered confirmation frame to the master station, and at the moment, the data link is successfully released.
7. The prioritizable data processing system according to claim 1, wherein: the data sorting unit (2) further comprises a command input module (261) and a temporary storage module (29);
the command input module (261) is used for inputting commands and transmitting the input commands to the command receiving module (26);
the temporary storage module (29) is used for storing the data sequenced by the gradual change sequencing module (24) and the positioning sequencing module (27).
8. The prioritizable data processing system according to claim 1, wherein: the two-way merging unit (3) further comprises an insertion data transmission module (35), an insertion data comparison module (36) and an insertion data sequencing transmission module (37);
the inserting data transmission module (35) is used for inserting data which needs to be processed temporarily;
the inserted data comparison module (36) is used for receiving the data transmitted by the data integration module (31) and the inserted data transmission module (35) and comparing and sequencing the transmitted data;
the insertion data sorting transmission module (37) transmits the insertion data which completes the optimal level sorting.
9. The prioritizable data processing system of claim 8, wherein: the sequencing method in the insertion data comparison module (36) is an insertion sequencing method, and the algorithm steps are as follows:
s4.1, sorting is carried out from the ordered sequence and the unordered sequence { a2, a3, …, an };
s4.2, when processing the ith element (i =2,3, …, n), the sequence { a1, a2, …, ai-1} is ordered, and the sequence { ai, ai +1, …, an } is unordered;
and S4.3 and S4.2, performing insertion processing n-i times in total, and ordering the arrays.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110336870.6A CN112732433A (en) | 2021-03-30 | 2021-03-30 | Data processing system capable of carrying out priority allocation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110336870.6A CN112732433A (en) | 2021-03-30 | 2021-03-30 | Data processing system capable of carrying out priority allocation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112732433A true CN112732433A (en) | 2021-04-30 |
Family
ID=75595957
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110336870.6A Pending CN112732433A (en) | 2021-03-30 | 2021-03-30 | Data processing system capable of carrying out priority allocation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112732433A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116630794A (en) * | 2023-04-25 | 2023-08-22 | 北京卫星信息工程研究所 | Remote sensing image target detection method based on sorting sample selection and electronic equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101943734A (en) * | 2010-06-17 | 2011-01-12 | 深圳市科陆电子科技股份有限公司 | Method for automatically detecting terminals in batch based on IEC62056 protocol |
| CN106788663A (en) * | 2015-11-22 | 2017-05-31 | 上海航天卫星应用有限公司 | A kind of satellite modem of spectrum overlapping |
| CN108415760A (en) * | 2018-01-29 | 2018-08-17 | 东南大学 | A kind of online method for allocating tasks of gunz calculating based on mobile opportunistic network |
| CN109284823A (en) * | 2017-04-20 | 2019-01-29 | 上海寒武纪信息科技有限公司 | A kind of arithmetic unit and Related product |
| CN111783125A (en) * | 2020-07-08 | 2020-10-16 | 南京大成致远网络技术有限公司 | Cloud platform data dynamic configuration method for big data |
| CN111881092A (en) * | 2020-06-22 | 2020-11-03 | 武汉绿色网络信息服务有限责任公司 | Method and device for merging files based on cassandra database |
-
2021
- 2021-03-30 CN CN202110336870.6A patent/CN112732433A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101943734A (en) * | 2010-06-17 | 2011-01-12 | 深圳市科陆电子科技股份有限公司 | Method for automatically detecting terminals in batch based on IEC62056 protocol |
| CN106788663A (en) * | 2015-11-22 | 2017-05-31 | 上海航天卫星应用有限公司 | A kind of satellite modem of spectrum overlapping |
| CN109284823A (en) * | 2017-04-20 | 2019-01-29 | 上海寒武纪信息科技有限公司 | A kind of arithmetic unit and Related product |
| CN108415760A (en) * | 2018-01-29 | 2018-08-17 | 东南大学 | A kind of online method for allocating tasks of gunz calculating based on mobile opportunistic network |
| CN111881092A (en) * | 2020-06-22 | 2020-11-03 | 武汉绿色网络信息服务有限责任公司 | Method and device for merging files based on cassandra database |
| CN111783125A (en) * | 2020-07-08 | 2020-10-16 | 南京大成致远网络技术有限公司 | Cloud platform data dynamic configuration method for big data |
Non-Patent Citations (2)
| Title |
|---|
| 王昆仑，等主编，: "《数据结构与算法（第二版）2007年6月第1版》", 30 June 2007 * |
| 胡大威主编，: "《数据结构2013年1月第1版》", 31 January 2013 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116630794A (en) * | 2023-04-25 | 2023-08-22 | 北京卫星信息工程研究所 | Remote sensing image target detection method based on sorting sample selection and electronic equipment |
| CN116630794B (en) * | 2023-04-25 | 2024-02-06 | 北京卫星信息工程研究所 | Remote sensing image target detection method based on sorting sample selection and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hegeman et al. | Toward optimal bounds in the congested clique: Graph connectivity and MST | |
| CN109800936B (en) | Scheduling method based on tree search and electronic device using the same | |
| Lin et al. | Simulation-based optimization approach for simultaneous scheduling of vehicles and machines with processing time uncertainty in FMS | |
| CN113033800B (en) | Distributed deep learning method and device, parameter server and main working node | |
| CN112732433A (en) | Data processing system capable of carrying out priority allocation | |
| Grosfeld-Nir et al. | Multistage production to order with rework capability | |
| CN109819032B (en) | Cloud robot task allocation method considering base station selection and computing migration in combined manner | |
| US7991617B2 (en) | Optimum design management apparatus from response surface calculation and method thereof | |
| Bischof | Analysis of M/G/1-queues with setup times and vacations under six different service disciplines | |
| CA2225850C (en) | A method of and an apparatus for pre-selecting fingerprint cards | |
| CN111949411B (en) | Resource allocation method, device, computer equipment and computer readable storage medium | |
| CN112199407B (en) | Data packet ordering method, device, equipment and storage medium | |
| CN117114250B (en) | Intelligent decision-making system based on large model | |
| CN102075911B (en) | Cell locking method and device | |
| CN113254572A (en) | Electronic document classification supervision system based on cloud platform | |
| CN110232486B (en) | Multi-workshop comprehensive scheduling method based on K shortest path | |
| CN117176638A (en) | Routing path determining method and related components | |
| Jeng et al. | Petri net dynamics-based scheduling of flexible manufacturing systems with assembly | |
| CN107104829B (en) | Physical equipment matching distribution method and device based on network topology data | |
| WO2016122636A1 (en) | Updates to a prediction model using statistical analysis groups | |
| CN114595051A (en) | Method and system for enhancing cloud computing cooperation data processing and electronic equipment | |
| CN114358633A (en) | Task allocation method and device, computer equipment and storage medium | |
| CN109428906A (en) | Request processing method, device, system and terminal | |
| Han et al. | Opportunistic coded distributed computing: An evolutionary game approach | |
| US5892189A (en) | Apparatus and method for determining messages transmission period in an elevator group control system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210430 |
|
| RJ01 | Rejection of invention patent application after publication |