Move-to-rear list scheduling

Move-to-rear list scheduling

A new scheduling method and policy for shared (server) resources, such as the CPU or disk memory of a multiprogrammed data processor. The scheduling is referred to as Move-To-Rear List Scheduling and it provides a cumulative service guarantee and well as more traditional guarantees such as fairness...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: OZDEN, BANU, SILBERSCHATZ, ABRAHAM, GABBER, ERAN, BRUNO, JOHN LOUIS
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
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 OZDEN
BANU
SILBERSCHATZ
ABRAHAM
GABBER
ERAN
BRUNO
JOHN LOUIS
description A new scheduling method and policy for shared (server) resources, such as the CPU or disk memory of a multiprogrammed data processor. The scheduling is referred to as Move-To-Rear List Scheduling and it provides a cumulative service guarantee and well as more traditional guarantees such as fairness (proportional sharing) and bounded delay. In typical operation, a list is maintained for a server of processes seeking service from the server. Processes are admitted to the list only when maximum capacity constraints are not violated, and once on the list, are served in a front-to-back order. After receiving service, or upon the occurrence of other events, the position of the process on the list may be changed.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US5999963A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US5999963A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US5999963A3</originalsourceid><addsrcrecordid>eNrjZJDxzS9L1S3J1y1KTSxSyMksLlEoTs5ITSnNycxL52FgTUvMKU7lhdLcDPJuriHOHrqpBfnxqcUFicmpeakl8aHBppZAYGbsaExYBQAT3iMx</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Move-to-rear list scheduling</title><source>esp@cenet</source><creator>OZDEN; BANU ; SILBERSCHATZ; ABRAHAM ; GABBER; ERAN ; BRUNO; JOHN LOUIS</creator><creatorcontrib>OZDEN; BANU ; SILBERSCHATZ; ABRAHAM ; GABBER; ERAN ; BRUNO; JOHN LOUIS</creatorcontrib><description>A new scheduling method and policy for shared (server) resources, such as the CPU or disk memory of a multiprogrammed data processor. The scheduling is referred to as Move-To-Rear List Scheduling and it provides a cumulative service guarantee and well as more traditional guarantees such as fairness (proportional sharing) and bounded delay. In typical operation, a list is maintained for a server of processes seeking service from the server. Processes are admitted to the list only when maximum capacity constraints are not violated, and once on the list, are served in a front-to-back order. After receiving service, or upon the occurrence of other events, the position of the process on the list may be changed.</description><edition>6</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>1999</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=19991207&amp;DB=EPODOC&amp;CC=US&amp;NR=5999963A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25544,76293</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=19991207&amp;DB=EPODOC&amp;CC=US&amp;NR=5999963A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>OZDEN; BANU</creatorcontrib><creatorcontrib>SILBERSCHATZ; ABRAHAM</creatorcontrib><creatorcontrib>GABBER; ERAN</creatorcontrib><creatorcontrib>BRUNO; JOHN LOUIS</creatorcontrib><title>Move-to-rear list scheduling</title><description>A new scheduling method and policy for shared (server) resources, such as the CPU or disk memory of a multiprogrammed data processor. The scheduling is referred to as Move-To-Rear List Scheduling and it provides a cumulative service guarantee and well as more traditional guarantees such as fairness (proportional sharing) and bounded delay. In typical operation, a list is maintained for a server of processes seeking service from the server. Processes are admitted to the list only when maximum capacity constraints are not violated, and once on the list, are served in a front-to-back order. After receiving service, or upon the occurrence of other events, the position of the process on the list may be changed.</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>1999</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZJDxzS9L1S3J1y1KTSxSyMksLlEoTs5ITSnNycxL52FgTUvMKU7lhdLcDPJuriHOHrqpBfnxqcUFicmpeakl8aHBppZAYGbsaExYBQAT3iMx</recordid><startdate>19991207</startdate><enddate>19991207</enddate><creator>OZDEN; BANU</creator><creator>SILBERSCHATZ; ABRAHAM</creator><creator>GABBER; ERAN</creator><creator>BRUNO; JOHN LOUIS</creator><scope>EVB</scope></search><sort><creationdate>19991207</creationdate><title>Move-to-rear list scheduling</title><author>OZDEN; BANU ; SILBERSCHATZ; ABRAHAM ; GABBER; ERAN ; BRUNO; JOHN LOUIS</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US5999963A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>1999</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>OZDEN; BANU</creatorcontrib><creatorcontrib>SILBERSCHATZ; ABRAHAM</creatorcontrib><creatorcontrib>GABBER; ERAN</creatorcontrib><creatorcontrib>BRUNO; JOHN LOUIS</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>OZDEN; BANU</au><au>SILBERSCHATZ; ABRAHAM</au><au>GABBER; ERAN</au><au>BRUNO; JOHN LOUIS</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Move-to-rear list scheduling</title><date>1999-12-07</date><risdate>1999</risdate><abstract>A new scheduling method and policy for shared (server) resources, such as the CPU or disk memory of a multiprogrammed data processor. The scheduling is referred to as Move-To-Rear List Scheduling and it provides a cumulative service guarantee and well as more traditional guarantees such as fairness (proportional sharing) and bounded delay. In typical operation, a list is maintained for a server of processes seeking service from the server. Processes are admitted to the list only when maximum capacity constraints are not violated, and once on the list, are served in a front-to-back order. After receiving service, or upon the occurrence of other events, the position of the process on the list may be changed.</abstract><edition>6</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US5999963A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Move-to-rear list scheduling
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T01%3A27%3A53IST&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=OZDEN;%20BANU&rft.date=1999-12-07&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS5999963A%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