Priority queue ordering system and method with determinacy and bounded delay

A priority queue ordering system includes a priority queue and a message store. The priority queue includes a plurality of priority blocks cascaded in order from a lowest priority block to a highest priority block. Each priority block includes: a register block that stores an address and an identifi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: PANNELL DONALD ROBERT, GAUTHIER CLAUDE ROBERT, DEB ABHIJIT KUMAR
Format: Patent
Sprache:chi ; eng
Schlagworte:
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 PANNELL DONALD ROBERT
GAUTHIER CLAUDE ROBERT
DEB ABHIJIT KUMAR
description A priority queue ordering system includes a priority queue and a message store. The priority queue includes a plurality of priority blocks cascaded in order from a lowest priority block to a highest priority block. Each priority block includes: a register block that stores an address and an identifier; a comparison circuit that compares the new identifier with the stored identifier to determine a relative priority; and a selection circuit that determines whether to hold or shift and replace addresses and identifiers stored within the priority queue based on the relative priority. The message store stores message payloads, each directed to a corresponding storage address of a corresponding priority block. Each priority block contains its own compare and select circuitry and determines hold, shift or store operations. Therefore, ordering is independent of the length of the priority queue, thereby achieving deterministic ordering delay independent of queue length. 一种优先级队列排序系统包括优先级队列和消息存储区。所述优先级队列包括按从最低优先级块到最高优先级
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN115695328A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN115695328A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN115695328A3</originalsourceid><addsrcrecordid>eNrjZPAJKMrML8osqVQoLE0tTVXIL0pJLcrMS1coriwuSc1VSMxLUchNLcnIT1EozyzJUEhJLUktys3MS0yuBMsl5ZfmpaSmAMVzEit5GFjTEnOKU3mhNDeDoptriLOHbmpBfnxqcUFicmpeakm8s5-hoamZpamxkYWjMTFqANMFNjE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Priority queue ordering system and method with determinacy and bounded delay</title><source>esp@cenet</source><creator>PANNELL DONALD ROBERT ; GAUTHIER CLAUDE ROBERT ; DEB ABHIJIT KUMAR</creator><creatorcontrib>PANNELL DONALD ROBERT ; GAUTHIER CLAUDE ROBERT ; DEB ABHIJIT KUMAR</creatorcontrib><description>A priority queue ordering system includes a priority queue and a message store. The priority queue includes a plurality of priority blocks cascaded in order from a lowest priority block to a highest priority block. Each priority block includes: a register block that stores an address and an identifier; a comparison circuit that compares the new identifier with the stored identifier to determine a relative priority; and a selection circuit that determines whether to hold or shift and replace addresses and identifiers stored within the priority queue based on the relative priority. The message store stores message payloads, each directed to a corresponding storage address of a corresponding priority block. Each priority block contains its own compare and select circuitry and determines hold, shift or store operations. Therefore, ordering is independent of the length of the priority queue, thereby achieving deterministic ordering delay independent of queue length. 一种优先级队列排序系统包括优先级队列和消息存储区。所述优先级队列包括按从最低优先级块到最高优先级</description><language>chi ; eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</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=20230203&amp;DB=EPODOC&amp;CC=CN&amp;NR=115695328A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76294</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230203&amp;DB=EPODOC&amp;CC=CN&amp;NR=115695328A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>PANNELL DONALD ROBERT</creatorcontrib><creatorcontrib>GAUTHIER CLAUDE ROBERT</creatorcontrib><creatorcontrib>DEB ABHIJIT KUMAR</creatorcontrib><title>Priority queue ordering system and method with determinacy and bounded delay</title><description>A priority queue ordering system includes a priority queue and a message store. The priority queue includes a plurality of priority blocks cascaded in order from a lowest priority block to a highest priority block. Each priority block includes: a register block that stores an address and an identifier; a comparison circuit that compares the new identifier with the stored identifier to determine a relative priority; and a selection circuit that determines whether to hold or shift and replace addresses and identifiers stored within the priority queue based on the relative priority. The message store stores message payloads, each directed to a corresponding storage address of a corresponding priority block. Each priority block contains its own compare and select circuitry and determines hold, shift or store operations. Therefore, ordering is independent of the length of the priority queue, thereby achieving deterministic ordering delay independent of queue length. 一种优先级队列排序系统包括优先级队列和消息存储区。所述优先级队列包括按从最低优先级块到最高优先级</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPAJKMrML8osqVQoLE0tTVXIL0pJLcrMS1coriwuSc1VSMxLUchNLcnIT1EozyzJUEhJLUktys3MS0yuBMsl5ZfmpaSmAMVzEit5GFjTEnOKU3mhNDeDoptriLOHbmpBfnxqcUFicmpeakm8s5-hoamZpamxkYWjMTFqANMFNjE</recordid><startdate>20230203</startdate><enddate>20230203</enddate><creator>PANNELL DONALD ROBERT</creator><creator>GAUTHIER CLAUDE ROBERT</creator><creator>DEB ABHIJIT KUMAR</creator><scope>EVB</scope></search><sort><creationdate>20230203</creationdate><title>Priority queue ordering system and method with determinacy and bounded delay</title><author>PANNELL DONALD ROBERT ; GAUTHIER CLAUDE ROBERT ; DEB ABHIJIT KUMAR</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN115695328A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2023</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>PANNELL DONALD ROBERT</creatorcontrib><creatorcontrib>GAUTHIER CLAUDE ROBERT</creatorcontrib><creatorcontrib>DEB ABHIJIT KUMAR</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>PANNELL DONALD ROBERT</au><au>GAUTHIER CLAUDE ROBERT</au><au>DEB ABHIJIT KUMAR</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Priority queue ordering system and method with determinacy and bounded delay</title><date>2023-02-03</date><risdate>2023</risdate><abstract>A priority queue ordering system includes a priority queue and a message store. The priority queue includes a plurality of priority blocks cascaded in order from a lowest priority block to a highest priority block. Each priority block includes: a register block that stores an address and an identifier; a comparison circuit that compares the new identifier with the stored identifier to determine a relative priority; and a selection circuit that determines whether to hold or shift and replace addresses and identifiers stored within the priority queue based on the relative priority. The message store stores message payloads, each directed to a corresponding storage address of a corresponding priority block. Each priority block contains its own compare and select circuitry and determines hold, shift or store operations. Therefore, ordering is independent of the length of the priority queue, thereby achieving deterministic ordering delay independent of queue length. 一种优先级队列排序系统包括优先级队列和消息存储区。所述优先级队列包括按从最低优先级块到最高优先级</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN115695328A
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Priority queue ordering system and method with determinacy and bounded delay
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T03%3A28%3A15IST&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=PANNELL%20DONALD%20ROBERT&rft.date=2023-02-03&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN115695328A%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