IP Library Granted Patent US 11,321,122
Granted Patent B2
US 11,321,122 · App. 16/553,852 · Granted May 3, 2022

Method, apparatus, device and medium for processing topological relation of tasks

Inventors: Chao Zhang (Beijing, CN); Zhuo Chen (Beijing, CN); Liming Xia (Beijing, CN); Weifeng Yao (Beijing, CN); Jiankang Xin (Beijing, CN); Chengliang Deng (Beijing, CN)
Assignee: Apollo Intelligent Driving Technology (Beijing) Co., Ltd.
G06F9/4881G06F9/34G06F9/3838G06F9/544G06F8/457
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,321,122
App. No.
16/553,852
Granted
May 3, 2022
Kind
B2
Abstract

The embodiments of the present disclosure provide a method, an apparatus, a device and a medium for processing topological relation of tasks. The method includes: extracting at least one execution element from each of processing tasks based on a topological relation recognition rule; determining a dependency relation among the processing tasks according to content of the execution element of each processing task; and determining a topological relation among the processing tasks according to the dependency relation among the processing tasks.

Claims (67)

1. A method for processing topological relation of tasks, comprising:

extracting at least one execution element from each of processing tasks based on a topological relation recognition rule;

determining a dependency relation among the processing tasks according to content of the execution element of each processing task; and

determining a topological relation of the processing tasks according to the dependency relation among the processing tasks,

wherein determining the transmission paths of data among the processing tasks according to the content of the execution element of each processing task, comprises:

acquiring a read instruction from an execution element of a first processing task, acquiring source channel information of a read source corresponding to the read instruction, and recording the source channel information;

acquiring a write instruction from an execution element of a second processing task, acquiring destination channel information of a write destination corresponding to the write instruction, and recording the destination channel information;

matching the recorded source channel information with the destination channel information; and

in response to determining that the recorded source channel information matches with the destination channel information, determining that the transmission path of data is from the second processing task to the first processing task.

2. The method according to claim 1 , wherein determining the dependency relation among the processing tasks according to the content of the execution element of each processing task, comprises:

determining transmission paths of data among the processing tasks according to the content of the execution element of each processing task; and

determining the dependency relation among the processing tasks according to the directions of the transmission paths.

3. The method according to claim 1 , wherein the execution element comprises at least one of: a read instruction, a write instruction, a merging instruction and channel information.

4. The method according to claim 3 , wherein the channel information is an address in a shared storage space.

5. The method according to claim 1 , wherein determining the transmission paths of data among the processing tasks according to the content of the execution element of each processing task, comprises:

acquiring a merge instruction from an execution element of a third processing task, and acquiring source channel information of at least two read sources corresponding to the merge instruction, and recording the source channel information;

acquiring a write instruction from an execution element of a fourth processing task, and acquiring destination channel information of corresponding to the write instruction, and recording the destination channel information;

matching the recorded source channel information with the destination channel information; and

in response to determining that the recorded source channel information matches with the destination channel information, determining that the transmission path of data is from the fourth processing task to the third processing task.

6. The method according to claim 1 , after determining the topological relation of the processing tasks, further comprising:

scheduling and executing the processing tasks according to the topological relation of the processing tasks, and recording execution parameters of the processing tasks; and

analyzing performance of the topological relation according to the execution parameters.

7. The method according to claim 6 , wherein recording the execution parameters of the processing tasks comprises at least one of:

acquiring a duration between a startup time of an initial task node and an end time of a termination task node during executing process of the processing tasks as an execution parameter; and

during the executing process, acquiring a transmission delay between a write time point of writing data to a channel space and a read time point of reading the data from the channel space among serial processing tasks, and taking the transmission delay as an execution parameter.

8. An electronic device, comprising:

one or more processors;

a memory, configured to store one or more programs, wherein,

when the one or more programs are executed by the one or more processors, the one or more processors are caused to process topological relation of tasks, comprising:

extracting at least one execution element from each of processing tasks based on a topological relation recognition rule;

determining a dependency relation among the processing tasks according to content of the execution element of each processing task; and

determining a topological relation of the processing tasks according to the dependency relation among the processing tasks,

wherein determining the transmission paths of data among the processing tasks according to the content of the execution element of each processing task, comprises:

acquiring a read instruction from an execution element of a first processing task, acquiring source channel information of a read source corresponding to the read instruction, and recording the source channel information;

acquiring a write instruction from an execution element of a second processing task, acquiring destination channel information of a write destination corresponding to the write instruction, and recording the destination channel information;

matching the recorded source channel information with the destination channel information; and

in response to determining that the recorded source channel information matches with the destination channel information, determining that the transmission path of data is from the second processing task to the first processing task.

9. The electronic device according to claim 8 , wherein determining the dependency relation among the processing tasks according to the content of the execution element of each processing task, comprises:

determining transmission paths of data among the processing tasks according to the content of the execution element of each processing task; and

determining the dependency relation among the processing tasks according to the directions of the transmission paths.

10. The electronic device according to claim 8 , wherein the execution element comprises at least one of: a read instruction, a write instruction, a merging instruction and channel information.

11. The electronic device according to claim 10 , wherein the channel information is an address in a shared storage space.

12. The electronic device according to claim 8 , wherein determining the transmission paths of data among the processing tasks according to the content of the execution element of each processing task, comprises:

acquiring a merge instruction from an execution element of a third processing task, and acquiring source channel information of at least two read sources corresponding to the merge instruction, and recording the source channel information;

acquiring a write instruction from an execution element of a fourth processing task, and acquiring destination channel information of corresponding to the write instruction, and recording the destination channel information;

matching the recorded source channel information with the destination channel information; and

in response to determining that the recorded source channel information matches with the destination channel information, determining that the transmission path of data is from the fourth processing task to the third processing task.

13. The electronic device according to claim 8 , wherein, after determining the topological relation of the processing tasks, the method further comprises:

scheduling and executing the processing tasks according to the topological relation of the processing tasks, and recording execution parameters of the processing tasks; and

analyzing performance of the topological relation according to the execution parameters.

14. The electronic device according to claim 13 , wherein recording the execution parameters of the processing tasks comprises at least one of:

acquiring a duration between a startup time of an initial task node and an end time of a termination task node during executing process of the processing tasks as an execution parameter; and

during the executing process, acquiring a transmission delay between a write time point of writing data to a channel space and a read time point of reading the data from the channel space among serial processing tasks, and taking the transmission delay as an execution parameter.

15. A non-transitory computer readable storage medium having computer programs stored thereon, wherein when the programs are executed by a processor, a method for processing topological relation of tasks is implemented, the method comprising:

extracting at least one execution element from each of processing tasks based on a topological relation recognition rule;

determining a dependency relation among the processing tasks according to content of the execution element of each processing task; and

determining a topological relation of the processing tasks according to the dependency relation among the processing tasks,

wherein determining the transmission paths of data among the processing tasks according to the content of the execution element of each processing task, comprises:

acquiring a read instruction from an execution element of a first processing task, acquiring source channel information of a read source corresponding to the read instruction, and recording the source channel information;

acquiring a write instruction from an execution element of a second processing task, acquiring destination channel information of a write destination corresponding to the write instruction, and recording the destination channel information;

matching the recorded source channel information with the destination channel information; and

in response to determining that the recorded source channel information matches with the destination channel information, determining that the transmission path of data is from the second processing task to the first processing task.

16. The non-transitory computer readable storage medium according to claim 15 , wherein determining the dependency relation among the processing tasks according to the content of the execution element of each processing task, comprises:

determining transmission paths of data among the processing tasks according to the content of the execution element of each processing task; and

determining the dependency relation among the processing tasks according to the directions of the transmission paths.

17. The non-transitory computer readable storage medium according to claim 15 , wherein the execution element comprises at least one of: a read instruction, a write instruction, a merging instruction and channel information.

18. The non-transitory computer readable storage medium according to claim 17 , wherein the channel information is an address in a shared storage space.

Assignments (3)
CORRECTIVE ASSIGNMENT TO CORRECT THE APPLICANT NAME PREVIOUSLY RECORDED AT REEL: 057933 FRAME: 0812. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Dec 28, 2021
From: BAIDU ONLINE NETWORK TECHNOLOGY (BEIJING) CO., LTD.
To: APOLLO INTELLIGENT DRIVING TECHNOLOGY (BEIJING) CO., LTD.
Reel/Frame 058594/0836 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 13, 2021
From: BAIDU ONLINE NETWORK TECHNOLOGY (BEIJING) CO., LTD.
To: APOLLO INTELLIGENT DRIVING (BEIJING) TECHNOLOGY CO., LTD.
Reel/Frame 057933/0812 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 28, 2019
From: ZHANG, CHAO; CHEN, ZHUO; XIA, LIMING; YAO, WEIFENG; XIN, JIANKANG; DENG, CHENGLIANG
To: BAIDU ONLINE NETWORK TECHNOLOGY (BEIJING) CO., LTD.
Reel/Frame 050201/0244 →
Priority Claims (1)
CN 201811004352.9 · Aug 30, 2018 · national
Continuity (1)
Related Publication 20200073712A1 · Mar 5, 2020