The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Dec. 13, 2022
Filed:
Jun. 17, 2022
Shanghai Jiao Tong University, Shanghai, CN;
Cailian Chen, Shanghai, CN;
Qimin Xu, Shanghai, CN;
Shouliang Wang, Shanghai, CN;
Shanying Zhu, Shanghai, CN;
Lei Xu, Shanghai, CN;
Xinping Guan, Shanghai, CN;
Shanghai Jiao Tong University, Shanghai, CN;
Abstract
The present invention discloses a knowledge inference engine system and a method of implementation, relating to the field of wired communication networking technology. The system includes a data generation module, a stream partitioning model, an offline scheduling module, an online scheduling module, a scheduling solution base and a historical information base module, the data generation module used to generate a dataset and divide it into a plurality of partitions, the stream partitioning model used to partition the dataset, the offline scheduling module used to generate a scheduling solution for static network requirements, the online scheduling module used to rapidly generate a scheduling solution for a new TT stream, the scheduling solution base used to store a result of the partitioning, an iterative scheduling order for the partitions and the offline scheduling solution, the historical information base used to update and store relevant data information and performance indicators. The method of implementation proposed in the present invention combines and collaboratively operates offline iterative partition scheduling and an online incremental backtracking algorithm, addressing the problem that existing deterministic scheduling methods cannot simultaneously ensure scalability and schedulability.