SCHEDULING COMPLEX JOBS IN A DISTRIBUTED NETWORK
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for job management in a distributed network include a prioritizer that determines a priority level for a job and inserts the job into a priority queue based on the priority level, a scheduler that, for...
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 | Guevin, Thomas F Neely, Joshua Cox, Dennis |
| description | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for job management in a distributed network include a prioritizer that determines a priority level for a job and inserts the job into a priority queue based on the priority level, a scheduler that, for each element in the distributed network, requests the priorities of one or more jobs scheduled for execution, evaluates, based on the priorities of the one or more jobs scheduled for execution, the priority of a particular job with respect to the element, determines, based on the priorities, that the network element is free to perform job processes, and upon determining that a network element is free, scheduling a particular job for execution, and an executor that determines that all local and remote resources required for the scheduled job are available and executes the job according to processes defined within the distributed network. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2023029198A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2023029198A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2023029198A13</originalsourceid><addsrcrecordid>eNrjZDAIdvZwdQn18fRzV3D29w3wcY1Q8PJ3Clbw9FNwVHDxDA4J8nQKDXF1UfBzDQn3D_LmYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBkbGBkaWhpYWjobGxKkCAMdvJ0Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SCHEDULING COMPLEX JOBS IN A DISTRIBUTED NETWORK</title><source>esp@cenet</source><creator>Guevin, Thomas F ; Neely, Joshua ; Cox, Dennis</creator><creatorcontrib>Guevin, Thomas F ; Neely, Joshua ; Cox, Dennis</creatorcontrib><description>Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for job management in a distributed network include a prioritizer that determines a priority level for a job and inserts the job into a priority queue based on the priority level, a scheduler that, for each element in the distributed network, requests the priorities of one or more jobs scheduled for execution, evaluates, based on the priorities of the one or more jobs scheduled for execution, the priority of a particular job with respect to the element, determines, based on the priorities, that the network element is free to perform job processes, and upon determining that a network element is free, scheduling a particular job for execution, and an executor that determines that all local and remote resources required for the scheduled job are available and executes the job according to processes defined within the distributed network.</description><language>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&date=20230126&DB=EPODOC&CC=US&NR=2023029198A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76419</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20230126&DB=EPODOC&CC=US&NR=2023029198A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Guevin, Thomas F</creatorcontrib><creatorcontrib>Neely, Joshua</creatorcontrib><creatorcontrib>Cox, Dennis</creatorcontrib><title>SCHEDULING COMPLEX JOBS IN A DISTRIBUTED NETWORK</title><description>Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for job management in a distributed network include a prioritizer that determines a priority level for a job and inserts the job into a priority queue based on the priority level, a scheduler that, for each element in the distributed network, requests the priorities of one or more jobs scheduled for execution, evaluates, based on the priorities of the one or more jobs scheduled for execution, the priority of a particular job with respect to the element, determines, based on the priorities, that the network element is free to perform job processes, and upon determining that a network element is free, scheduling a particular job for execution, and an executor that determines that all local and remote resources required for the scheduled job are available and executes the job according to processes defined within the distributed network.</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>eNrjZDAIdvZwdQn18fRzV3D29w3wcY1Q8PJ3Clbw9FNwVHDxDA4J8nQKDXF1UfBzDQn3D_LmYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBkbGBkaWhpYWjobGxKkCAMdvJ0Q</recordid><startdate>20230126</startdate><enddate>20230126</enddate><creator>Guevin, Thomas F</creator><creator>Neely, Joshua</creator><creator>Cox, Dennis</creator><scope>EVB</scope></search><sort><creationdate>20230126</creationdate><title>SCHEDULING COMPLEX JOBS IN A DISTRIBUTED NETWORK</title><author>Guevin, Thomas F ; Neely, Joshua ; Cox, Dennis</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2023029198A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>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>Guevin, Thomas F</creatorcontrib><creatorcontrib>Neely, Joshua</creatorcontrib><creatorcontrib>Cox, Dennis</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Guevin, Thomas F</au><au>Neely, Joshua</au><au>Cox, Dennis</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SCHEDULING COMPLEX JOBS IN A DISTRIBUTED NETWORK</title><date>2023-01-26</date><risdate>2023</risdate><abstract>Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for job management in a distributed network include a prioritizer that determines a priority level for a job and inserts the job into a priority queue based on the priority level, a scheduler that, for each element in the distributed network, requests the priorities of one or more jobs scheduled for execution, evaluates, based on the priorities of the one or more jobs scheduled for execution, the priority of a particular job with respect to the element, determines, based on the priorities, that the network element is free to perform job processes, and upon determining that a network element is free, scheduling a particular job for execution, and an executor that determines that all local and remote resources required for the scheduled job are available and executes the job according to processes defined within the distributed network.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2023029198A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | SCHEDULING COMPLEX JOBS IN A DISTRIBUTED NETWORK |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T21%3A12%3A04IST&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=Guevin,%20Thomas%20F&rft.date=2023-01-26&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2023029198A1%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 |