CN113986508A - Service flow network decomposition method, system, equipment and medium based on PN machine model - Google Patents
Service flow network decomposition method, system, equipment and medium based on PN machine model Download PDFInfo
- Publication number
- CN113986508A CN113986508A CN202111282943.4A CN202111282943A CN113986508A CN 113986508 A CN113986508 A CN 113986508A CN 202111282943 A CN202111282943 A CN 202111282943A CN 113986508 A CN113986508 A CN 113986508A
- Authority
- CN
- China
- Prior art keywords
- transition
- current
- current transition
- model
- service
- 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.)
- Granted
Links
- 238000000354 decomposition reaction Methods 0.000 title claims abstract description 58
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000007704 transition Effects 0.000 claims abstract description 301
- 238000012545 processing Methods 0.000 claims abstract description 59
- 238000003860 storage Methods 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 11
- 238000007781 pre-processing Methods 0.000 claims description 8
- 230000008878 coupling Effects 0.000 abstract description 2
- 238000010168 coupling process Methods 0.000 abstract description 2
- 238000005859 coupling reaction Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 4
- 230000006399 behavior Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000005094 computer simulation Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000001902 propagating effect Effects 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 241000282414 Homo sapiens Species 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 229910052802 copper Inorganic materials 0.000 description 1
- 239000010949 copper Substances 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a service flow network decomposition method, a system, equipment and a medium based on a PN machine model, wherein the decomposition method comprises the following steps: constructing a PN model of a service flow network, and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript representing a layer number and a pass number within each layer; and selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as an initial transition, taking the transition of the transition set of the non-decomposed subnets as a current transition, synchronously processing the front and the back of the current transition, and searching the correlation between the front and the back of the current transition to construct a service subnet for concurrent execution. The invention can decompose a complex large service processing network into a plurality of simple service subnetworks which can be executed concurrently, and reduces the coupling between the service processing subnetworks while improving the concurrency capability to the maximum extent.
Description
Technical Field
The invention belongs to the technical field of interconnection business processing, relates to a decomposition method and a decomposition system, and particularly relates to a business flow network decomposition method, a business flow network decomposition system, business flow network decomposition equipment and a business flow network decomposition medium based on a PN machine model.
Background
The information technology is an important driving force for the economic and social development in the world at present, promotes the transformation and optimization and upgrade of the global industrial structure, and brings about the deep change of the production and life style of human beings. The rapid development of new technologies such as communication, network and the like greatly expands the development space of the information service industry and brings new challenges. On one hand, as services become more complex, highly coupled service processing systems become more difficult to expand and maintain, and a service flow network needs to be decomposed to reduce the coupling of the systems. On the other hand, since the interconnection service is difficult to predict and has a short-time burst characteristic, which puts a high demand on the processing speed of the service system, it is necessary to deeply mine the concurrency in the service processing system, and improve the concurrency of the service processing by the service flow network decomposition to improve the processing speed of the system. However, the service flow network decomposition is a problem of complexity, an experience-based decomposition method is adopted in the current engineering, the decomposition effectiveness depends on the experience of developers to a great extent, and the effect is difficult to guarantee.
Therefore, how to provide a method, a system, a device and a medium for decomposing a traffic flow network based on a PN machine model to solve the defects that the effectiveness of decomposition in the prior art depends on the experience of developers to a great extent, the effect is difficult to guarantee, and the like, has become a technical problem to be solved by those skilled in the art.
Disclosure of Invention
In view of the above-mentioned shortcomings of the prior art, the present invention aims to provide a traffic flow network decomposition method, system, device and medium based on a PN machine model, so as to solve the problem that the effectiveness of the prior art decomposition depends on the experience of developers to a great extent and the effect is difficult to guarantee.
To achieve the above and other related objects, an aspect of the present invention provides a traffic flow network splitting method based on a PN machine model, including: constructing a PN model of a service flow network, and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript representing a layer number and a pass number within each layer; and selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as an initial transition, taking the transition of the transition set of the non-decomposed subnets as a current transition, synchronously processing the front and the back of the current transition, and searching the correlation between the front and the back of the current transition to construct a service subnet for concurrent execution.
In an embodiment of the present invention, the step of synchronously processing the pre-stage and the post-stage of the current transition, and searching for a correlation between the pre-stage and the post-stage of the current transition to construct a concurrently executed service subnet includes: judging whether the front state number and the rear state number of the current transition are equal and are in one-to-one correspondence; if yes, merging the current transition and the front and rear parts thereof into a current service subnet for distributing the current transition; if not, continuously judging whether the number of the front part and the number of the rear part of the current transition are the same; if yes, the step of merging the current transition and the front and rear parts of the current transition into a current service subnet for distributing the current transition is carried out; if not, continuously judging whether the number of the prepositions of the current transition is larger than the number of the postpositions; if so, processing the post-positioned number of the current transition, and constructing an unallocated service subnet; and if not, processing the preposed number of the current transition and constructing an unallocated service subnet.
In an embodiment of the present invention, the step of processing the post-number of the current transition comprises: and increasing the number of the postings of the current transition to make the number of the postings of the current transition consistent with the number of the prepositions.
In an embodiment of the present invention, the step of constructing the unallocated service subnet includes: splitting the current transition, allocating a pair of front and rear parts to each split transition, and putting the transition with the subscript of the layer number of the split transition consistent with the subscript of the layer number of the current transition into an unallocated service subnet; the split number of the current transition is the same as the post-increased number of the current transition.
In an embodiment of the present invention, the step of processing the number of prefixes of the current transition includes: and increasing the virtual number of the front position of the current transition to ensure that the number of the front position of the current transition is consistent with the number of the rear position.
In an embodiment of the present invention, the step of constructing the unallocated service subnet further includes: splitting the current transition, allocating a pair of front and rear parts to each split transition, and putting the transition with the subscript of the layer number of the split transition consistent with the subscript of the layer number of the current transition into an unallocated service subnet; the split number of the current transition is the same as the increase number of the current transition.
In an embodiment of the present invention, after the step of incorporating the current transition and its front and back into the current service subnet allocated for the current transition, the method for decomposing a service flow network based on a PN machine model further includes: judging whether the current service subnet is traversed and finished, if so, continuing to judge whether the transition set of the non-decomposed subnets is distributed with the service subnet; if yes, ending the service flow network decomposition; if not, returning to the step of selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as the initial transition and taking the transition of the transition set of the non-decomposed subnets as the current transition; and if the traversal is not finished, taking the subsequent transition of the current transition as the current transition, and switching to a step of synchronously processing the front part and the rear part of the current transition and searching the correlation between the front part and the rear part of the current transition so as to construct a service subnet which is executed concurrently.
Another aspect of the present invention provides a service flow network decomposition system based on a PN machine model, including: the pre-processing module is used for constructing a PN model of a service flow network and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript representing a layer number and a pass number within each layer; and the decomposition module is used for selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as an initial transition, taking the transition of the transition set of the non-decomposed subnets as a current transition, synchronously processing the front part and the rear part of the current transition, and searching the correlation between the front part and the rear part of the current transition to construct a service subnet which is executed concurrently.
Yet another aspect of the present invention provides a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the PN model-based traffic flow network splitting method.
In a final aspect, the present invention provides a service flow network decomposition device based on a PN machine model, including: a processor and a memory; the memory is used for storing a computer program, and the processor is used for executing the computer program stored by the memory so as to enable the equipment to execute the traffic flow network decomposition method based on the PN model.
As described above, the traffic flow network decomposing method, system, device and medium based on the PN machine model according to the present invention have the following beneficial effects:
firstly, the PN machine model of the network concurrent system is constructed through the method, and the behavior correlation relationship in the concurrent system is fully explored.
Secondly, the polynomial algorithm for judging the synchronous legal transmitting sequence of the stream network solves the high algorithm complexity (NP-complete problem) aiming at the judgment of the transmitting sequence of the general network.
Thirdly, the invention outputs the non-separable element-level sub-network, thereby realizing the concurrency decoupling of the complex service flow and improving the concurrency of the service system.
Drawings
Fig. 1A is a diagram showing an example of a PN model applied in the present invention.
Fig. 1B shows an exemplary diagram of a traffic subnet decomposed from the PN model of the present invention.
Fig. 2 is a flow chart illustrating a traffic network decomposing method based on a PN model according to an embodiment of the present invention.
Fig. 3 is a schematic flow chart illustrating an embodiment of S22 in the traffic network decomposing method based on the PN model according to the present invention.
Fig. 4 is a diagram illustrating an embodiment of S225 according to the present invention.
Fig. 5 is a schematic structural diagram of a traffic network decomposition system based on a PN model according to an embodiment of the present invention.
Description of the element reference numerals
Service flow network decomposition system based on PN machine model
51 preprocessing module
52 decomposition module
S21-S22
Steps S221 to S229
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It is to be noted that the features in the following embodiments and examples may be combined with each other without conflict.
It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention, and the components related to the present invention are only shown in the drawings rather than drawn according to the number, shape and size of the components in actual implementation, and the type, quantity and proportion of the components in actual implementation may be changed freely, and the layout of the components may be more complicated.
The technical principles of the method, the system, the equipment and the medium for decomposing the service flow network based on the PN machine model are as follows:
a PN model of the service flow network is constructed by utilizing the semantic relation among services, and the service flow network is decomposed by a polynomial algorithm for judging the flow network synchronous legal transmitting sequence of the PN model, so that the decomposed service processing network has the maximum concurrency capability.
Example one
The embodiment provides a service flow network decomposition method based on a PN machine model, which comprises the following steps:
constructing a PN model of a service flow network, and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript representing a layer number and a pass number within each layer;
and selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as an initial transition, taking the transition of the transition set of the non-decomposed subnets as a current transition, synchronously processing the front and the back of the current transition, and searching the correlation between the front and the back of the current transition to construct a service subnet for concurrent execution.
The PN model-based traffic flow network splitting method provided in the present embodiment will be described in detail below with reference to the drawings. The method for decomposing the traffic network based on the PN model according to this embodiment is used to synchronously decompose the traffic network based on the PN model shown in fig. 1A, and obtain a plurality of traffic subnets shown in fig. 1B. The decomposition method is the following decomposition steps (S21-S29)
Please refer to fig. 2, which is a flowchart illustrating a traffic network decomposition method based on a PN model in an embodiment. As shown in fig. 2, the method for decomposing a traffic network based on a PN machine model specifically includes the following steps:
s21, constructing a PN model of the service flow network, selecting the input transition of the PN model as T00Taking the PN model as an initial transition, traversing the whole PN model in a breadth-first mode, and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript indicating the layer number and the pass number within each layer.
In this embodiment, the PN model is constructed by using semantic relationships between services, by referring to methods such as PN system modeling and concurrent program modeling.
S22, selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as the initial transition, using the transition of the transition set of the non-decomposed subnets as the current transition, synchronously processing the front and the back of the current transition, and searching the correlation between the front and the back of the current transition to construct the concurrently executed service subnets.
Please refer to fig. 3, which shows a schematic flow chart of S22 in an embodiment. As shown in fig. 3, the S22 specifically includes the following steps:
s221, determining whether the numbers of the pre-state and the post-state of the current transition are equal (i.e. whether the number of input connections and the number of output connections of the current node in the PN map are equal), if yes, executing S222, and if no, executing S223.
S222, when the numbers of the front and rear states of the current transition are not equal and are not in one-to-one correspondence, continuously judging whether the numbers of the front and rear states of the current transition are the same or not, if so, executing S225; if not, S223 is executed. In this embodiment, because the service subnet can be split into several completely independent networks only if the transitions are consistent. Therefore, it is necessary to continue to determine whether the number of prefixes of the current transition is greater than the number of prefixes.
S223, when the number of the prepositions and the postpositions of the current transition is not equal, continuously judging whether the number of the prepositions of the current transition is larger than the number of the postpositions; if yes, go to S224. If not, go to S225.
S224, when the number of the prepositions of the current transition is larger than the number of the postitions, processing the number of the postitions of the current transition, and constructing an unallocated service subnet.
In this embodiment, the S224 includes:
and increasing the number of the postings of the current transition to make the number of the postings of the current transition consistent with the number of the prepositions.
In this embodiment, the step of constructing an unallocated service subnet after increasing the number of the postpositioned virtual nodes of the current transition includes:
splitting the current transition, allocating a pair of front and rear parts to each split transition, and putting the transition with the subscript of the layer number of the split transition consistent with the subscript of the layer number of the current transition into an unallocated service subnet; the split number of the current transition is the same as the post-increased number of the current transition, for example, if k post-positions are added virtually, the current transition is split into k transitions.
S225, when the number of the prepositions of the current transition is smaller than the number of the postpositions, processing the number of the prepositions of the current transition and constructing an unallocated service subnet.
In this embodiment, the S225 includes:
and increasing the virtual number of the front position of the current transition to ensure that the number of the front position of the current transition is consistent with the number of the rear position.
Please refer to fig. 4, which is a diagram illustrating an embodiment of S225. As shown in fig. 4, the previous number of the current transition is 1, which is smaller than the post number 2, and then the virtual number 1 needs to be added to the previous position of the current transition to make it consistent with the post number.
In this embodiment, the step of constructing an unallocated service subnet after increasing the number of the prepositioned virtual nodes of the current transition includes:
splitting the current transition, allocating a pair of front and rear parts to each split transition, and putting the transition with the subscript of the layer number of the split transition consistent with the subscript of the layer number of the current transition into an unallocated service subnet; the split number of the current transition is the same as the increase number of the current transition.
S226, merging the current transition and the front and rear parts thereof into the current service subnet distributed for the current transition, and marking the current service subnet as a SubPNt。
S227, determine whether the current service subnet has been traversed, if so, execute S228. If not, go to S230.
S228, judging whether the transition sets of the undecomposed subnets have all distributed service subnets; if yes, ending the service flow network decomposition; if not, returning to S21, namely returning to the step of selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as the initial transition and using the transition of the transition set of the non-decomposed subnets as the current transition.
And S229, if the traversal is not finished, taking the subsequent transition of the current transition as the current transition, and transferring to the step of synchronously processing the front and the back of the current transition, and searching the correlation between the front and the back of the current transition to construct a concurrently executed service subnet, namely returning to S221.
The traffic flow network decomposition method based on the PN machine model has the following beneficial effects:
firstly, a PN machine model of a network concurrent system is constructed, and a behavior correlation relation in the concurrent system is fully explored.
Secondly, the high algorithm complexity (NP-complete problem) aiming at the general network type transmitting sequence judgment is solved through a polynomial algorithm for judging the stream network synchronous legal transmitting sequence.
Thirdly, the non-separable element-level sub-network is output through the method, so that the concurrency decoupling of the complex service flow is realized, and the concurrency of the service system is improved.
The present embodiment also provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the method as described in fig. 2.
The present application may be embodied as systems, methods, and/or computer program products, in any combination of technical details. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied thereon for causing a processor to implement various aspects of the present application.
The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.
The computer-readable programs described herein may be downloaded from a computer-readable storage medium to a variety of computing/processing devices, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device. The computer program instructions for carrying out operations of the present application may be assembly instructions, Instruction Set Architecture (ISA) instructions, machine related instructions, microcode, firmware instructions, state setting data, integrated circuit configuration data, or source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + + or the like and procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, the electronic circuitry can execute computer-readable program instructions to implement aspects of the present application by utilizing state information of the computer-readable program instructions to personalize the electronic circuitry, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA).
Example two
The embodiment provides a service flow network decomposition system based on a PN machine model, which includes:
the pre-processing module is used for constructing a PN model of a service flow network and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript representing a layer number and a pass number within each layer;
and the decomposition module is used for selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as an initial transition, taking the transition of the transition set of the non-decomposed subnets as a current transition, synchronously processing the front part and the rear part of the current transition, and searching the correlation between the front part and the rear part of the current transition to construct a service subnet which is executed concurrently.
The PN model-based traffic flow network decomposition system provided in the present embodiment will be described in detail with reference to the drawings. Please refer to fig. 5, which is a schematic structural diagram of a traffic network decomposition system based on a PN model in an embodiment. As shown in fig. 5, the traffic flow network decomposition system 5 based on the PN model includes a preprocessing module 51 and a decomposition module 52.
The preprocessing module 51 is used for constructing a PN model of a traffic network, and selecting an input transition of the PN model as T00Taking the PN model as an initial transition, traversing the whole PN model in a breadth-first mode, and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a presentation layer number and a layer numberSubscript of the pass number.
In this embodiment, the preprocessing module 51 constructs the PN model by referring to a PN system modeling, a concurrent program modeling, and other methods using semantic relationships between services.
The decomposition module 52 selects the transition with the lowest index from the transition set of the non-decomposed subnets as an initial transition, and uses the transition of the transition set of the non-decomposed subnets as a current transition, and searches for the correlation between the front and the back of the current transition by synchronously processing the front and the back of the current transition, so as to construct a concurrently executed service subnet.
Specifically, the decomposition module 52 determines whether the numbers of the pre-positioned state and the post-positioned state of the current transition are equal and correspond to each other one by one; if yes, merging the current transition and the front and rear parts thereof into a current service subnet for distributing the current transition; if not, continuously judging whether the number of the front part and the number of the rear part of the current transition are the same; if yes, merging the current transition and the front and rear parts thereof into a current service subnet for distributing the current transition; if not, continuously judging whether the number of the prepositions of the current transition is larger than the number of the postpositions; if so, processing the post-positioned number of the current transition, and constructing an unallocated service subnet; and if not, processing the preposed number of the current transition and constructing an unallocated service subnet.
In this embodiment, the decomposition module 52 increases the number of the postambles of the current transition to make the number of the postambles of the current transition consistent with the number of the prepends, splits the current transition, allocates a pair of prepends and postambles to each split transition, and places the transition whose index of the layer number of the split transition is consistent with the index of the layer number of the current transition into an unallocated service subnet; the split number of the current transition is the same as the increased number of the current transition to process the post-positioned number of the current transition, an unallocated service subnet is constructed to process the post-positioned number of the current transition, and an unallocated service subnet is constructed
In this embodiment, the decomposition module 52 increases the number of the prefixes of the current transitions to be consistent with the number of the posters, splits the current transitions, allocates a pair of a prefix and a poster to each split transition, and places the transition whose layer number subscript of the split transition is consistent with the layer number subscript of the current transition into an unallocated service subnet; and processing the number of the prepositions of the current transition by the same split number of the current transition as the increased number of the prepositions of the current transition to construct an unallocated service subnet.
When the decomposition module 52 splits the current transition, a pair of front and back prefixes are allocated to each split transition, the transition with the layer number subscript of the split transition consistent with the layer number subscript of the current transition is placed into an unallocated service subnet, and then the current transition and the front and back prefixes are merged into the current service subnet allocated to the current transition, and the current service subnet is marked as a subPNt。
The decomposition module 52 is further configured to determine whether the current service subnet has been traversed, and if so, determine whether all the transition sets of the non-decomposed subnets have been allocated to the service subnet; if yes, ending the service flow network decomposition; if not, calling the preprocessing module 51 to select the transition with the minimum subscript from the transition set of the non-decomposed subnets as the initial transition, and taking the transition of the transition set of the non-decomposed subnets as the current transition. And if the traversal is not finished, taking the subsequent transition of the current transition as the current transition, continuously processing the front part and the rear part of the current transition synchronously, and searching the correlation between the front part and the rear part of the current transition to construct a service subnet for concurrent execution.
It should be noted that the division of the modules of the above system is only a logical division, and the actual implementation may be wholly or partially integrated into one physical entity, or may be physically separated. And the modules can be realized in a form that all software is called by the processing element, or in a form that all the modules are realized in a form that all the modules are called by the processing element, or in a form that part of the modules are called by the hardware. For example: the x module can be a separately established processing element, and can also be integrated in a certain chip of the system. In addition, the x-module may be stored in the memory of the system in the form of program codes, and may be called by one of the processing elements of the system to execute the functions of the x-module. Other modules are implemented similarly. All or part of the modules can be integrated together or can be independently realized. The processing element described herein may be an integrated circuit having signal processing capabilities. In implementation, each step of the above method or each module above may be implemented by an integrated logic circuit of hardware in a processor element or an instruction in the form of software. These above modules may be one or more integrated circuits configured to implement the above methods, such as: one or more Application Specific Integrated Circuits (ASICs), one or more microprocessors (DSPs), one or more Field Programmable Gate Arrays (FPGAs), and the like. When a module is implemented in the form of a Processing element scheduler code, the Processing element may be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of calling program code. These modules may be integrated together and implemented in the form of a System-on-a-chip (SOC).
EXAMPLE III
The embodiment provides a traffic flow network decomposition device based on a PN machine model, which includes: a processor, memory, transceiver, communication interface, or/and system bus; the processor and the transceiver are used for operating the computer program to enable the traffic flow network decomposition device based on the PN model to execute the steps of the traffic flow network decomposition method based on the PN model as described in the first embodiment.
The above-mentioned system bus may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The system bus may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus. The communication interface is used for realizing communication between the database access device and other equipment (such as a client, a read-write library and a read-only library). The Memory may include a Random Access Memory (RAM), and may further include a non-volatile Memory (non-volatile Memory), such as at least one disk Memory.
The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the Integrated Circuit may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, or discrete hardware components.
The protection scope of the traffic flow network decomposing method based on the PN machine model is not limited to the execution sequence of the steps listed in the embodiment, and all the schemes of adding, subtracting and replacing the steps in the prior art according to the principle of the present invention are included in the protection scope of the present invention.
The invention also provides a service flow network decomposition system based on the PN machine model, which can realize the service flow network decomposition method based on the PN machine model, but the implementation device of the service flow network decomposition method based on the PN machine model of the invention includes but is not limited to the structure of the service flow network decomposition system based on the PN machine model listed in this embodiment, and all the structural modifications and replacements in the prior art made according to the principle of the invention are included in the protection scope of the invention.
In summary, the method, system, device and medium for decomposing the traffic flow network based on the PN machine model according to the present invention have the following advantages:
firstly, the PN machine model of the network concurrent system is constructed through the method, and the behavior correlation relationship in the concurrent system is fully explored.
Secondly, the polynomial algorithm for judging the synchronous legal transmitting sequence of the stream network solves the high algorithm complexity (NP-complete problem) aiming at the judgment of the transmitting sequence of the general network.
Thirdly, the invention outputs the non-separable element-level sub-network, thereby realizing the concurrency decoupling of the complex service flow and improving the concurrency of the service system. The invention effectively overcomes various defects in the prior art and has high industrial utilization value.
The foregoing embodiments are merely illustrative of the principles and utilities of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or change the above-mentioned embodiments without departing from the spirit and scope of the present invention. Accordingly, it is intended that all equivalent modifications or changes which can be made by those skilled in the art without departing from the spirit and technical spirit of the present invention be covered by the claims of the present invention.
Claims (10)
1. A service flow network decomposition method based on a PN machine model is characterized by comprising the following steps:
constructing a PN model of a service flow network, and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript representing a layer number and a pass number within each layer;
and selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as an initial transition, taking the transition of the transition set of the non-decomposed subnets as a current transition, synchronously processing the front and the back of the current transition, and searching the correlation between the front and the back of the current transition to construct a service subnet for concurrent execution.
2. The PN machine model-based traffic flow network splitting method as claimed in claim 1, wherein the step of finding the correlation between the preamble and the postamble of the current transition by synchronously processing the preamble and the postamble of the current transition to construct the concurrently executing traffic subnets comprises:
judging whether the front state number and the rear state number of the current transition are equal and are in one-to-one correspondence; if yes, merging the current transition and the front and rear parts thereof into a current service subnet for distributing the current transition; if not, continuously judging whether the number of the front part and the number of the rear part of the current transition are the same; if yes, the step of merging the current transition and the front and rear parts of the current transition into a current service subnet for distributing the current transition is carried out; if not, continuously judging whether the number of the prepositions of the current transition is larger than the number of the postpositions; if so, processing the post-positioned number of the current transition, and constructing an unallocated service subnet; and if not, processing the preposed number of the current transition and constructing an unallocated service subnet.
3. The PN machine model-based traffic flow network splitting method of claim 2, wherein the step of processing the number of postings of the current transition comprises:
and increasing the number of the postings of the current transition to make the number of the postings of the current transition consistent with the number of the prepositions.
4. The PN machine model-based traffic flow network splitting method of claim 3, wherein the step of constructing unassigned traffic subnets comprises: splitting the current transition, allocating a pair of front and rear parts to each split transition, and putting the transition with the subscript of the layer number of the split transition consistent with the subscript of the layer number of the current transition into an unallocated service subnet; the split number of the current transition is the same as the post-increased number of the current transition.
5. The PN machine model-based traffic flow network splitting method of claim 2, wherein the step of processing the number of preambles of the current transition comprises:
and increasing the virtual number of the front position of the current transition to ensure that the number of the front position of the current transition is consistent with the number of the rear position.
6. The PN machine model-based traffic network splitting method of claim 5, wherein the step of constructing unassigned traffic subnets further comprises: splitting the current transition, allocating a pair of front and rear parts to each split transition, and putting the transition with the subscript of the layer number of the split transition consistent with the subscript of the layer number of the current transition into an unallocated service subnet; the split number of the current transition is the same as the increase number of the current transition.
7. The PN model-based traffic network decomposition method according to claim 1, wherein after the step of incorporating the current transition and its pre-and post-locations into the current traffic subnet for assignment to the current transition, the PN model-based traffic network decomposition method further comprises:
judging whether the current service subnet is traversed and finished, if so, continuing to judge whether the transition set of the non-decomposed subnets is distributed with the service subnet; if yes, ending the service flow network decomposition; if not, returning to the step of selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as the initial transition and taking the transition of the transition set of the non-decomposed subnets as the current transition; and if the traversal is not finished, taking the subsequent transition of the current transition as the current transition, and switching to a step of synchronously processing the front part and the rear part of the current transition and searching the correlation between the front part and the rear part of the current transition so as to construct a service subnet which is executed concurrently.
8. A traffic flow network decomposition system based on a PN machine model is characterized by comprising:
the pre-processing module is used for constructing a PN model of a service flow network and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript representing a layer number and a pass number within each layer;
and the decomposition module is used for selecting the transition with the minimum subscript from the transition set of the non-decomposed subnets as an initial transition, taking the transition of the transition set of the non-decomposed subnets as a current transition, synchronously processing the front part and the rear part of the current transition, and searching the correlation between the front part and the rear part of the current transition to construct a service subnet which is executed concurrently.
9. A computer-readable storage medium on which a computer program is stored, the program, when being executed by a processor, implementing the PN model-based traffic flow network splitting method according to any one of claims 1 to 7.
10. A traffic flow network decomposing device based on a PN machine model is characterized by comprising: a processor and a memory;
the memory is used for storing a computer program, and the processor is used for executing the computer program stored by the memory to make the device execute the PN machine model-based traffic flow network decomposition method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111282943.4A CN113986508B (en) | 2021-11-01 | 2021-11-01 | PN machine model-based service flow network decomposition method, system, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111282943.4A CN113986508B (en) | 2021-11-01 | 2021-11-01 | PN machine model-based service flow network decomposition method, system, equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113986508A true CN113986508A (en) | 2022-01-28 |
| CN113986508B CN113986508B (en) | 2024-06-18 |
Family
ID=79745357
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111282943.4A Active CN113986508B (en) | 2021-11-01 | 2021-11-01 | PN machine model-based service flow network decomposition method, system, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113986508B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040225999A1 (en) * | 2003-05-06 | 2004-11-11 | Andrew Nuss | Grammer for regular expressions |
| CN101776995A (en) * | 2010-01-04 | 2010-07-14 | 北京航空航天大学 | Self-adaptive combined service optimization method and device |
| CN106250240A (en) * | 2016-08-02 | 2016-12-21 | 北京科技大学 | A kind of optimizing and scheduling task method |
| CN110348693A (en) * | 2019-06-13 | 2019-10-18 | 南京理工大学 | The multirobot fast worktodo dispatching method calculated based on multicore |
| CN110673745A (en) * | 2019-08-30 | 2020-01-10 | 联想(北京)有限公司 | Information processing method, first electronic equipment and computer readable storage medium |
| CN112818692A (en) * | 2021-02-03 | 2021-05-18 | 招商银行股份有限公司 | Named entity recognition and processing method, device, equipment and readable storage medium |
| US20210232435A1 (en) * | 2019-11-26 | 2021-07-29 | Mythic, Inc. | Tile subsystem and method for automated data flow and data processing within an integrated circuit architecture |
| CN113342495A (en) * | 2021-06-24 | 2021-09-03 | 山东理工大学 | Cross-organization multi-instance subprocess model mining method and system |
-
2021
- 2021-11-01 CN CN202111282943.4A patent/CN113986508B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040225999A1 (en) * | 2003-05-06 | 2004-11-11 | Andrew Nuss | Grammer for regular expressions |
| CN101776995A (en) * | 2010-01-04 | 2010-07-14 | 北京航空航天大学 | Self-adaptive combined service optimization method and device |
| CN106250240A (en) * | 2016-08-02 | 2016-12-21 | 北京科技大学 | A kind of optimizing and scheduling task method |
| CN110348693A (en) * | 2019-06-13 | 2019-10-18 | 南京理工大学 | The multirobot fast worktodo dispatching method calculated based on multicore |
| CN110673745A (en) * | 2019-08-30 | 2020-01-10 | 联想(北京)有限公司 | Information processing method, first electronic equipment and computer readable storage medium |
| US20210232435A1 (en) * | 2019-11-26 | 2021-07-29 | Mythic, Inc. | Tile subsystem and method for automated data flow and data processing within an integrated circuit architecture |
| CN112818692A (en) * | 2021-02-03 | 2021-05-18 | 招商银行股份有限公司 | Named entity recognition and processing method, device, equipment and readable storage medium |
| CN113342495A (en) * | 2021-06-24 | 2021-09-03 | 山东理工大学 | Cross-organization multi-instance subprocess model mining method and system |
Non-Patent Citations (3)
| Title |
|---|
| SIKE: ""Petri网介绍"", Retrieved from the Internet <URL:《https://segmentfault.com/a/1190000005789014》> * |
| ZHIJUN ZHANG: ""Multiagent System-Based Integrated Design of Security Control and Economic Dispatch for Interconnected Microgrid Systems"", 《IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS: SYSTEMS》, vol. 51, no. 4, 22 July 2020 (2020-07-22), pages 2101 - 2112, XP011843839, DOI: 10.1109/TSMC.2020.2997794 * |
| 潘丽桦: ""基于Petri网的电商平台用户访问行为相似度分析及应用"", 《中国优秀硕士学位论文全文数据库 信息科技辑》, no. 2019, 15 February 2019 (2019-02-15), pages 138 - 7 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113986508B (en) | 2024-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20220019744A1 (en) | Multi-modal pre-training model acquisition method, electronic device and storage medium | |
| US10282664B2 (en) | Method and device for constructing event knowledge base | |
| EP3674914A1 (en) | Multi-party data joint query method, device, server and storage medium | |
| US20210209417A1 (en) | Method and apparatus for generating shared encoder | |
| EP3513306B1 (en) | N-way hash join | |
| CN102999608A (en) | System and method for tree table demonstration of large data | |
| EP3933769B1 (en) | Method and apparatus for image processing, computer storage medium and program | |
| CN105740405A (en) | Data storage method and device | |
| US20230239358A1 (en) | Method for fowarding data, device, storage medium and data transmission system | |
| CN114202027A (en) | Execution configuration information generation method, model training method and device | |
| CN109284450A (en) | Order is at the determination method and device of single path, storage medium, electronic equipment | |
| CN116360735A (en) | Form generation method, device, equipment and medium | |
| CN114356962A (en) | Data query method and device, electronic equipment and storage medium | |
| CN106940714A (en) | A kind of data processing method, device and electronic equipment | |
| US20200142990A1 (en) | Recording lineage in query optimization | |
| CN112988915A (en) | Data display method and device | |
| CN113986508A (en) | Service flow network decomposition method, system, equipment and medium based on PN machine model | |
| US20160314221A1 (en) | Augmenting the display of data in a tree format | |
| CN113691403A (en) | Topological node configuration method, related device and computer program product | |
| CN113297436B (en) | User policy distribution method and device based on relational graph network and electronic equipment | |
| US20220391529A1 (en) | Searching, matching, and masking of composite formats | |
| CN114579311A (en) | Method, apparatus, device and storage medium for executing distributed computing task | |
| JP2021120899A (en) | User identification method, device, storage medium, and electronic apparatus | |
| KR20220016933A (en) | Method and apparatus for ingesting data, device, storage medium and computer program stored in the medium | |
| CN113157934A (en) | Knowledge graph origin processing method and system, electronic device and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |