Methods and apparatus for scheduling tasks

Methods and apparatus for scheduling tasks

Queues are scheduled for outputting data using a hierarchical tree. Each level of the hierarchical tree includes multiple entries for storing status information associated with the queues. For example, a given entry of the tree stores multi-parameter status information associated with a correspondin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: GOSS GREGORY S, SMITH SCOTT C, KAPPLER CHRISTOPHER J
Format: Patent
Sprache:eng
Schlagworte:
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
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 GOSS GREGORY S
SMITH SCOTT C
KAPPLER CHRISTOPHER J
description Queues are scheduled for outputting data using a hierarchical tree. Each level of the hierarchical tree includes multiple entries for storing status information associated with the queues. For example, a given entry of the tree stores multi-parameter status information associated with a corresponding queue to be serviced. To determine which of the queues is next in line for servicing, a logic circuit compares the multi-parameter status information stored in two or more entries of the tree. The next scheduled queue or highest priority queue in the tree is then serviced by outputting at least some of its data.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US7372857B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US7372857B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US7372857B13</originalsourceid><addsrcrecordid>eNrjZNDyTS3JyE8pVkjMS1FILChILEosKS1WSMsvUihOzkhNKc3JzEtXKEkszi7mYWBNS8wpTuWF0twMCm6uIc4euqkF-fGpxQWJyal5qSXxocHmxuZGFqbmTobGRCgBAO7xKPo</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Methods and apparatus for scheduling tasks</title><source>esp@cenet</source><creator>GOSS GREGORY S ; SMITH SCOTT C ; KAPPLER CHRISTOPHER J</creator><creatorcontrib>GOSS GREGORY S ; SMITH SCOTT C ; KAPPLER CHRISTOPHER J</creatorcontrib><description>Queues are scheduled for outputting data using a hierarchical tree. Each level of the hierarchical tree includes multiple entries for storing status information associated with the queues. For example, a given entry of the tree stores multi-parameter status information associated with a corresponding queue to be serviced. To determine which of the queues is next in line for servicing, a logic circuit compares the multi-parameter status information stored in two or more entries of the tree. The next scheduled queue or highest priority queue in the tree is then serviced by outputting at least some of its data.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2008</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=20080513&amp;DB=EPODOC&amp;CC=US&amp;NR=7372857B1$$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=20080513&amp;DB=EPODOC&amp;CC=US&amp;NR=7372857B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>GOSS GREGORY S</creatorcontrib><creatorcontrib>SMITH SCOTT C</creatorcontrib><creatorcontrib>KAPPLER CHRISTOPHER J</creatorcontrib><title>Methods and apparatus for scheduling tasks</title><description>Queues are scheduled for outputting data using a hierarchical tree. Each level of the hierarchical tree includes multiple entries for storing status information associated with the queues. For example, a given entry of the tree stores multi-parameter status information associated with a corresponding queue to be serviced. To determine which of the queues is next in line for servicing, a logic circuit compares the multi-parameter status information stored in two or more entries of the tree. The next scheduled queue or highest priority queue in the tree is then serviced by outputting at least some of its data.</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>2008</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNDyTS3JyE8pVkjMS1FILChILEosKS1WSMsvUihOzkhNKc3JzEtXKEkszi7mYWBNS8wpTuWF0twMCm6uIc4euqkF-fGpxQWJyal5qSXxocHmxuZGFqbmTobGRCgBAO7xKPo</recordid><startdate>20080513</startdate><enddate>20080513</enddate><creator>GOSS GREGORY S</creator><creator>SMITH SCOTT C</creator><creator>KAPPLER CHRISTOPHER J</creator><scope>EVB</scope></search><sort><creationdate>20080513</creationdate><title>Methods and apparatus for scheduling tasks</title><author>GOSS GREGORY S ; SMITH SCOTT C ; KAPPLER CHRISTOPHER J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US7372857B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2008</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>GOSS GREGORY S</creatorcontrib><creatorcontrib>SMITH SCOTT C</creatorcontrib><creatorcontrib>KAPPLER CHRISTOPHER J</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>GOSS GREGORY S</au><au>SMITH SCOTT C</au><au>KAPPLER CHRISTOPHER J</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Methods and apparatus for scheduling tasks</title><date>2008-05-13</date><risdate>2008</risdate><abstract>Queues are scheduled for outputting data using a hierarchical tree. Each level of the hierarchical tree includes multiple entries for storing status information associated with the queues. For example, a given entry of the tree stores multi-parameter status information associated with a corresponding queue to be serviced. To determine which of the queues is next in line for servicing, a logic circuit compares the multi-parameter status information stored in two or more entries of the tree. The next scheduled queue or highest priority queue in the tree is then serviced by outputting at least some of its data.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US7372857B1
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Methods and apparatus for scheduling tasks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T02%3A34%3A39IST&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=GOSS%20GREGORY%20S&rft.date=2008-05-13&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS7372857B1%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