PROBABILISTICALLY PRIORITIZED PROCESSING QUEUE

A system and methods for queuing processing jobs. The system is configured to receive a processing job associated with a user; score the processing job; apply one or more bounds; add the processing job to a queue; order the queue based on scores of processing jobs in the queue; and sample processing...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Krieger, Brandon, Larsen, Peter, Prettejohn, Nicolas, Lynch, Matthew, Hegstrom, Eric, Vogelbacher, David, Mecocci, Giulio, Stoll, Sam
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 Krieger, Brandon
Larsen, Peter
Prettejohn, Nicolas
Lynch, Matthew
Hegstrom, Eric
Vogelbacher, David
Mecocci, Giulio
Stoll, Sam
description A system and methods for queuing processing jobs. The system is configured to receive a processing job associated with a user; score the processing job; apply one or more bounds; add the processing job to a queue; order the queue based on scores of processing jobs in the queue; and sample processing jobs from the queue for dispatch for processing. Sampling the jobs from the queues can comprise updating scores, updating application of bounds, and updating ordering of the queue; reading a batch of processing jobs from a top of the queue; attempting to dispatch the processing jobs of the batch for processing; removing from the queue any dispatched processing jobs; increasing the batch size by a constant factor; determining whether a maximum batch size is reached, or all processing jobs in the queue were in the batch.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2023315519A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2023315519A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2023315519A13</originalsourceid><addsrcrecordid>eNrjZNALCPJ3cnTy9PEMDvF0dvTxiVQICPL0D_IM8YxydQGy_Z1dg4M9_dwVAkNdQ115GFjTEnOKU3mhNDeDsptriLOHbmpBfnxqcUFicmpeakl8aLCRgZGxsaGpqaGlo6ExcaoAuvwnNw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>PROBABILISTICALLY PRIORITIZED PROCESSING QUEUE</title><source>esp@cenet</source><creator>Krieger, Brandon ; Larsen, Peter ; Prettejohn, Nicolas ; Lynch, Matthew ; Hegstrom, Eric ; Vogelbacher, David ; Mecocci, Giulio ; Stoll, Sam</creator><creatorcontrib>Krieger, Brandon ; Larsen, Peter ; Prettejohn, Nicolas ; Lynch, Matthew ; Hegstrom, Eric ; Vogelbacher, David ; Mecocci, Giulio ; Stoll, Sam</creatorcontrib><description>A system and methods for queuing processing jobs. The system is configured to receive a processing job associated with a user; score the processing job; apply one or more bounds; add the processing job to a queue; order the queue based on scores of processing jobs in the queue; and sample processing jobs from the queue for dispatch for processing. Sampling the jobs from the queues can comprise updating scores, updating application of bounds, and updating ordering of the queue; reading a batch of processing jobs from a top of the queue; attempting to dispatch the processing jobs of the batch for processing; removing from the queue any dispatched processing jobs; increasing the batch size by a constant factor; determining whether a maximum batch size is reached, or all processing jobs in the queue were in the batch.</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&amp;date=20231005&amp;DB=EPODOC&amp;CC=US&amp;NR=2023315519A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20231005&amp;DB=EPODOC&amp;CC=US&amp;NR=2023315519A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Krieger, Brandon</creatorcontrib><creatorcontrib>Larsen, Peter</creatorcontrib><creatorcontrib>Prettejohn, Nicolas</creatorcontrib><creatorcontrib>Lynch, Matthew</creatorcontrib><creatorcontrib>Hegstrom, Eric</creatorcontrib><creatorcontrib>Vogelbacher, David</creatorcontrib><creatorcontrib>Mecocci, Giulio</creatorcontrib><creatorcontrib>Stoll, Sam</creatorcontrib><title>PROBABILISTICALLY PRIORITIZED PROCESSING QUEUE</title><description>A system and methods for queuing processing jobs. The system is configured to receive a processing job associated with a user; score the processing job; apply one or more bounds; add the processing job to a queue; order the queue based on scores of processing jobs in the queue; and sample processing jobs from the queue for dispatch for processing. Sampling the jobs from the queues can comprise updating scores, updating application of bounds, and updating ordering of the queue; reading a batch of processing jobs from a top of the queue; attempting to dispatch the processing jobs of the batch for processing; removing from the queue any dispatched processing jobs; increasing the batch size by a constant factor; determining whether a maximum batch size is reached, or all processing jobs in the queue were in the batch.</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>eNrjZNALCPJ3cnTy9PEMDvF0dvTxiVQICPL0D_IM8YxydQGy_Z1dg4M9_dwVAkNdQ115GFjTEnOKU3mhNDeDsptriLOHbmpBfnxqcUFicmpeakl8aLCRgZGxsaGpqaGlo6ExcaoAuvwnNw</recordid><startdate>20231005</startdate><enddate>20231005</enddate><creator>Krieger, Brandon</creator><creator>Larsen, Peter</creator><creator>Prettejohn, Nicolas</creator><creator>Lynch, Matthew</creator><creator>Hegstrom, Eric</creator><creator>Vogelbacher, David</creator><creator>Mecocci, Giulio</creator><creator>Stoll, Sam</creator><scope>EVB</scope></search><sort><creationdate>20231005</creationdate><title>PROBABILISTICALLY PRIORITIZED PROCESSING QUEUE</title><author>Krieger, Brandon ; Larsen, Peter ; Prettejohn, Nicolas ; Lynch, Matthew ; Hegstrom, Eric ; Vogelbacher, David ; Mecocci, Giulio ; Stoll, Sam</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2023315519A13</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>Krieger, Brandon</creatorcontrib><creatorcontrib>Larsen, Peter</creatorcontrib><creatorcontrib>Prettejohn, Nicolas</creatorcontrib><creatorcontrib>Lynch, Matthew</creatorcontrib><creatorcontrib>Hegstrom, Eric</creatorcontrib><creatorcontrib>Vogelbacher, David</creatorcontrib><creatorcontrib>Mecocci, Giulio</creatorcontrib><creatorcontrib>Stoll, Sam</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Krieger, Brandon</au><au>Larsen, Peter</au><au>Prettejohn, Nicolas</au><au>Lynch, Matthew</au><au>Hegstrom, Eric</au><au>Vogelbacher, David</au><au>Mecocci, Giulio</au><au>Stoll, Sam</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>PROBABILISTICALLY PRIORITIZED PROCESSING QUEUE</title><date>2023-10-05</date><risdate>2023</risdate><abstract>A system and methods for queuing processing jobs. The system is configured to receive a processing job associated with a user; score the processing job; apply one or more bounds; add the processing job to a queue; order the queue based on scores of processing jobs in the queue; and sample processing jobs from the queue for dispatch for processing. Sampling the jobs from the queues can comprise updating scores, updating application of bounds, and updating ordering of the queue; reading a batch of processing jobs from a top of the queue; attempting to dispatch the processing jobs of the batch for processing; removing from the queue any dispatched processing jobs; increasing the batch size by a constant factor; determining whether a maximum batch size is reached, or all processing jobs in the queue were in the batch.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2023315519A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title PROBABILISTICALLY PRIORITIZED PROCESSING QUEUE
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T13%3A35%3A56IST&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=Krieger,%20Brandon&rft.date=2023-10-05&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2023315519A1%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