Plug-in association scheduling method based on topological sorting

Plug-in association scheduling method based on topological sorting

The invention discloses a plug-in association scheduling method based on topological sorting, which relates to the technical field of computers, and comprises the following steps: S1, dividing plug-ins into integration plug-ins and business plug-ins; s2, obtaining a service plug-in needing to be loa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: WANG WEI, TIAN XIAODONG, DAI XIANYONG, DENG JINXIANG, ZHOU ENYA, YOO SANG-KI, XIONG MIN, FENG YUANYUAN, GU FENG
Format: Patent
Sprache:chi ; eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator WANG WEI
TIAN XIAODONG
DAI XIANYONG
DENG JINXIANG
ZHOU ENYA
YOO SANG-KI
XIONG MIN
FENG YUANYUAN
GU FENG
description The invention discloses a plug-in association scheduling method based on topological sorting, which relates to the technical field of computers, and comprises the following steps: S1, dividing plug-ins into integration plug-ins and business plug-ins; s2, obtaining a service plug-in needing to be loaded; s3, obtaining all integrated plug-ins dependent on each business plug-in from each business plug-in to construct a mapping relation; s4, creating a mapping table, and importing the mapping relation into the mapping table; s5, traversing each mapping relation in the mapping table, creating directed edges, and connecting all the directed edges to finally form a directed acyclic graph; s6, sorting the generated directed acyclic graphs according to a topological sorting algorithm; s7, forward traversing a topological sorting result to obtain registration information, and constructing a plug-in scheduling chain table; s8, reversely traversing a topological sorting result, and initializing each plug-in according to
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN116302156A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN116302156A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN116302156A3</originalsourceid><addsrcrecordid>eNrjZHAKyClN183MU0gsLs5PzkwsyczPUyhOzkhNKc3JzEtXyE0tychPUUhKLE5NUQBKleQX5Ofkp2cmJ-YoFOcXlQDV8DCwpiXmFKfyQmluBkU31xBnD93Ugvz41OKCxOTUvNSSeGc_Q0MzYwMjQ1MzR2Ni1AAAZBAyWg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Plug-in association scheduling method based on topological sorting</title><source>esp@cenet</source><creator>WANG WEI ; TIAN XIAODONG ; DAI XIANYONG ; DENG JINXIANG ; ZHOU ENYA ; YOO SANG-KI ; XIONG MIN ; FENG YUANYUAN ; GU FENG</creator><creatorcontrib>WANG WEI ; TIAN XIAODONG ; DAI XIANYONG ; DENG JINXIANG ; ZHOU ENYA ; YOO SANG-KI ; XIONG MIN ; FENG YUANYUAN ; GU FENG</creatorcontrib><description>The invention discloses a plug-in association scheduling method based on topological sorting, which relates to the technical field of computers, and comprises the following steps: S1, dividing plug-ins into integration plug-ins and business plug-ins; s2, obtaining a service plug-in needing to be loaded; s3, obtaining all integrated plug-ins dependent on each business plug-in from each business plug-in to construct a mapping relation; s4, creating a mapping table, and importing the mapping relation into the mapping table; s5, traversing each mapping relation in the mapping table, creating directed edges, and connecting all the directed edges to finally form a directed acyclic graph; s6, sorting the generated directed acyclic graphs according to a topological sorting algorithm; s7, forward traversing a topological sorting result to obtain registration information, and constructing a plug-in scheduling chain table; s8, reversely traversing a topological sorting result, and initializing each plug-in according to</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2023</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230623&amp;DB=EPODOC&amp;CC=CN&amp;NR=116302156A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230623&amp;DB=EPODOC&amp;CC=CN&amp;NR=116302156A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>WANG WEI</creatorcontrib><creatorcontrib>TIAN XIAODONG</creatorcontrib><creatorcontrib>DAI XIANYONG</creatorcontrib><creatorcontrib>DENG JINXIANG</creatorcontrib><creatorcontrib>ZHOU ENYA</creatorcontrib><creatorcontrib>YOO SANG-KI</creatorcontrib><creatorcontrib>XIONG MIN</creatorcontrib><creatorcontrib>FENG YUANYUAN</creatorcontrib><creatorcontrib>GU FENG</creatorcontrib><title>Plug-in association scheduling method based on topological sorting</title><description>The invention discloses a plug-in association scheduling method based on topological sorting, which relates to the technical field of computers, and comprises the following steps: S1, dividing plug-ins into integration plug-ins and business plug-ins; s2, obtaining a service plug-in needing to be loaded; s3, obtaining all integrated plug-ins dependent on each business plug-in from each business plug-in to construct a mapping relation; s4, creating a mapping table, and importing the mapping relation into the mapping table; s5, traversing each mapping relation in the mapping table, creating directed edges, and connecting all the directed edges to finally form a directed acyclic graph; s6, sorting the generated directed acyclic graphs according to a topological sorting algorithm; s7, forward traversing a topological sorting result to obtain registration information, and constructing a plug-in scheduling chain table; s8, reversely traversing a topological sorting result, and initializing each plug-in according to</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHAKyClN183MU0gsLs5PzkwsyczPUyhOzkhNKc3JzEtXyE0tychPUUhKLE5NUQBKleQX5Ofkp2cmJ-YoFOcXlQDV8DCwpiXmFKfyQmluBkU31xBnD93Ugvz41OKCxOTUvNSSeGc_Q0MzYwMjQ1MzR2Ni1AAAZBAyWg</recordid><startdate>20230623</startdate><enddate>20230623</enddate><creator>WANG WEI</creator><creator>TIAN XIAODONG</creator><creator>DAI XIANYONG</creator><creator>DENG JINXIANG</creator><creator>ZHOU ENYA</creator><creator>YOO SANG-KI</creator><creator>XIONG MIN</creator><creator>FENG YUANYUAN</creator><creator>GU FENG</creator><scope>EVB</scope></search><sort><creationdate>20230623</creationdate><title>Plug-in association scheduling method based on topological sorting</title><author>WANG WEI ; TIAN XIAODONG ; DAI XIANYONG ; DENG JINXIANG ; ZHOU ENYA ; YOO SANG-KI ; XIONG MIN ; FENG YUANYUAN ; GU FENG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN116302156A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>WANG WEI</creatorcontrib><creatorcontrib>TIAN XIAODONG</creatorcontrib><creatorcontrib>DAI XIANYONG</creatorcontrib><creatorcontrib>DENG JINXIANG</creatorcontrib><creatorcontrib>ZHOU ENYA</creatorcontrib><creatorcontrib>YOO SANG-KI</creatorcontrib><creatorcontrib>XIONG MIN</creatorcontrib><creatorcontrib>FENG YUANYUAN</creatorcontrib><creatorcontrib>GU FENG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>WANG WEI</au><au>TIAN XIAODONG</au><au>DAI XIANYONG</au><au>DENG JINXIANG</au><au>ZHOU ENYA</au><au>YOO SANG-KI</au><au>XIONG MIN</au><au>FENG YUANYUAN</au><au>GU FENG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Plug-in association scheduling method based on topological sorting</title><date>2023-06-23</date><risdate>2023</risdate><abstract>The invention discloses a plug-in association scheduling method based on topological sorting, which relates to the technical field of computers, and comprises the following steps: S1, dividing plug-ins into integration plug-ins and business plug-ins; s2, obtaining a service plug-in needing to be loaded; s3, obtaining all integrated plug-ins dependent on each business plug-in from each business plug-in to construct a mapping relation; s4, creating a mapping table, and importing the mapping relation into the mapping table; s5, traversing each mapping relation in the mapping table, creating directed edges, and connecting all the directed edges to finally form a directed acyclic graph; s6, sorting the generated directed acyclic graphs according to a topological sorting algorithm; s7, forward traversing a topological sorting result to obtain registration information, and constructing a plug-in scheduling chain table; s8, reversely traversing a topological sorting result, and initializing each plug-in according to</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN116302156A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Plug-in association scheduling method based on topological sorting
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T11%3A36%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=WANG%20WEI&rft.date=2023-06-23&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN116302156A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true