SCHEDULING DEVICE, SCHEDULING SYSTEM, SCHEDULING METHOD, AND NON-TRANSITORY COMPUTER-READABLE MEDIUM

A scheduling device includes at least one storage and at least one processor. The at least one storage stores information regarding jobs in execution. The at least one processor is configured to accept a job, select, when an execution resource for the accepted job is not secured, at least one job wi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: ARAI, Ryota, OMURA, Shingo, TANIWAKI, Taisuke
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 ARAI, Ryota
OMURA, Shingo
TANIWAKI, Taisuke
description A scheduling device includes at least one storage and at least one processor. The at least one storage stores information regarding jobs in execution. The at least one processor is configured to accept a job, select, when an execution resource for the accepted job is not secured, at least one job with a lower priority than the accepted job from the jobs in execution as a stop candidate based on the information regarding the jobs in execution, and issue a stop instruction to the stop candidate.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2021149726A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2021149726A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2021149726A13</originalsourceid><addsrcrecordid>eNrjZEgJdvZwdQn18fRzV3BxDfN0dtVRQBIKjgwOcfVFEfJ1DfHwd9FRcPRzUfDz99MNCXL0C_YM8Q-KVHD29w0IDXEN0g1ydXRxdPJxBSp28Qz15WFgTUvMKU7lhdLcDMpuriHOHrqpBfnxqcUFicmpeakl8aHBRgZGhoYmluZGZo6GxsSpAgAjYTWG</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SCHEDULING DEVICE, SCHEDULING SYSTEM, SCHEDULING METHOD, AND NON-TRANSITORY COMPUTER-READABLE MEDIUM</title><source>esp@cenet</source><creator>ARAI, Ryota ; OMURA, Shingo ; TANIWAKI, Taisuke</creator><creatorcontrib>ARAI, Ryota ; OMURA, Shingo ; TANIWAKI, Taisuke</creatorcontrib><description>A scheduling device includes at least one storage and at least one processor. The at least one storage stores information regarding jobs in execution. The at least one processor is configured to accept a job, select, when an execution resource for the accepted job is not secured, at least one job with a lower priority than the accepted job from the jobs in execution as a stop candidate based on the information regarding the jobs in execution, and issue a stop instruction to the stop candidate.</description><language>eng</language><subject>CALCULATING ; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2021</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=20210520&amp;DB=EPODOC&amp;CC=US&amp;NR=2021149726A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,778,883,25551,76304</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20210520&amp;DB=EPODOC&amp;CC=US&amp;NR=2021149726A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ARAI, Ryota</creatorcontrib><creatorcontrib>OMURA, Shingo</creatorcontrib><creatorcontrib>TANIWAKI, Taisuke</creatorcontrib><title>SCHEDULING DEVICE, SCHEDULING SYSTEM, SCHEDULING METHOD, AND NON-TRANSITORY COMPUTER-READABLE MEDIUM</title><description>A scheduling device includes at least one storage and at least one processor. The at least one storage stores information regarding jobs in execution. The at least one processor is configured to accept a job, select, when an execution resource for the accepted job is not secured, at least one job with a lower priority than the accepted job from the jobs in execution as a stop candidate based on the information regarding the jobs in execution, and issue a stop instruction to the stop candidate.</description><subject>CALCULATING</subject><subject>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2021</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZEgJdvZwdQn18fRzV3BxDfN0dtVRQBIKjgwOcfVFEfJ1DfHwd9FRcPRzUfDz99MNCXL0C_YM8Q-KVHD29w0IDXEN0g1ydXRxdPJxBSp28Qz15WFgTUvMKU7lhdLcDMpuriHOHrqpBfnxqcUFicmpeakl8aHBRgZGhoYmluZGZo6GxsSpAgAjYTWG</recordid><startdate>20210520</startdate><enddate>20210520</enddate><creator>ARAI, Ryota</creator><creator>OMURA, Shingo</creator><creator>TANIWAKI, Taisuke</creator><scope>EVB</scope></search><sort><creationdate>20210520</creationdate><title>SCHEDULING DEVICE, SCHEDULING SYSTEM, SCHEDULING METHOD, AND NON-TRANSITORY COMPUTER-READABLE MEDIUM</title><author>ARAI, Ryota ; OMURA, Shingo ; TANIWAKI, Taisuke</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2021149726A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2021</creationdate><topic>CALCULATING</topic><topic>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>ARAI, Ryota</creatorcontrib><creatorcontrib>OMURA, Shingo</creatorcontrib><creatorcontrib>TANIWAKI, Taisuke</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ARAI, Ryota</au><au>OMURA, Shingo</au><au>TANIWAKI, Taisuke</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SCHEDULING DEVICE, SCHEDULING SYSTEM, SCHEDULING METHOD, AND NON-TRANSITORY COMPUTER-READABLE MEDIUM</title><date>2021-05-20</date><risdate>2021</risdate><abstract>A scheduling device includes at least one storage and at least one processor. The at least one storage stores information regarding jobs in execution. The at least one processor is configured to accept a job, select, when an execution resource for the accepted job is not secured, at least one job with a lower priority than the accepted job from the jobs in execution as a stop candidate based on the information regarding the jobs in execution, and issue a stop instruction to the stop candidate.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2021149726A1
source esp@cenet
subjects CALCULATING
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title SCHEDULING DEVICE, SCHEDULING SYSTEM, SCHEDULING METHOD, AND NON-TRANSITORY COMPUTER-READABLE MEDIUM
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T11%3A02%3A48IST&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=ARAI,%20Ryota&rft.date=2021-05-20&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2021149726A1%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