Mechanism for passing information between queuing and de-queuing processes

The invention improves communications between a queuing process and a dequeuing process. Elements are linked and unlinked from the queue using a special locking instruction that guarantees serialized operations. The queue structure includes a synchronization field that is used to pass information be...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: ZEBROWSKI, JR. EDWARD
Format: Patent
Sprache: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 ZEBROWSKI, JR. EDWARD
description The invention improves communications between a queuing process and a dequeuing process. Elements are linked and unlinked from the queue using a special locking instruction that guarantees serialized operations. The queue structure includes a synchronization field that is used to pass information between the queuing process and the dequeuing process and which is also used by the locking instruction to guarantee serialized operation. The dequeuing process writes information into the synchronization field for the queuing process. The queuing process reads and acts on the information in the synchronization field. In the preferred embodiment, the information passed between the queuing and dequeuing processes allows the processes to control the initiation and termination of dequeuing processes. When the dequeuing process removes an element from the queue, it sets the synchronization field to a first or second state, depending on whether the queue is empty or not empty, respectively. If the queue is empty, the dequeuing process also terminates itself. When the queuing process next links an element into the queue, if the synchronization field is set to the first state, the queuing process initiates a new dequeuing process.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US6636883B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US6636883B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US6636883B13</originalsourceid><addsrcrecordid>eNrjZPDyTU3OSMzLLM5VSMsvUihILC7OzEtXyMwD8nITSzLz8xSSUkvKU1PzFApLU0tBcol5KQopqbowbkFRfnJqcXFqMQ8Da1piTnEqL5TmZlBwcw1x9tBNLciPTy0uSExOzUstiQ8NNjMzNrOwMHYyNCZCCQD7XTVu</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Mechanism for passing information between queuing and de-queuing processes</title><source>esp@cenet</source><creator>ZEBROWSKI, JR. EDWARD</creator><creatorcontrib>ZEBROWSKI, JR. EDWARD</creatorcontrib><description>The invention improves communications between a queuing process and a dequeuing process. Elements are linked and unlinked from the queue using a special locking instruction that guarantees serialized operations. The queue structure includes a synchronization field that is used to pass information between the queuing process and the dequeuing process and which is also used by the locking instruction to guarantee serialized operation. The dequeuing process writes information into the synchronization field for the queuing process. The queuing process reads and acts on the information in the synchronization field. In the preferred embodiment, the information passed between the queuing and dequeuing processes allows the processes to control the initiation and termination of dequeuing processes. When the dequeuing process removes an element from the queue, it sets the synchronization field to a first or second state, depending on whether the queue is empty or not empty, respectively. If the queue is empty, the dequeuing process also terminates itself. When the queuing process next links an element into the queue, if the synchronization field is set to the first state, the queuing process initiates a new dequeuing process.</description><edition>7</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2003</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=20031021&amp;DB=EPODOC&amp;CC=US&amp;NR=6636883B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76516</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20031021&amp;DB=EPODOC&amp;CC=US&amp;NR=6636883B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ZEBROWSKI, JR. EDWARD</creatorcontrib><title>Mechanism for passing information between queuing and de-queuing processes</title><description>The invention improves communications between a queuing process and a dequeuing process. Elements are linked and unlinked from the queue using a special locking instruction that guarantees serialized operations. The queue structure includes a synchronization field that is used to pass information between the queuing process and the dequeuing process and which is also used by the locking instruction to guarantee serialized operation. The dequeuing process writes information into the synchronization field for the queuing process. The queuing process reads and acts on the information in the synchronization field. In the preferred embodiment, the information passed between the queuing and dequeuing processes allows the processes to control the initiation and termination of dequeuing processes. When the dequeuing process removes an element from the queue, it sets the synchronization field to a first or second state, depending on whether the queue is empty or not empty, respectively. If the queue is empty, the dequeuing process also terminates itself. When the queuing process next links an element into the queue, if the synchronization field is set to the first state, the queuing process initiates a new dequeuing process.</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>2003</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPDyTU3OSMzLLM5VSMsvUihILC7OzEtXyMwD8nITSzLz8xSSUkvKU1PzFApLU0tBcol5KQopqbowbkFRfnJqcXFqMQ8Da1piTnEqL5TmZlBwcw1x9tBNLciPTy0uSExOzUstiQ8NNjMzNrOwMHYyNCZCCQD7XTVu</recordid><startdate>20031021</startdate><enddate>20031021</enddate><creator>ZEBROWSKI, JR. EDWARD</creator><scope>EVB</scope></search><sort><creationdate>20031021</creationdate><title>Mechanism for passing information between queuing and de-queuing processes</title><author>ZEBROWSKI, JR. EDWARD</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US6636883B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2003</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>ZEBROWSKI, JR. EDWARD</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ZEBROWSKI, JR. EDWARD</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Mechanism for passing information between queuing and de-queuing processes</title><date>2003-10-21</date><risdate>2003</risdate><abstract>The invention improves communications between a queuing process and a dequeuing process. Elements are linked and unlinked from the queue using a special locking instruction that guarantees serialized operations. The queue structure includes a synchronization field that is used to pass information between the queuing process and the dequeuing process and which is also used by the locking instruction to guarantee serialized operation. The dequeuing process writes information into the synchronization field for the queuing process. The queuing process reads and acts on the information in the synchronization field. In the preferred embodiment, the information passed between the queuing and dequeuing processes allows the processes to control the initiation and termination of dequeuing processes. When the dequeuing process removes an element from the queue, it sets the synchronization field to a first or second state, depending on whether the queue is empty or not empty, respectively. If the queue is empty, the dequeuing process also terminates itself. When the queuing process next links an element into the queue, if the synchronization field is set to the first state, the queuing process initiates a new dequeuing process.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US6636883B1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Mechanism for passing information between queuing and de-queuing processes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T15%3A24%3A21IST&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=ZEBROWSKI,%20JR.%20EDWARD&rft.date=2003-10-21&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS6636883B1%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