CN116184885A - Transaction processing method, system, electronic equipment and readable storage medium - Google Patents
Transaction processing method, system, electronic equipment and readable storage medium Download PDFInfo
- Publication number
- CN116184885A CN116184885A CN202211696960.7A CN202211696960A CN116184885A CN 116184885 A CN116184885 A CN 116184885A CN 202211696960 A CN202211696960 A CN 202211696960A CN 116184885 A CN116184885 A CN 116184885A
- Authority
- CN
- China
- Prior art keywords
- transaction
- polling
- request
- slave
- host
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 20
- 238000012545 processing Methods 0.000 claims abstract description 98
- 230000004044 response Effects 0.000 claims abstract description 41
- 238000000034 method Methods 0.000 claims description 82
- 230000008569 process Effects 0.000 claims description 34
- 238000004590 computer program Methods 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 14
- 238000010586 diagram Methods 0.000 description 11
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/04—Programme control other than numerical control, i.e. in sequence controllers or logic controllers
- G05B19/042—Programme control other than numerical control, i.e. in sequence controllers or logic controllers using digital processors
- G05B19/0423—Input/output
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/20—Pc systems
- G05B2219/25—Pc structure of the system
- G05B2219/25257—Microcontroller
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Automation & Control Theory (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention provides a transaction processing method, a system, electronic equipment and a readable storage medium, wherein the transaction processing method is applied to a host in a network topology, the network topology comprises a plurality of slaves, the host is respectively in communication connection with the slaves, after the host sequentially sends polling requests to the slaves according to a preset first polling sequence, the host acquires that a transaction pre-request of a transaction to be processed returned by at least one slave in the slaves according to the polling requests comprises a priority identifier, adjusts the current first polling sequence according to at least one priority identifier to obtain a new second polling sequence, and sequentially polls the corresponding slaves according to the second polling sequence and the transaction pre-request until all the slaves corresponding to the transaction pre-request finish the processing of the transaction to be processed. The priority identification of the slave machine is used for adjusting the polling sequence, and the master machine can timely respond to the key transaction of the slave machine at the key time point, so that the transaction delay of the slave machine is avoided, and the timeliness of the data response of the whole network topology is improved.
Description
Technical Field
The invention relates to a transaction processing method, a transaction processing system, electronic equipment and a readable storage medium, and belongs to the technical field of communication control.
Background
The Modbus protocol is a common language applied to electronic controllers and supports conventional RS232, RS422, RS485 and Ethernet devices. Many industrial devices, including PLCs, smart meters, etc. use the Modbus protocol as a communication standard, and control devices manufactured by different manufacturers using the Modbus protocol can be connected to an industrial network to perform centralized monitoring.
Conventional industrial network topologies generally adopt such a Modubs communication protocol, where the network topology includes a master and a plurality of slaves, and the master controls the plurality of slaves, and the master polls the plurality of slaves in sequence according to a preset polling sequence, that is, polls the slaves 1 to n in sequence. However, in an actual application scenario, when the host polls the slave according to a preset polling sequence, a key transaction of a certain slave at a key time point cannot be obtained in time, so that the host cannot timely perform transaction processing on the slave, and a transaction delay of the slave is caused.
Disclosure of Invention
In view of the above-mentioned shortcomings of the prior art, the present invention aims to provide a transaction processing method, a system, an electronic device and a readable storage medium, in which a polling sequence is adjusted by a priority identifier of a slave, the slave can timely respond to a key transaction at a key time point, so as to avoid transaction delay of the slave, and improve timeliness of data response of the whole network topology.
According to an embodiment of the present invention, there is provided a first aspect of: a transaction method applied to a host in a network topology, the network topology including a plurality of slaves, the host being communicatively connected to the plurality of slaves, respectively, the plurality of slaves being configured with a first polling order, the transaction method comprising: sequentially sending a polling request to a plurality of slaves according to the first polling sequence; acquiring a transaction pre-request of a to-be-processed transaction returned by at least one slave according to the polling request, wherein the transaction pre-request comprises a priority identification; adjusting the first polling sequence according to at least one priority identifier to obtain a second polling sequence of a plurality of slaves; and carrying out polling processing on at least one corresponding slave machine in turn according to the second polling sequence and the transaction pre-request until all the slave machines corresponding to the transaction pre-request complete the processing of the transaction to be processed.
Further, as a more preferred embodiment of the present invention, the polling process includes: acquiring a corresponding transaction request of the slave according to the transaction pre-request; and generating a corresponding request response according to the transaction request and returning to the corresponding slave machine so that the slave machine processes the transaction to be processed according to the request response.
Further, as a more preferred embodiment of the present invention, further comprising: after the former slave machine finishes the processing of the transaction to be processed, acquiring a transaction pre-request of the latter slave machine; adjusting the current polling sequence according to the priority mark of the transaction pre-request of the next slave machine to obtain a third polling sequence of a plurality of slave machines; and carrying out polling processing on the next slave according to the third polling sequence and the transaction pre-request of the next slave.
Further, as a more preferred embodiment of the present invention, the transaction pre-request further includes a duration identifier; the transaction processing method further comprises the following steps: and adjusting the current polling sequence to be a first polling sequence according to the duration identifications of all the transaction pre-requests.
Further, as a more preferred embodiment of the present invention, further comprising: detecting the current host state; and if the current host state is a busy state, generating a rejection response according to the transaction pre-request, and returning the rejection response to the slave corresponding to the transaction pre-request so that the slave does not process the transaction to be processed.
Further, as a more preferred embodiment of the present invention, further comprising: and if the current host state is an idle state, adjusting the first polling sequence according to at least one priority identifier to obtain the second polling sequence.
According to an embodiment of the present invention, a second aspect provided by the present invention is: acquiring a polling request sent by the host according to a first polling sequence; generating a transaction pre-request according to the polling request, wherein the transaction pre-request comprises a priority identification; sending the transaction pre-request to the host so that the host adjusts the first polling sequence to be a second polling sequence according to the priority identification; and after the host performs polling processing according to the second polling sequence and the transaction pre-request, processing the transaction to be processed.
According to an embodiment of the present invention, a third aspect provided by the present invention is: a transaction processing system, comprising:
the polling module is used for sending polling requests to the plurality of slaves according to the first polling sequence; the acquisition module is used for acquiring a transaction pre-request of a transaction to be processed, which is returned by at least one slave according to the polling request, wherein the transaction pre-request comprises a priority identifier; the adjustment module is used for adjusting the first polling sequence according to at least one priority identifier to obtain second polling sequences of a plurality of slaves; and the processing module is used for carrying out polling processing on at least one corresponding slave machine in turn according to the second polling sequence and the transaction pre-request until all the slave machines corresponding to the transaction pre-request complete the processing of the transaction to be processed.
According to an embodiment of the present invention, the fourth solution provided by the first solution or the second solution provided by the present invention is: an electronic device, comprising: at least one processor, and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions that are executed by the at least one processor to cause the at least one processor to implement the transaction method of the first aspect or the second aspect when the instructions are executed.
According to an embodiment of the present invention, a fifth aspect provided by the first aspect or the second aspect provided by the present invention is: a computer-readable storage medium storing computer-executable instructions for causing a computer to perform a transaction method according to the first or second aspect.
Compared with the prior art, after the host machine sequentially sends the polling request to the plurality of slaves according to the preset first polling sequence, the master machine acquires the transaction pre-request comprising priority identifiers of the transactions to be processed returned by at least one slave machine according to the polling request, adjusts the current first polling sequence according to the priority identifiers to obtain a new second polling sequence, and sequentially carries out polling processing on the corresponding slave machines according to the second polling sequence and the transaction pre-request until all the slaves corresponding to the transaction pre-request complete the processing of the transactions to be processed. The host computer can respond to the key transaction of the slave computer at the key time point in time by adjusting the polling sequence through the priority identification of the slave computer, thereby avoiding the transaction delay of the slave computer and improving the timeliness of the data response of the whole network topology.
Drawings
FIG. 1 is a diagram of an exemplary application of a first polling sequence in a transaction method according to the present invention;
FIG. 2 is a flow chart of a transaction method according to the present invention;
FIG. 3 is a flow chart of a transaction method according to the present invention;
FIG. 4 is a flow chart of step S180 of the transaction method according to the present invention;
FIG. 5 is a flowchart of a transaction method according to another embodiment of the present invention;
FIG. 6 is a diagram of a first example of an application of the transaction method of the present invention for adjusting the polling order;
FIG. 7 is a diagram illustrating a first embodiment of a transaction method according to the present invention;
FIG. 8 is a diagram showing a second example of the transaction processing method according to the present invention, in which the polling order is adjusted;
FIG. 9 is a diagram illustrating a second embodiment of a transaction method according to the present invention;
FIG. 10 is a diagram of a third exemplary application of the transaction method of the present invention for adjusting the polling order;
FIG. 11 is a diagram illustrating a third embodiment of a transaction method according to the present invention;
FIG. 12 is a diagram showing a fourth example of an application of the transaction processing method according to the present invention for adjusting the polling order;
FIG. 13 is a diagram illustrating a fourth exemplary implementation of the transaction method according to the present invention;
FIG. 14 is a schematic flow chart of a transaction method according to the present invention;
FIG. 15 is a schematic diagram of a module in a transaction system according to the present invention;
reference numerals:
a polling module 110, an acquisition module 120, an adjustment module 130, and a processing module 140.
Detailed Description
In order that those skilled in the art will better understand the technical solutions of the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that the logical order of illustration is depicted in a flowchart, but in some cases the steps shown or described may be performed in a different order in the flowchart. If "a number" is referred to, it means more than one, if "a plurality" is referred to, it means more than two, and if "a number" is referred to, it is understood that the number is included. The use of any and all examples, or exemplary language (e.g., "such as") provided herein, is intended merely to better illuminate embodiments of the application and does not pose a limitation on the scope of the application unless otherwise claimed.
It is noted that, unless otherwise indicated, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. Furthermore, unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used in the description herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The term "and/or" as used herein includes any combination of one or more of the associated listed items.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature.
The Modbus communication protocol is a serial communication protocol and is a common connection mode between industrial electronic devices. Conventional network topologies such as industrial communications generally employ such a Modubs communication protocol, where the network topology includes a master and a plurality of slaves, and the master controls the plurality of slaves, and the master sequentially polls the plurality of slaves according to a preset polling sequence, that is, polls according to the sequence from the slave 1 to the slave n. However, in an actual application scenario, when the host polls the slave according to a preset polling sequence, a key transaction of a certain slave at a key time point cannot be obtained in time, so that the host cannot timely perform transaction processing on the slave, and a transaction delay of the slave is caused.
Wherein Modbus communication is always initiated by a host, the slaves never transmit data when they do not receive a request from the host, the slaves do not communicate with each other, and the host initiates only one Modbus transaction at a time
As shown in fig. 1, a network topology is illustrated by taking a host and three slaves as an example, the host is respectively in communication connection with the slaves 1, 2 and 3, wherein the preset polling sequence is to poll the slaves 1, 2 and 3 in turn, and the polling is periodically performed, and when the slaves 1 to 3 are polled once, the next polling is periodically performed, namely, the slaves 1, 2 and 3 are polled again. Therefore, based on the polling sequence, if the slave 1 and the slave 2 need to be polled before the next polling when the key transaction of the slave 3 at the key time point is not polled in the previous polling, the key transaction of the slave 3 is polled, and the polling method easily causes delay processing of the transaction of the slave, and the transaction of the slave cannot be timely processed in time, so that the exception occurs to the transaction to be processed. Specifically, during the master polling process, the slave 1, the slave 2, and the slave 3 respond sequentially according to the master polling. When the host polls the slave 1, if the slave 1 has a transaction to be processed, the host responds to the transaction, and after the transaction processing of the slave 1 is completed, the slave 2 is polled, if the slave 2 does not have the transaction to be processed, the host does not need to respond, at this time, the host continues to poll the slave 3, if the slave 3 has the transaction to be processed, the host responds to the transaction, and if the slave does not have the transaction to be processed, the host polls the next cycle according to the original polling sequence.
Based on the method, the system, the electronic equipment and the readable storage medium, the host can adjust the polling sequence through the priority identification of the slave, and the host can timely respond to the key transaction of the slave at the key time point, so that the transaction delay of the slave is avoided, and the timeliness of the data response of the whole network topology is improved.
In a first aspect, the present invention provides a transaction processing method applied to a host in a network topology.
Specifically, the network topology includes a plurality of slaves, the master is communicatively connected to the plurality of slaves, and the plurality of slaves are configured with a first polling order in the network topology, wherein the first polling order refers to a roll call order adopted when the master polls the plurality of slaves, and for example, in fig. 1, the configured first polling order refers to roll call orders of the slaves 1, 2 and 3. The first polling sequence mentioned in the present invention is the polling sequence under the default initial condition in the network topology.
In some embodiments, after the host sequentially sends polling requests to the plurality of slaves according to a preset first polling sequence, the master obtains a transaction pre-request of a transaction to be processed returned by at least one slave of the plurality of slaves according to the polling requests, wherein the transaction pre-request comprises a priority identifier, adjusts the current first polling sequence according to the at least one priority identifier to obtain a new second polling sequence, and sequentially performs polling processing on the corresponding slaves according to the second polling sequence and the transaction pre-request until all the slaves corresponding to the transaction pre-request complete processing of the transaction to be processed. The host computer can respond to the key transaction of the slave computer at the key time point in time by adjusting the polling sequence through the priority identification of the slave computer, thereby avoiding the transaction delay of the slave computer and improving the timeliness of the data response of the whole network topology.
In some embodiments, referring to fig. 2, the transaction processing method applied to a host in a network topology in the present invention includes the steps of:
s120, sequentially sending polling requests to a plurality of slaves according to a first polling sequence;
s140, acquiring a transaction pre-request of a to-be-processed transaction returned by at least one slave according to the polling request, wherein the transaction pre-request comprises a priority identifier;
s160, adjusting the first polling sequence according to at least one priority identifier to obtain a second polling sequence of the plurality of slaves;
and S180, carrying out polling processing on at least one corresponding slave machine in turn according to the second polling sequence and the transaction pre-request until all the slave machines corresponding to the transaction pre-request complete the processing of the transaction to be processed.
In step S120, the host sequentially sends a polling request to a plurality of hosts in the network topology according to a first polling sequence, wherein the first polling sequence is a polling sequence in a default initial state in the network topology, and the host sequentially sends the polling request to the plurality of hosts according to the polling sequence; the sequential sending of the polling requests means that the polling requests are sent to each slave machine one by one, namely, the master machine firstly sends the polling requests to a certain slave machine, and when a certain slave machine is confirmed to answer or does not answer, the next polling request is sent to the next slave machine continuously; the polling request is protocol message data sent by the host to poll the slave, the polling request can enable the slave to be polled by the host at the current moment, at the moment, the slave can respond or does not respond, namely the slave informs the host that the transaction to be processed needs to be processed, otherwise, the slave does not need to inform the host that the transaction to be processed does not exist at the current moment.
In step S140, after the master sends polling requests to the plurality of slaves according to the first polling sequence, a transaction pre-request of a transaction to be processed returned by at least one slave according to the polling requests is obtained, where the transaction pre-request includes a priority identifier. The transaction to be processed refers to a key transaction which occurs at a key time point of the slave machine, such as a change of a state parameter of the slave machine, a read-write transaction of a switching value or a register of the slave machine, a device fault information transaction of the slave machine, an upgrade request of the slave machine and other transaction needing update processing; the transaction pre-request is a protocol message returned to the host by the slave, and the slave can inform the host of the need of processing the transaction to be processed at a specific time point in advance through the transaction pre-request, and inform the host of preparing for transaction response processing in advance; the priority identifier refers to the priority of the transaction to be processed, and determines the emergency degree of the transaction to be processed according to the priority identifier so as to inform the host whether the transaction to be processed needs to be processed with priority.
In some embodiments, referring to fig. 3, the transaction processing method provided by the present invention further includes the steps of:
s151, detecting the current host state;
And S152, if the current host state is a busy state, generating a rejection response according to the transaction pre-request, and returning the rejection response to the slave corresponding to the transaction pre-request so that the slave does not process the transaction to be processed.
In step S151 to step S152, the host detects the current host state, determines whether the current host state is busy or idle, and executes step S152 if the current host state is busy, and executes step S160 if the current host state is idle. When step S152 is executed, the master determines that the polling process cannot be performed on other slaves, generates a rejection response according to the acquired transaction pre-request of the slave, and returns the rejection response to the corresponding slave, so as to inform the slave that the transaction to be processed cannot be processed temporarily and that the transaction to be processed needs to be put aside temporarily. The current host state refers to whether the host polls a certain slave or not at the current time point or the time point related to the transaction to be processed of the slave, namely whether a certain slave in the current network topology processes the transaction to be processed or not; the busy state means that the host polls a certain slave and the host is currently occupied by the certain slave; the idle state is that the host does not poll any slave, and the host is not occupied by any slave at present; the reject response is a response that the host informs the slave that the transaction to be processed is currently unable to be processed. By detecting the current host state, whether the current host state is a busy state or an idle state is determined, so that corresponding steps are executed to ensure that the host only performs polling processing on one host at the same time point, thereby avoiding the polling processing conflict of a plurality of hosts, reducing the occurrence of abnormality of the transaction to be processed of each slave and reducing the resource occupation of the host.
In step S160, the master adjusts the current first polling sequence according to the obtained at least one priority identifier, so as to obtain a second polling sequence of the plurality of slaves. Specifically, the master determines the priority order of each slave according to the obtained priority identifier, and adjusts the polling orders of the slaves according to the priority order, so as to obtain an adjusted polling order, namely a second polling order, wherein the second polling order is the polling order to be performed in the next period of the master.
In step S180, after the second polling sequence is obtained by the host, polling processing is sequentially performed on at least one slave according to the second polling sequence and the transaction pre-request corresponding to the slave until all the acquired slaves corresponding to the transaction pre-request complete the processing of the transaction to be processed. Specifically, the host machine performs polling processing on a slave machine with higher priority corresponding to the transaction pre-request according to the adjusted second polling sequence, and after the transaction to be processed of one slave machine is processed, the host machine performs polling processing on the next slave machine with the next priority being only inferior to that of the previous slave machine, so that the slave machines corresponding to all the transaction pre-requests are subjected to polling processing one by one until the transaction to be processed of all the slave machines is completed.
Specifically, in step S180, the host performs polling processing on all the slaves in the network topology that need to process the transaction to be processed one by one according to the second polling sequence, and after the polling processing of the previous host is completed, the host performs polling processing on the next host according to the transaction pre-request of the next host, and sequentially processes until all the slaves in the network topology complete the transaction to be processed.
In some embodiments, with respect to the polling process mentioned in step S180, referring to fig. 4, the steps are specifically further included:
s181, acquiring a corresponding transaction request of the slave according to the transaction pre-request;
s182, generating a corresponding request response according to the transaction request and returning to the corresponding slave machine so that the slave machine processes the transaction to be processed according to the request response.
Specifically, the host computer obtains the transaction request initiated by the slave computer according to the obtained transaction pre-request of the slave computer in the polling process performed by the second polling sequence, generates a corresponding request response according to the transaction request, and returns the corresponding request response to the corresponding slave computer, so that the slave computer can process the transaction to be processed according to the request response. Wherein the transaction request is a request that the slave needs to process the transaction to be processed when the slave is at a key time point, and the host is informed of the transaction request so that the host makes an arbitration; the request response is a protocol message returned to the slave after the host makes an arbitration, and the request response may be a response informing the slave that the transaction to be processed can be processed. After the slave returns the transaction request to the host, the host arbitrates according to the transaction request, and decides whether the slave can process the transaction to be processed or not; if the slave determines that the processing is available, a request response capable of being processed is returned to the slave, and after the slave receives the request response capable of being processed, the slave can process the transaction to be processed.
In some embodiments, referring to fig. 5, the transaction processing method provided by the present invention specifically further includes the steps of:
s183, after the previous slave machine finishes the processing of the transaction to be processed, acquiring a transaction pre-request of the next slave machine;
s184, adjusting the current polling sequence according to the priority mark of the transaction pre-request of the next slave machine to obtain a third polling sequence of a plurality of slave machines;
s185, carrying out polling processing on the next slave according to the third polling sequence and the transaction pre-request of the next slave.
In step S183 to step S184, after the previous slave in the network topology completes the processing of the transaction to be processed, the master obtains the priority identifier of the transaction pre-request of the next master according to the current polling sequence, for example, the second polling sequence, adjusts the current polling sequence (for example, the second polling sequence) according to the newly obtained priority identifier, obtains the adjusted third polling sequence of the plurality of slaves, and performs the polling processing on the next slave according to the third polling sequence and the transaction pre-request corresponding to the next slave, that is, performs step S181 and step S182.
Specifically, the host performs polling processing on the slave with the highest priority according to the current polling sequence, so that after the host finishes processing the transaction to be processed, the host polls the next slave with the highest priority only, thereby obtaining a transaction pre-request of the next slave, and adjusts the current polling sequence according to the priority identification of the transaction pre-request of the next slave, thereby obtaining a plurality of slave-adjusted polling sequences, namely a third polling sequence, wherein the third polling sequence defines a polling sequence different from the first polling sequence or the second polling sequence, and after the polling sequence is adjusted, the host performs polling processing on the next slave according to the third polling sequence and the transaction request of the next slave, namely step S181 and step S182 are executed.
In short, the host only carries out polling processing on the slave with the highest priority according to the current polling sequence, and when the polling sequence is completed, the slave with the lower priority continues to be polled according to the current polling sequence, so that transaction pre-requests of other slaves are obtained, namely, other slaves are determined to need to process the transaction to be processed, at the moment, the current polling sequence is readjusted according to the obtained transaction pre-requests to obtain a new polling sequence, at the moment, the priority of the slave needing to process the transaction to be processed is adjusted to be the highest, and in the polling of the next period, the slave is subjected to the polling processing preferentially, so that the polling nesting of the network topology is realized.
In some embodiments, the transaction pre-request further includes a duration identifier, and correspondingly, the transaction processing method provided by the invention further includes: and adjusting the current polling sequence to be a first polling sequence according to the duration identifications of all the transaction pre-requests.
Specifically, the duration identifier is the processing time required by the slave to the transaction to be processed, and the master can confirm the transaction which is required to be spent by the slave corresponding to the transaction pre-request in the subsequent processing of the transaction to be processed through the duration identifier, so that the state of the master is determined to be a busy state in the time period. The master can confirm that the other slaves are not subjected to polling processing in the time through the duration identifier of the single slave, and only the slaves corresponding to the duration identifier are subjected to polling processing, when the duration corresponding to the duration identifier is reached, the master can confirm that the slaves have completed processing the transaction to be processed, at the moment, the slaves can carry out polling processing on the next slaves, and so on until all the slaves are subjected to polling processing, and then the current polling sequence (such as the second polling sequence) is restored to the initial first polling sequence. The host computer may also execute steps S183 to S185, and after the polling processing on the last slave computer is completed, the current polling sequence is adjusted back to the first polling sequence, where the current polling sequence is determined according to the slave computer that needs to perform the transaction to be processed, and may be the second polling sequence, the third polling sequence, or other polling sequences, etc., mainly referring to the adjusted polling sequence. After returning to the first polling sequence, the master will poll the slaves again according to the first polling sequence, and execute steps S120 to S180 again.
In a possible implementation application example, referring to fig. 1, 6 and 7, the network topology includes one master and three slaves (slave 1, slave 2, slave 3), and the case where the slave 2 needs to process the transaction to be processed is described. In the initial state, the master polls the slave 1, the slave 2, and the slave 3 in the first polling order (slave 1-slave 2-slave 3) in this order. The host sends a polling request 1 to the slave 1, the slave does not respond, then the host sends a polling request 2 to the slave 2, the slave 2 generates a transaction pre-request 2 according to the received polling request 2 and the transaction 2 to be processed and returns the transaction pre-request 2 to the host, the host continues to send a polling request 3 to the slave 3 after receiving the transaction pre-request 2 of the slave 2, and after the slave 3 does not respond, the host detects the current host state to ensure that whether other slaves conflict with the time point of the transaction 2 to be processed corresponding to the slave 2 in the polling of the previous period, thereby occupying the processing resource of the host, and if the current host state is busy state, generating a reject response 2 to the slave 2 to inform the slave 2 that the transaction 2 to be processed is not processed temporarily. If the current host state is the idle state, the host will adjust the first polling sequence to the second polling sequence (slave 2-slave 1-slave 3, or slave 2-slave 3-slave 1, as long as the priority of slave 2 is guaranteed to be the highest) according to the priority identifier 2 of the transaction pre-request 2. After the host adjusts to the second polling sequence, the slave 2 performs polling processing according to the second polling sequence and the transaction pre-request 2, the slave 2 performs transaction processing on the transaction 2 to be processed, when the host can determine the transaction required by the slave 2 to process the transaction 2 to be processed through the duration identifier 2, the host restores the second polling sequence to the first polling sequence after reaching the corresponding time.
In a possible implementation application example, referring to fig. 1, 8 and 9, the network topology includes one master and three slaves (slave 1, slave 2, slave 3), and the case where the slaves 2 and 3 need to process the transaction to be processed is described. The host sends a polling request 1 to the slave 1, the slave does not respond, then the host sends a polling request 2 to the slave 2, the slave 2 generates a transaction pre-request 2 according to the received polling request 2 and the transaction 2 to be processed and returns the transaction pre-request 2 to the host, the host continues to send a polling request 3 to the slave 3 after receiving the transaction pre-request 2 of the slave 2, and the slave 3 generates a transaction pre-request 3 according to the received polling request 3 and the transaction 3 to be processed and returns the transaction pre-request 3 to the host 3. The master detects the current state of the master, and ensures that whether other slaves conflict with the time point of the transaction 2 to be processed corresponding to the slave 2 and/or the transaction 3 to be processed corresponding to the slave 3 in the polling in the previous period, so that the processing resource of the master is occupied, and if the current state of the master is busy, a rejection response 2 is generated for the slave 2 and/or a rejection response 3 is generated for the slave 3, so that the slave 2 is informed of not processing the transaction 2 temporarily and/or the slave 3 does not process the transaction 3 temporarily. If the host is unoccupied, i.e., the current host state is idle, the host compares the priority level of priority id 2 of transaction pre-request 2 with the priority level of priority id 3 of transaction pre-request 3. If the priority of the priority identifier 3 is greater than the priority of the priority identifier 2, the first polling order is adjusted to the second polling order (slave 3-slave 2-slave 1). After the host adjusts to the second polling sequence, the slave 3 performs polling processing according to the second polling sequence and the transaction pre-request 3, the slave 3 performs transaction processing on the transaction 3, when the host can determine the time required by the slave 3 to process the transaction 3 to be processed through the duration identifier 3, after the corresponding time 3 is reached, the slave 2 performs polling processing according to the transaction pre-request 2, the slave 2 performs transaction processing on the transaction 2 to be processed, when the host can determine the time required by the slave 2 to process the transaction 2 to be processed through the duration identifier 2, and after the corresponding time 2 is reached, the second polling sequence is restored to the first polling sequence.
In a possible implementation application example, referring to fig. 1, 10 and 11, the network topology includes one master and three slaves (slave 1, slave 2, slave 3), and the case where the slaves 2 and 3 need to process the transaction to be processed is described. The host sends a polling request 1 to the slave 1, the slave does not respond, then the host sends a polling request 2 to the slave 2, and the slave 2 generates a transaction pre-request 2 according to the received polling request 2 and the transaction 2 to be processed and returns the transaction pre-request 2 to the host. After receiving the transaction pre-request 2 of the slave 2, the master detects the current state of the master, and ensures that whether other slaves conflict with the time point of the transaction 2 to be processed corresponding to the slave 2 in the previous period of polling, if the master is occupied, that is, the current state of the master is a busy state, a rejection response 2 is generated for the slave 2, so as to inform the slave 2 that the transaction 2 to be processed is not processed temporarily. And if the current host state is the idle state, the first polling sequence is adjusted to be the second polling sequence (the slave 2-the slave 3-the slave 1) according to the priority identifier 2. After the host adjusts to the second polling sequence, the slave 2 performs polling processing according to the second polling sequence and the transaction pre-request 2, the slave 2 performs transaction processing on the transaction 2 to be processed, when the host can determine the time required by the slave 2 to process the transaction 2 to be processed through the duration identifier 2, after the corresponding time 2 is reached, the slave 1 and the slave 3 are sent to the polling request again according to the second polling sequence, wherein the slave 1 does not respond because no transaction to be processed is required, and the slave 3 returns the transaction pre-request 3 to the host in response. At this time, the host adjusts the second polling order to the third polling order (slave 3-slave 1-slave 2) according to the priority identification 3 of the transaction pre-request 3. After the host adjusts to the third polling sequence, the slave 3 performs polling processing according to the third polling sequence and the transaction pre-request 3, the slave 3 performs transaction processing on the transaction 3 to be processed, when the host can determine the time required by the slave 3 to process the transaction 3 to be processed through the duration identifier 3, after the corresponding time 3 is reached, the third polling sequence is restored to the first polling sequence, and at the moment, all the slaves in the network topology complete the transaction processing.
In a possible implementation application example, referring to fig. 1, 12 and 13, the network topology includes one master and three slaves (slave 1, slave 2, slave 3), and the case where the slaves 2 and 3 need to process the transaction to be processed is described. The host sends a polling request 1 to the slave 1, the slave does not respond, then the host sends a polling request 2 to the slave 2, the slave 2 generates a transaction pre-request 2 according to the received polling request 2 and the transaction 2 to be processed and returns the transaction pre-request 2 to the host, the host continues to send a polling request 3 to the slave 3 after receiving the transaction pre-request 2 of the slave 2, and the slave 3 generates a transaction pre-request 3 according to the received polling request 3 and the transaction 3 to be processed and returns the transaction pre-request 3 to the host 3. The master machine compares the priority of the priority mark 2 of the transaction pre-request 2 with the priority mark 3 of the transaction pre-request 3, if the priority mark 2 is larger than the priority mark 3, the master machine returns a rejection response 3 to the slave machine 3, and if the priority mark 2 is smaller than the priority mark 3, the master machine returns a rejection response 2 to the slave machine 2. The invention is illustrated with priority label 3 being greater than priority label 2. The master detects the current state of the master, and ensures that whether other slaves conflict with the time point of the transaction 3 to be processed corresponding to the slave 3 in the polling in the previous period, so that the processing resource of the master is occupied, if so, the current state of the master is a busy state, a rejection response 3 is generated for the slave 3, and the slave 3 is informed of not processing the transaction 3 temporarily. If the current host state is idle, the host will adjust the first polling sequence to the second polling sequence (slave 3-slave 2-slave 1) according to the priority identifier 3 and the priority identifier 2 of the transaction pre-request 3. After the host adjusts to the second polling sequence, the slave 3 performs polling processing according to the second polling sequence and the transaction pre-request 3, the slave 3 performs transaction processing on the transaction 3, when the host can determine the time required by the slave 3 to process the transaction 3 to be processed through the duration identifier 3, after the corresponding time 3 is reached, the slave 2 performs polling processing according to the transaction pre-request 2, the slave 2 performs transaction processing on the transaction 2 to be processed, when the host can determine the time required by the slave 2 to process the transaction 2 to be processed through the duration identifier 2, and after the corresponding time 2 is reached, the second polling sequence is restored to the first polling sequence.
The invention provides a transaction processing method, which is applied to a host in network topology, wherein the network topology comprises a plurality of slaves, the host is respectively in communication connection with the slaves, after the host sequentially sends polling requests to the slaves according to a preset first polling sequence, the transaction pre-request of the transaction to be processed returned by at least one slave in the slaves according to the polling requests comprises a priority identifier, the current first polling sequence is adjusted according to at least one priority identifier, a new second polling sequence is obtained, and the corresponding slaves are sequentially subjected to polling processing according to the second polling sequence and the transaction pre-request until all the slaves corresponding to the transaction pre-request complete the processing of the transaction to be processed. The priority identification of the slave machine is used for adjusting the polling sequence, and the master machine can timely respond to the key transaction of the slave machine at the key time point, so that the transaction delay of the slave machine is avoided, and the timeliness of the data response of the whole network topology is improved.
In a second aspect, the present invention provides a transaction processing method applied to a slave in a network topology.
In some embodiments, referring to fig. 14, the transaction processing method applied to the slave according to the present invention includes the steps of:
S220, acquiring a polling request sent by a host according to a first polling sequence;
s240, generating a transaction pre-request according to the polling request, wherein the transaction pre-request comprises a priority identification;
and S260, sending the transaction pre-request to the host computer so that the host computer adjusts the first polling sequence to be the second polling sequence according to the priority identification.
S280, after the host performs polling processing according to the second polling sequence and the transaction pre-request, the transaction to be processed is processed.
In steps S220 to S280, the slave obtains a polling request sent by the host according to a preconfigured first polling sequence, so as to confirm that the slave is polled by the host, at this time, the slave may return a transaction pre-request generated according to the transaction to be processed and the polling request, where the transaction pre-request includes a priority identifier to inform the host that the transaction to be processed needs to be processed at a critical time point, and informs the host of the importance level of the transaction to be processed through the priority identifier. After receiving the transaction pre-request, the host adjusts the first polling sequence according to the priority identifier to obtain a second polling sequence, wherein in the second polling sequence, the slave is the polling sequence with the highest priority, and when the host polls according to the second polling sequence and the transaction pre-request, the slave can start to process the transaction to be processed.
It should be noted that, the slave in the second scheme provided by the present invention is any slave among a plurality of slaves in the network topology in the first scheme, and can be understood by referring to specific steps in the first scheme, and redundant description is not made in the present scheme.
The invention provides a transaction processing method which is applied to one slave machine in a plurality of slave machines in a network topology, wherein the network topology further comprises a host machine, the host machine is in communication connection with the slave machines, after the slave machines acquire polling requests sent by the host machine according to a first polling sequence, the slave machines generate transaction pre-requests according to the polling requests, the transaction pre-requests comprise priority identifiers, the transaction pre-requests are sent to the host machine, the host machine can adjust the first polling sequence to be a second polling sequence according to the priority identifiers, and when the host machine performs polling processing on the slave machines according to the second polling sequence and the transaction pre-requests, the transaction to be processed can be processed. The priority identification of the slave machine is used for adjusting the polling sequence, and the master machine can timely respond to the key transaction of the slave machine at the key time point, so that the transaction delay of the slave machine is avoided, and the timeliness of the data response of the whole network topology is improved.
In a third aspect, the present invention provides a transaction processing system for performing the transaction processing method mentioned in the first aspect embodiment.
In some embodiments, referring to FIG. 15, a block diagram of a transaction system in accordance with the present invention is shown. The method specifically comprises the following steps: a polling module 110, an acquisition module 120, an adjustment module 130, and a processing module 140.
The polling module 110 is configured to send a polling request to the plurality of slaves according to the first polling sequence;
the acquisition module 120 is used for acquiring a transaction pre-request of the transaction to be processed, which is returned by at least one slave according to the polling request, wherein the transaction pre-request comprises a priority identifier;
the adjusting module 130 is configured to adjust the first polling sequence according to at least one priority identifier, so as to obtain a second polling sequence of the plurality of slaves;
and the processing module 140 is used for carrying out polling processing on at least one corresponding slave machine in turn according to the second polling sequence and the transaction pre-request until all the slave machines corresponding to the transaction pre-request complete the processing of the transaction to be processed.
It should be noted that, the specific functions and descriptions of the polling module 110, the obtaining module 120, the adjusting module 130, and the processing module 140 in the present invention are described in detail in the first embodiment, so they are not described herein.
In the present invention, after the polling module 110 sequentially sends polling requests to the plurality of slaves according to a preset first polling sequence, the obtaining module 120 obtains that the transaction pre-request of the transaction to be processed returned by at least one slave of the plurality of slaves according to the polling requests includes a priority identifier, the adjusting module 130 adjusts the current first polling sequence according to at least one priority identifier to obtain a new second polling sequence, and the processing module 140 sequentially performs polling processing on the corresponding slaves according to the second polling sequence and the transaction pre-request until all slaves corresponding to the transaction pre-request complete the processing of the transaction to be processed. The priority identification of the slave machine is used for adjusting the polling sequence, and the master machine can timely respond to the key transaction of the slave machine at the key time point, so that the transaction delay of the slave machine is avoided, and the timeliness of the data response of the whole network topology is improved.
The fourth aspect of the present invention further provides an electronic device, including: at least one processor, and a memory communicatively coupled to the at least one processor;
wherein the processor is configured to execute the transaction method applied to the embedded device 100 in the first embodiment or the transaction method applied to the external storage medium 300 in the second embodiment by calling the computer program stored in the memory.
The memory, as a non-transitory computer readable storage medium, may be used to store a non-transitory software program as well as a non-transitory computer executable program, such as the transaction method applied to the embedded device 100 in the first aspect embodiment of the present invention or the transaction method applied to the external storage medium 300 in the second aspect embodiment of the present invention. The processor implements the transaction method applied to the embedded device 100 in the above-described first embodiment or the transaction method applied to the external storage medium 300 in the second embodiment by running a non-transitory software program and instructions stored in a memory.
The memory may include a memory program area and a memory data area, wherein the memory program area may store an operating system, at least one application program required for a function; the storage data area may store a transaction method applied to the embedded device 100 in the first embodiment or a transaction method applied to the external storage medium 300 in the second embodiment described above. In addition, the memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory remotely located relative to the processor, the remote memory being connectable to the terminal through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The non-transitory software programs and instructions required to implement the transaction method applied to the embedded device 100 in the first aspect embodiment or the transaction method applied to the external storage medium 300 in the second aspect embodiment described above are stored in the memory, and when executed by the one or more processors, the transaction method applied to the embedded device 100 in the first aspect embodiment described above or the transaction method applied to the external storage medium 300 in the second aspect embodiment is performed.
In a fifth aspect, the present invention also provides a computer-readable storage medium storing computer-executable instructions for: executing the transaction method applied to the embedded device 100 in the first embodiment or the transaction method applied to the external storage medium 300 in the second embodiment;
in some embodiments, the computer-readable storage medium stores computer-executable instructions that are executed by one or more control processors, for example, by one processor in the electronic device of the third embodiment, which may cause the one or more processors to perform the transaction method applied to the embedded device 100 in the first embodiment or the transaction method applied to the external storage medium 300 in the second embodiment.
The above described embodiments of the apparatus are only illustrative, wherein the units described as separate components may or may not be physically separate, i.e. may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
Those of ordinary skill in the art will appreciate that all or some of the steps, systems, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein. In the description of the present specification, descriptions with reference to the terms "some embodiments," "examples," "specific examples," or "some examples," etc., mean that a particular feature or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples.
Claims (10)
1. A transaction method, applied to a host in a network topology, the network topology including a plurality of slaves, the host being communicatively coupled to a plurality of the slaves, respectively, the plurality of the slaves being configured with a first polling order, the transaction method comprising:
Sequentially sending a polling request to a plurality of slaves according to the first polling sequence;
acquiring a transaction pre-request of a to-be-processed transaction returned by at least one slave according to the polling request, wherein the transaction pre-request comprises a priority identification;
adjusting the first polling sequence according to at least one priority identifier to obtain a second polling sequence of a plurality of slaves;
and carrying out polling processing on at least one corresponding slave machine in turn according to the second polling sequence and the transaction pre-request until all the slave machines corresponding to the transaction pre-request complete the processing of the transaction to be processed.
2. The transaction method according to claim 1, wherein the polling process comprises:
acquiring a corresponding transaction request of the slave according to the transaction pre-request;
and generating a corresponding request response according to the transaction request and returning to the corresponding slave machine so that the slave machine processes the transaction to be processed according to the request response.
3. The transaction method according to claim 2, further comprising:
after the former slave machine finishes the processing of the transaction to be processed, acquiring a transaction pre-request of the latter slave machine;
Adjusting the current polling sequence according to the priority mark of the transaction pre-request of the next slave machine to obtain a third polling sequence of a plurality of slave machines;
and carrying out polling processing on the next slave according to the third polling sequence and the transaction pre-request of the next slave.
4. A transaction method according to any of claims 1 to 3, wherein the transaction pre-request further comprises a duration identifier; the transaction processing method further comprises the following steps:
and adjusting the current polling sequence to be a first polling sequence according to the duration identifications of all the transaction pre-requests.
5. The transaction method according to claim 1, further comprising:
detecting the current host state;
and if the current host state is a busy state, generating a rejection response according to the transaction pre-request, and returning the rejection response to the slave corresponding to the transaction pre-request so that the slave does not process the transaction to be processed.
6. The transaction method of claim 5, further comprising:
and if the current host state is an idle state, adjusting the first polling sequence according to at least one priority identifier to obtain the second polling sequence.
7. A transaction method, applied to one of a plurality of slaves in a network topology, the network topology further comprising a master communicatively coupled to the slaves, the transaction method comprising:
acquiring a polling request sent by the host according to a first polling sequence;
generating a transaction pre-request according to the polling request, wherein the transaction pre-request comprises a priority identification;
sending the transaction pre-request to the host so that the host adjusts the first polling sequence to be a second polling sequence according to the priority identification;
and after the host performs polling processing according to the second polling sequence and the transaction pre-request, processing the transaction to be processed.
8. A transaction processing system, comprising:
the polling module is used for sending polling requests to the plurality of slaves according to the first polling sequence;
the acquisition module is used for acquiring a transaction pre-request of a transaction to be processed, which is returned by at least one slave according to the polling request, wherein the transaction pre-request comprises a priority identifier;
the adjustment module is used for adjusting the first polling sequence according to at least one priority identifier to obtain second polling sequences of a plurality of slaves;
And the processing module is used for carrying out polling processing on at least one corresponding slave machine in turn according to the second polling sequence and the transaction pre-request until all the slave machines corresponding to the transaction pre-request complete the processing of the transaction to be processed.
9. An electronic device, comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing when executing the program:
a transaction method as claimed in any one of claims 1 to 7.
10. A computer-readable storage medium storing computer-executable instructions for causing a computer to perform:
a transaction method as claimed in any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211696960.7A CN116184885A (en) | 2022-12-28 | 2022-12-28 | Transaction processing method, system, electronic equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211696960.7A CN116184885A (en) | 2022-12-28 | 2022-12-28 | Transaction processing method, system, electronic equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116184885A true CN116184885A (en) | 2023-05-30 |
Family
ID=86443505
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211696960.7A Pending CN116184885A (en) | 2022-12-28 | 2022-12-28 | Transaction processing method, system, electronic equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116184885A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118642416A (en) * | 2024-08-14 | 2024-09-13 | 德力西集团仪器仪表有限公司 | Control method, device, equipment and storage medium of slave load switch |
-
2022
- 2022-12-28 CN CN202211696960.7A patent/CN116184885A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118642416A (en) * | 2024-08-14 | 2024-09-13 | 德力西集团仪器仪表有限公司 | Control method, device, equipment and storage medium of slave load switch |
| CN118642416B (en) * | 2024-08-14 | 2024-11-01 | 德力西集团仪器仪表有限公司 | Control method, device, equipment and storage medium of slave load switch |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11080404B2 (en) | Firmware upgrade method, slave station of robot, and machine readable storage medium | |
| EP2771939B1 (en) | Distributed batterry management system and method of identification distribution using the same | |
| CN110287135B (en) | Bus polling method and device | |
| CN108445788A (en) | A kind of hotel's scenery control method and relevant apparatus | |
| CN116184885A (en) | Transaction processing method, system, electronic equipment and readable storage medium | |
| CN111836312A (en) | Resource reservation method and equipment based on competition | |
| JP6200734B2 (en) | Communication control device | |
| CN110805991A (en) | Method and device for synchronizing states of control terminal and central air conditioner | |
| CN109634902B (en) | Data transmission method, device and system suitable for PCIE bus | |
| CN118199782B (en) | Ethernet message time-sharing scheduling method, system, storage medium and intelligent device | |
| CN112929251B (en) | CAN-based slave station data refreshing method, device and system | |
| CN114285695A (en) | Communication method, device, equipment, system and storage medium | |
| CN111083016B (en) | Polling table processing method and device, storage medium and equipment | |
| CN110913416B (en) | Terminal, networking method thereof and computer-readable storage medium | |
| CN107147552A (en) | The method and apparatus that letter reading is returned in a kind of remote control | |
| CN111010286A (en) | Intelligent registration method and device based on serial bus, electronic equipment and medium | |
| CN114087727B (en) | Wireless pairing method, device and system, upper and lower computer nodes and air conditioning unit | |
| CN107968718A (en) | A kind of method, apparatus and equipment for confirming standby usage state | |
| CN117118951A (en) | Method for dynamically distributing addresses of universal slaves of one master and multiple slaves bus | |
| EP4207637A1 (en) | Time synchronization method and apparatus, device, and storage medium | |
| JP2002152232A (en) | Communication terminal accommodation device and communication terminal accommodation method | |
| CN110677356B (en) | Bus communication method, communication basic period determining method and device | |
| CN105893288A (en) | Dma controller | |
| EP2831799B1 (en) | Data network device discovery optimization to reduce data transfer volume | |
| CN112261512A (en) | Master station remote control method, device, storage medium and equipment of unbalanced polling protocol |
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 |