Flow lookahead in an ordered semaphore management subsystem
In an ordered semaphore management system a pending state allows threads not competing for a locked semaphore to bypass one or more threads waiting for the same locked semaphore. The number of pending levels determines the number of consecutive threads vying for the same locked semaphore which can b...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| 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 | LIKOVICH ROBERT BRIAN SIEGEL MICHAEL STEVEN LEAVENS ROSS BOYD JENKINS STEVEN KENNETH QUEEN WESLEY ERICH |
| description | In an ordered semaphore management system a pending state allows threads not competing for a locked semaphore to bypass one or more threads waiting for the same locked semaphore. The number of pending levels determines the number of consecutive threads vying for the same locked semaphore which can be bypassed. When more than one level is provided the pending levels are prioritized in the queued order. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2003060898A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2003060898A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2003060898A13</originalsourceid><addsrcrecordid>eNrjZLB2y8kvV8jJz89OzEhNTFHIzFNIzFPIL0pJLUpNUShOzU0syMgvSlXITcxLTE_NTc0rUSguTSquLC5JzeVhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGBsYGZgYWlhaOhsbEqQIAdy8wmQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Flow lookahead in an ordered semaphore management subsystem</title><source>esp@cenet</source><creator>LIKOVICH ROBERT BRIAN ; SIEGEL MICHAEL STEVEN ; LEAVENS ROSS BOYD ; JENKINS STEVEN KENNETH ; QUEEN WESLEY ERICH</creator><creatorcontrib>LIKOVICH ROBERT BRIAN ; SIEGEL MICHAEL STEVEN ; LEAVENS ROSS BOYD ; JENKINS STEVEN KENNETH ; QUEEN WESLEY ERICH</creatorcontrib><description>In an ordered semaphore management system a pending state allows threads not competing for a locked semaphore to bypass one or more threads waiting for the same locked semaphore. The number of pending levels determines the number of consecutive threads vying for the same locked semaphore which can be bypassed. When more than one level is provided the pending levels are prioritized in the queued order.</description><edition>7</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; CONTROL OR REGULATING SYSTEMS IN GENERAL ; CONTROLLING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS ; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS ; PHYSICS ; REGULATING</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&date=20030327&DB=EPODOC&CC=US&NR=2003060898A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,778,883,25551,76302</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20030327&DB=EPODOC&CC=US&NR=2003060898A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LIKOVICH ROBERT BRIAN</creatorcontrib><creatorcontrib>SIEGEL MICHAEL STEVEN</creatorcontrib><creatorcontrib>LEAVENS ROSS BOYD</creatorcontrib><creatorcontrib>JENKINS STEVEN KENNETH</creatorcontrib><creatorcontrib>QUEEN WESLEY ERICH</creatorcontrib><title>Flow lookahead in an ordered semaphore management subsystem</title><description>In an ordered semaphore management system a pending state allows threads not competing for a locked semaphore to bypass one or more threads waiting for the same locked semaphore. The number of pending levels determines the number of consecutive threads vying for the same locked semaphore which can be bypassed. When more than one level is provided the pending levels are prioritized in the queued order.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>CONTROL OR REGULATING SYSTEMS IN GENERAL</subject><subject>CONTROLLING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>FUNCTIONAL ELEMENTS OF SUCH SYSTEMS</subject><subject>MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS</subject><subject>PHYSICS</subject><subject>REGULATING</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2003</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLB2y8kvV8jJz89OzEhNTFHIzFNIzFPIL0pJLUpNUShOzU0syMgvSlXITcxLTE_NTc0rUSguTSquLC5JzeVhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGBsYGZgYWlhaOhsbEqQIAdy8wmQ</recordid><startdate>20030327</startdate><enddate>20030327</enddate><creator>LIKOVICH ROBERT BRIAN</creator><creator>SIEGEL MICHAEL STEVEN</creator><creator>LEAVENS ROSS BOYD</creator><creator>JENKINS STEVEN KENNETH</creator><creator>QUEEN WESLEY ERICH</creator><scope>EVB</scope></search><sort><creationdate>20030327</creationdate><title>Flow lookahead in an ordered semaphore management subsystem</title><author>LIKOVICH ROBERT BRIAN ; SIEGEL MICHAEL STEVEN ; LEAVENS ROSS BOYD ; JENKINS STEVEN KENNETH ; QUEEN WESLEY ERICH</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2003060898A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2003</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>CONTROL OR REGULATING SYSTEMS IN GENERAL</topic><topic>CONTROLLING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>FUNCTIONAL ELEMENTS OF SUCH SYSTEMS</topic><topic>MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS</topic><topic>PHYSICS</topic><topic>REGULATING</topic><toplevel>online_resources</toplevel><creatorcontrib>LIKOVICH ROBERT BRIAN</creatorcontrib><creatorcontrib>SIEGEL MICHAEL STEVEN</creatorcontrib><creatorcontrib>LEAVENS ROSS BOYD</creatorcontrib><creatorcontrib>JENKINS STEVEN KENNETH</creatorcontrib><creatorcontrib>QUEEN WESLEY ERICH</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LIKOVICH ROBERT BRIAN</au><au>SIEGEL MICHAEL STEVEN</au><au>LEAVENS ROSS BOYD</au><au>JENKINS STEVEN KENNETH</au><au>QUEEN WESLEY ERICH</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Flow lookahead in an ordered semaphore management subsystem</title><date>2003-03-27</date><risdate>2003</risdate><abstract>In an ordered semaphore management system a pending state allows threads not competing for a locked semaphore to bypass one or more threads waiting for the same locked semaphore. The number of pending levels determines the number of consecutive threads vying for the same locked semaphore which can be bypassed. When more than one level is provided the pending levels are prioritized in the queued order.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2003060898A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING CONTROL OR REGULATING SYSTEMS IN GENERAL CONTROLLING COUNTING ELECTRIC DIGITAL DATA PROCESSING FUNCTIONAL ELEMENTS OF SUCH SYSTEMS MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS PHYSICS REGULATING |
| title | Flow lookahead in an ordered semaphore management subsystem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T16%3A18%3A47IST&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=LIKOVICH%20ROBERT%20BRIAN&rft.date=2003-03-27&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2003060898A1%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 |