CN107528798B - RS485 bus system-based optimal scheduling method - Google Patents
RS485 bus system-based optimal scheduling method Download PDFInfo
- Publication number
- CN107528798B CN107528798B CN201610473621.0A CN201610473621A CN107528798B CN 107528798 B CN107528798 B CN 107528798B CN 201610473621 A CN201610473621 A CN 201610473621A CN 107528798 B CN107528798 B CN 107528798B
- Authority
- CN
- China
- Prior art keywords
- priority
- node
- node unit
- upper computer
- data transmission
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 230000005540 biological transmission Effects 0.000 claims description 47
- 108010076504 Protein Sorting Signals Proteins 0.000 claims description 7
- 238000004891 communication Methods 0.000 abstract description 16
- 238000001514 detection method Methods 0.000 abstract description 4
- 238000012545 processing Methods 0.000 abstract description 3
- 230000007547 defect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000005457 optimization Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/821—Prioritising resource allocation or reservation requests
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Bus Control (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention provides an optimized scheduling method based on an RS485 bus system, wherein a detection system is connected with an upper computer and a plurality of node units through an RS485 bus and a control signal line, the upper computer adopts a DSP, the node units adopt a PLC, and the system can realize distributed control. The system provides a scheduling method for updating the priority of the node unit by a dynamic competition strategy aiming at the difference of the communication emergency degrees of the nodes, automatically adjusts the priority of the occupied bus and reasonably distributes the time of the occupied bus. The system can exert the advantages of rapid processing of a large amount of data of the upper computer and high reliability of the node unit, and has the characteristic of simple debugging.
Description
Technical Field
The invention relates to an optimized scheduling method based on an RS485 bus system.
Background
RS485 is taken as a serial communication standard, adopts a balanced drive and differential receiving mode to drive the bus, and has the advantages of long communication distance, high transmission speed, good noise interference resistance and the like. Since RS485 is applicable to multi-station interconnection, one transmitter can connect a plurality of load devices, and has been widely used in various fields. The communication modes of the RS485 network are divided into 2 types of master-slave mode and bus mode. A slave RS485 communication network is easy to build on a bus communication protocol, has good expansibility and universality, and generally adopts a master-slave communication mode in industrial control. However, in the multi-station connection, the problem of node communication blockage often occurs, and therefore, it is necessary to design an efficient and stable optimal scheduling method for the RS485 bus system.
At present, research is already carried out on optimization of an RS485 bus system, and a control method based on an RS485 distributed bus system (application number CN201510625106.5) disclosed by Chinese invention patent utilizes bus idleness to carry out data interaction. The invention patent of 'a polling communication method based on RS 485' (application number: CN201510302444.5) communicates by a query method, and the methods have the defects of insufficient consideration on emergency information and priority transmission on data needing emergency processing. Aiming at the defects of the prior art, the invention provides a novel optimal scheduling method based on an RS485 bus system, which considers the emergency degree of information transmission and realizes the information communication of a master-slave system.
Disclosure of Invention
In view of the above disadvantages of the prior art, the present invention provides an optimized scheduling method based on an RS485 bus system, the system is composed of an upper computer and a plurality of node units, the upper computer and each node unit are connected through an RS485 bus and a control signal line, the control signal line includes a request sending signal, a priority signal and a chip selection signal, the optimized scheduling method is characterized in that the optimized scheduling method includes the following steps:
1) setting data transmission priority according to the real-time requirement of data;
2) the upper computer selects the node units sequentially through the chip selection signal according to tasks to be completed by each node unit, transmits corresponding initialization parameters through the RS485 bus, and initializes each node unit;
3) the upper computer sends a task starting command to each node unit to enable each node unit to work, and after each node unit finishes a task, a data transmission request signal and a priority signal are sent to the upper computer;
4) the upper computer inquires the data transmission request signal and the priority signal of each node unit and determines the priority level of each node unit for sending data to the upper computer;
5) the upper computer selects the node unit corresponding to the highest priority determined in the step 4), receives and processes the data;
6) the upper computer inquires the data transmission request signal and the priority signal of each node unit again, and updates the priority of the node units by adopting a dynamic competition strategy;
7) and the upper computer selects the node units to transmit data according to the new priority, processes the data and returns to the step 6) until all the node units complete the tasks.
And 6) updating the priority of the node units by adopting a dynamic competition strategy, and distributing priority codes to each node unit, wherein the priority codes comprise node unit priority sections and competition code sections, the node unit priority sections are obtained by priority signals sent by the node units, and the priority signals sent by the node units are determined according to the preset data transmission priority. The contention code section includes a contention number code section and a node unit request signal order code section. The priority coding specifically comprises the following steps:
a. the upper computer sequentially inquires whether each node unit has a data transmission request signal or not in a first round, sets the competition times code segments of each node unit with the data transmission request signal to be 1, and sequentially numbers the request signal sequence code segments to obtain competition code segments;
b. reading a priority signal of a node unit with a data transmission request signal to obtain a node unit priority section, and combining the node unit priority section with the competition code section to obtain a node unit priority code;
c. and selecting the node unit with the highest priority code, transmitting data, and requesting to send a signal clear by the corresponding node unit. Then, the upper computer carries out second round of inquiry on uncoded node units in sequence, sets competition times code segments with data transmission request signal node units in the second round of inquiry to be 1, sequentially numbers the request signal sequence code segments, sets competition times code segments of the node units which are coded in the first round but are not processed to be 2, and combines the node unit priority segments with the competition code segments to obtain node unit priority codes;
d. and selecting the node unit with the highest priority code, transmitting data, and requesting to send a signal clear by the corresponding node unit. Then, three rounds of inquiry are carried out, and by analogy, the code segment of the competition times of the unprocessed node units after each round of inquiry is added with 1 until the data transmission request signals sent by all the node units are processed;
preferably, the RS485 bus system-based optimal scheduling method is characterized in that: when the competition times of the node unit exceed 2 times of the node unit, the priority section of the node unit is adjusted, and the node unit is processed preferentially.
By adopting the optimized scheduling method, each node unit can transmit detection data to an upper computer according to different priorities, so that the occurrence of dead cycle of a bus system can be avoided, the communication resources of the bus system are fully utilized, and meanwhile, the method can also preferentially process the data needing emergency transmission. In addition, under the condition that the waiting times of the data are too long, the priority of the node unit can be adjusted, the flexibility of the system is increased, and the system is more reliable. The system adopts the RS485 bus for communication connection and also has the advantage of simple debugging.
Drawings
Fig. 1 is a block diagram of an embodiment of an optimized scheduling method based on an RS485 bus system.
Fig. 2 is a flowchart of the optimal scheduling method based on the RS485 bus system of the present invention.
FIG. 3 is a priority coding diagram of a node unit according to the present invention.
FIG. 4 is a priority coding diagram of a node unit according to an embodiment of the present invention.
Detailed Description
The embodiments of the present invention are described below with specific examples, and those skilled in the art can easily implement the embodiments disclosed in the present specification.
As shown in fig. 1, the present invention is based on an RS485 bus system, which includes: the system comprises an upper computer 1 and a plurality of node units 2, wherein the node units 2 are connected with the upper computer through RS485 buses and control signal lines, and the control signal lines are connected with a request sending signal, a priority signal and a chip selection signal. Each node unit requests to send signals and is connected with an upper computer through one port, and the low level is effective. The priority of each node unit is connected with an upper computer through a port, the low level indicates that data transmission is urgent, the high level indicates that the data transmission is not urgent, and whether the data is urgent or not is determined according to the preset data transmission priority. The chip selection signal is used by the upper computer to select the node unit, enable the node unit to transmit data, and is effective in low level. The upper computer 1 can perform initialization setting on each node unit 2 and receive data fed back by each node unit 2.
The host computer can adopt the DSP treater, links to each other with the 485 bus behind the external MAX485 chip, and node unit 2 can adopt PLC, and PLC's free end can the lug connection RS485 bus, and is very convenient, and the system can exert the ability of DSP rapid processing a large amount of data and the advantage of PLC high stability like this. The detection system can be additionally provided with node units according to actual needs. The system adopts the RS485 bus for communication connection and also has the advantage of simple debugging.
In the system, the upper computer 1 and the node units 2 are in communication connection through an RS485 bus, and only one node unit can transmit data at a time. As the time for sending the data transmission request signal by the node unit 2 is different, in order to ensure that each node unit can obtain the bus use right and the condition of dead cycle during bus arbitration does not occur, as shown in fig. 2, the invention discloses an optimized scheduling method based on an RS485 bus system, which comprises the following steps:
1) setting data transmission priority according to the real-time requirement of data;
2) the upper computer selects the node units sequentially through the chip selection signal according to tasks to be completed by each node unit, transmits corresponding initialization parameters through the RS485 bus, and initializes each node unit;
3) the upper computer sends a task starting command to each node unit to enable each node unit to work, and after each node unit finishes a task, a data transmission request signal and a priority signal are sent to the upper computer;
4) the upper computer inquires the data transmission request signal and the priority signal of each node unit and determines the priority level of each node unit for sending data to the upper computer;
5) the upper computer selects the node unit corresponding to the highest priority determined in the step 4), receives and processes the data;
6) the upper computer inquires the data transmission request signal and the priority signal of each node unit again, and updates the priority of the node units by adopting a dynamic competition strategy;
7) and the upper computer selects the node units to transmit data according to the new priority, processes the data and returns to the step 6) until all the node units complete the tasks.
And 6) updating the priority of the node units by adopting a dynamic competition strategy, and distributing priority codes to each node unit, wherein the priority codes comprise node unit priority sections and competition code sections, the node unit priority sections are obtained by priority signals sent by the node units, and the priority signals sent by the node units are determined according to the preset data transmission priority. The contention code section includes a contention number code section and a node unit request signal order code section. The length of each segment of the priority coding can be adjusted according to actual conditions. The priority coding specifically comprises the following steps:
first, the upper computer sequentially performs a first round of query on whether each node unit has a data transmission request signal, sets 1 to each contention frequency code segment having the data transmission request signal node unit, as shown in fig. 3, sets 1 to the contention frequency code segment B3B2B1B0, and sequentially numbers the request signal sequence code segments C3C2C1C0 according to the query sequence to obtain contention code segments.
Next, the priority signal of the node unit having the data transmission request signal is read to obtain a node unit priority segment A1a0, as shown in fig. 3, where the urgent request transmission signal is denoted by 11 and the no urgent request signal is denoted by 00, and the node unit priority segment and the contention code segment are combined to obtain a node unit priority code.
Then, the node unit with the highest priority code is selected to transmit data, and the corresponding node unit requests to send a signal clear. Then, the upper computer carries out second round query on uncoded node units in sequence, sets 1 to each competition frequency code segment B3B2B1B0 with a data transmission request signal node unit in the second round query, numbers C3C2C1C0 to the request signal sequence code segments in sequence, sets 2 to the competition frequency code segment of the node unit which is coded but unprocessed in the first round, and combines the node unit priority segment with the competition code segments to obtain the node unit priority code. The larger the encoding, the higher the priority.
And finally, selecting the node unit with the highest priority code, transmitting data, and requesting to send a signal clear by the corresponding node unit. And then, performing three rounds of inquiry, and so on, and adding 1 to the code segment of the competition times of the unprocessed node units after each round of inquiry until the data transmission request signals sent by all the node units are processed. When the competition times of the node unit exceed 2 times of the node unit, the priority section of the node unit is adjusted, and the node unit is processed preferentially.
To further understand the above-mentioned optimized scheduling method for priority, the following is further described according to a specific embodiment: suppose that the upper computer 1 is connected with 4 node units 2 in the system. As shown in FIG. 4, the node unit priority section of the priority code has two bits A1A0, and the contention code section includes a contention number code section B3B2B1B0 and a node unit request signal order code section C3C2C1C 0.
When the first round of inquiry is carried out, the upper computer inquires according to the sequence of the node units No. 1, No. 2, No. 3 and No. 4, inquires that the node units No. 1 and No. 3 have data transmission request signals, then inquires the priority signals of the node units No. 1 and No. 3, inquires that the priority signal of the node unit No. 3 is at a low level, the priority signal of the node unit No. 1 is at a high level, at the moment, the priority code of the node unit No. 1 is 0000010001, and the priority code of the node unit No. 3 is 1100010002. Because the priority code of the node unit No. 3 is greater than that of the node unit No. 1, the upper computer selects the node unit No. 3 through the chip selection signal, transmits the data of the node unit No. 3, simultaneously clears the data request signal of the node unit No. 3, and deletes the priority code of the node unit No. 3.
When the second round of inquiry is carried out, the upper computer inquires according to the sequence of the node units No. 2, No. 3 and No. 4, a data transmission request signal exists in the node units No. 2 and No. 3, then the priority signals of the node units No. 2 and No. 3 are inquired, the priority signal of the node unit No. 3 is checked to be in a low level, the priority signal of the node unit No. 1 is checked to be in a high level, at the moment, the priority code of the node unit No. 2 is 0000010001, the priority code of the node unit No. 3 is 1100010002, and the priority code of the node unit No. 1 is 0000100002. Because the priority code of the node unit No. 3 is greater than the priority codes of the node unit No. 1 and the node unit No. 2, the upper computer selects the node unit No. 3 through the chip selection signal and transmits the data of the node unit No. 3, meanwhile, the data request signal of the node unit No. 3 is eliminated, and the priority code of the node unit No. 3 is deleted.
When the third round of inquiry is carried out, the upper computer inquires according to the sequence of the node units No. 3 and No. 4, the data transmission request signals of the node units No. 3 and No. 4 are inquired, then the priority signals of the node units No. 2 and No. 3 are inquired, the priority signals of the node units No. 3 and No. 4 are both high level, at the moment, the priority code of the node unit No. 3 is 0000010001, the priority code of the node unit No. 4 is 000002, the priority code of the node unit No. 1 is 0000110002, and the priority code of the node unit No. 2 is 0000100002. Because the priority code of the No. 1 node unit is the largest in the priority codes of the 4 node units, the upper computer selects the No. 1 node unit through the chip selection signal and transmits the data of the No. 1 node unit, meanwhile, the data request signal of the No. 1 node unit is eliminated, and the priority code of the No. 1 node unit is deleted.
And by parity of reasoning, the priority coding is executed circularly until all communication tasks are finished. Assuming that the number of contention of node unit No. 1 is greater than 8 (in this example, 4 nodes, so 2 × 4=8 is taken), the priority section can be directly modified to 10, which not only raises the priority of node unit No. 1, but also does not interfere with the requirement of emergency data transmission.
In conclusion, by adopting the priority scheduling optimization method, each node unit can transmit detection data to an upper computer according to different priorities, so that the occurrence of dead cycle of a bus system can be avoided, the communication resource of the bus system is fully utilized, meanwhile, the data transmission emergency degree of the node units is considered, the priority is improved according to the waiting times, the flexibility of the system is improved, the bus occupation time is reasonably distributed, the real-time performance of the system is improved, and the system is more reliable. The invention effectively overcomes various defects in the prior art and has high industrial utilization value.
Claims (2)
1. An optimized scheduling method based on an RS485 bus system is composed of an upper computer and a plurality of node units, wherein the upper computer is connected with each node unit through an RS485 bus and a control signal line, and the control signal comprises a data transmission request signal, a priority signal and a chip selection signal, and is characterized by comprising the following steps:
1) setting data transmission priority according to the real-time requirement of data;
2) the upper computer selects the node units sequentially through the chip selection signal according to tasks to be completed by each node unit, transmits corresponding initialization parameters through the RS485 bus, and initializes each node unit;
3) the upper computer sends a task starting command to each node unit to enable each node unit to work, and after each node unit finishes a task, a data transmission request signal and a priority signal are sent to the upper computer;
4) the upper computer inquires the data transmission request signal and the priority signal of each node unit and determines the priority level of each node unit for sending data to the upper computer;
5) the upper computer selects the node unit corresponding to the highest priority determined in the step 4), receives and processes the data;
6) the upper computer inquires the data transmission request signal and the priority signal of each node unit again, and updates the priority of the node units by adopting a dynamic competition strategy;
7) the upper computer selects the node units to transmit data according to the new priority, processes the data and returns to the step 6) until all the node units complete the tasks;
step 6) adopting a dynamic competition strategy to update the priority of the node units, and distributing priority codes to each node unit, wherein the priority codes comprise node unit priority sections and competition code sections, the node unit priority sections are obtained by priority signals sent by the node units, and the priority signals sent by the node units are determined according to the preset data transmission priority;
the competition code segment comprises a competition times code segment and a node unit request signal sequence code segment;
the priority coding specifically comprises the following steps:
a. the upper computer sequentially inquires whether each node unit has a data transmission request signal or not, sets the competition times code segments of the node units with the data transmission request signals to be 1, and sequentially numbers the request signal sequence code segments to obtain competition code segments;
b. reading a priority signal of a node unit with a data transmission request signal to obtain a node unit priority section, and combining the node unit priority section with the competition code section to obtain a node unit priority code;
c. selecting a node unit with the highest priority coding, transmitting data, clearing a data transmission request signal of the corresponding node unit, sequentially performing second round query on uncoded node units by an upper computer, setting competition frequency code segments of the node units with the data transmission request signals in the second round query to be 1, sequentially numbering request signal sequence code segments, setting competition frequency code segments of the node units which are coded in the first round but are not processed to be 2, and combining the node unit priority segments and the competition code segments to obtain node unit priority codes;
d. and selecting the node unit with the highest priority code, transmitting data, clearing the data transmission request signal of the corresponding node unit, then performing three rounds of inquiry, and so on, and adding 1 to the code segment of the competition times of the unprocessed node units after each round of inquiry until the data transmission request signals sent by all the node units are processed.
2. The RS485 bus system-based optimal scheduling method of claim 1, wherein: when the competition times of the node units exceed 2 times of the total number of the node units, the priority sections of the node units are adjusted, and the node units are processed preferentially.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610473621.0A CN107528798B (en) | 2016-06-22 | 2016-06-22 | RS485 bus system-based optimal scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610473621.0A CN107528798B (en) | 2016-06-22 | 2016-06-22 | RS485 bus system-based optimal scheduling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107528798A CN107528798A (en) | 2017-12-29 |
| CN107528798B true CN107528798B (en) | 2020-09-08 |
Family
ID=60735590
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610473621.0A Expired - Fee Related CN107528798B (en) | 2016-06-22 | 2016-06-22 | RS485 bus system-based optimal scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107528798B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108390807B (en) * | 2018-02-11 | 2020-12-15 | 宁波工程学院 | Multi-machine communication method based on single chip microcomputer |
| CN109413217B (en) * | 2018-12-31 | 2021-06-08 | 宁波工程学院 | Agricultural Internet of things data communication method |
| CN115378758B (en) * | 2022-07-27 | 2023-09-26 | 中国船舶集团有限公司第七二四研究所 | Multi-node SRIO bus self-adaptive flow control method based on priority strategy |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101547149A (en) * | 2009-04-20 | 2009-09-30 | 浙江大学 | Dynamic scheduling method for OSEK COM messages based on CAN network |
| WO2012012961A1 (en) * | 2010-07-30 | 2012-02-02 | 中兴通讯股份有限公司 | Method and device for scheduling buses |
| CN105007209A (en) * | 2015-06-04 | 2015-10-28 | 烟台东方威思顿电气股份有限公司 | RS485-based polling communication method |
| CN105354159A (en) * | 2015-09-28 | 2016-02-24 | 上海海视电子有限公司 | RS485 distributed bus system based control method |
-
2016
- 2016-06-22 CN CN201610473621.0A patent/CN107528798B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101547149A (en) * | 2009-04-20 | 2009-09-30 | 浙江大学 | Dynamic scheduling method for OSEK COM messages based on CAN network |
| WO2012012961A1 (en) * | 2010-07-30 | 2012-02-02 | 中兴通讯股份有限公司 | Method and device for scheduling buses |
| CN105007209A (en) * | 2015-06-04 | 2015-10-28 | 烟台东方威思顿电气股份有限公司 | RS485-based polling communication method |
| CN105354159A (en) * | 2015-09-28 | 2016-02-24 | 上海海视电子有限公司 | RS485 distributed bus system based control method |
Non-Patent Citations (1)
| Title |
|---|
| 基于新型485总线的分布式数据采集控制系统;宋晓伟等;《机电一体化》;20081020;第67-71页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107528798A (en) | 2017-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107528798B (en) | RS485 bus system-based optimal scheduling method | |
| KR20160065206A (en) | Camera control interface slave device to slave device communication | |
| CN110635982B (en) | Double-host communication method and system on communication bus, industrial control gateway and storage medium | |
| CN105282209A (en) | Network system for vehicle and data transmission method of heterogeneous communication controllers in the same system | |
| CN101309192A (en) | Bus communication method | |
| CN104021034A (en) | Task processing method and system | |
| CN110601943B (en) | Communication system based on RS485 bus and communication method thereof | |
| CN105101370A (en) | Data connection method and device, and WIFI module | |
| CN101631148A (en) | Communication method for allocating dynamic addresses in serial communication protocols | |
| US20060114824A1 (en) | Multiple device communications | |
| US7206882B2 (en) | Triggered communication network for CANOpen networks | |
| CN113890781B (en) | Communication method, system and storage medium based on timer extension | |
| CN106875664B (en) | Exclusive data acquisition method based on CAN bus | |
| CN105162671A (en) | Welding table control system of arbitrary host and control method thereof | |
| US6907485B2 (en) | Hybrid change of state protocol for CANOpen networks | |
| CN106953809B (en) | 485 time-sharing communication-based equipment resource acquisition method | |
| CN102043397A (en) | Network communication method for building automation system | |
| CN1125866A (en) | Method and apparatus for transmission of signals over a shared line | |
| CN104506642A (en) | Client message efficient transceiving and processing method and system | |
| CN108628796A (en) | A kind of serial communication method and system | |
| CN113434441A (en) | DMA transmission method, device, controller and readable storage medium | |
| CN201584967U (en) | Asi relay module | |
| CN105656740A (en) | RS422-CAN bus converter | |
| CN111813723A (en) | Power bus data transmission method and device and computer readable storage medium | |
| CN114817264B (en) | Topology query structure, query method, electronic equipment and medium for graph calculation |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200908 |