A unifying approach to scheduling

This paper presents a scheme for classifying scheduling algorithms based on an abstract model of a scheduling system which formalizes the notion of priority. Various classes of scheduling algorithms are defined and related to existing algorithms. A criterion for the implementation efficiency of an a...

Full description

Saved in:
Bibliographic Details
Published in:Communications of the ACM 1977-07, Vol.20 (7), p.469-477
Main Authors: Ruschitzka, Manfred, Fabry, R. S.
Format: Magazinearticle
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c305t-6a58b8811ca17c8e2735034c1a9580d06f304409af3ca2a48b0c44fead9027b03
cites cdi_FETCH-LOGICAL-c305t-6a58b8811ca17c8e2735034c1a9580d06f304409af3ca2a48b0c44fead9027b03
container_end_page 477
container_issue 7
container_start_page 469
container_title Communications of the ACM
container_volume 20
creator Ruschitzka, Manfred
Fabry, R. S.
description This paper presents a scheme for classifying scheduling algorithms based on an abstract model of a scheduling system which formalizes the notion of priority. Various classes of scheduling algorithms are defined and related to existing algorithms. A criterion for the implementation efficiency of an algorithm is developed and results in the definition of time-invariant algorithms, which include most of the commonly implemented ones. For time-invariant algorithms, the dependence of processing rates on priorities is derived. The abstract model provides a framework for implementing flexible schedulers in real operating systems. The policy-driven scheduler of Bernstein and Sharp is discussed as an example of
doi_str_mv 10.1145/359636.359643
format magazinearticle
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28956683</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28956683</sourcerecordid><originalsourceid>FETCH-LOGICAL-c305t-6a58b8811ca17c8e2735034c1a9580d06f304409af3ca2a48b0c44fead9027b03</originalsourceid><addsrcrecordid>eNotkL1PwzAUxC0EEqUwsoeFzeU5z18Zq4ovqRILzNaLY9OgNAlxMvS_J1WYTnc6nU4_xu4FbISQ6glVoVFvziLxgq2EUoYbFOaSrQBAcDA2v2Y3Kf3MFpRWK_awzaa2jqe6_c6o74eO_CEbuyz5Q6imZo5v2VWkJoW7f12zr5fnz90b33-8vu-2e-4R1Mg1KVtaK4QnYbwNuUEFKL2gQlmoQEcEKaGgiJ5ykrYEL2UMVBWQmxJwzR6X3fnE7xTS6I518qFpqA3dlFxuC6W1xbnIl6IfupSGEF0_1EcaTk6AO4NwCwi3gMA_GlZN4Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>magazinearticle</recordtype><pqid>28956683</pqid></control><display><type>magazinearticle</type><title>A unifying approach to scheduling</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Ruschitzka, Manfred ; Fabry, R. S.</creator><creatorcontrib>Ruschitzka, Manfred ; Fabry, R. S.</creatorcontrib><description>This paper presents a scheme for classifying scheduling algorithms based on an abstract model of a scheduling system which formalizes the notion of priority. Various classes of scheduling algorithms are defined and related to existing algorithms. A criterion for the implementation efficiency of an algorithm is developed and results in the definition of time-invariant algorithms, which include most of the commonly implemented ones. For time-invariant algorithms, the dependence of processing rates on priorities is derived. The abstract model provides a framework for implementing flexible schedulers in real operating systems. The policy-driven scheduler of Bernstein and Sharp is discussed as an example of</description><identifier>ISSN: 0001-0782</identifier><identifier>EISSN: 1557-7317</identifier><identifier>DOI: 10.1145/359636.359643</identifier><language>eng</language><ispartof>Communications of the ACM, 1977-07, Vol.20 (7), p.469-477</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c305t-6a58b8811ca17c8e2735034c1a9580d06f304409af3ca2a48b0c44fead9027b03</citedby><cites>FETCH-LOGICAL-c305t-6a58b8811ca17c8e2735034c1a9580d06f304409af3ca2a48b0c44fead9027b03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780,27902</link.rule.ids></links><search><creatorcontrib>Ruschitzka, Manfred</creatorcontrib><creatorcontrib>Fabry, R. S.</creatorcontrib><title>A unifying approach to scheduling</title><title>Communications of the ACM</title><description>This paper presents a scheme for classifying scheduling algorithms based on an abstract model of a scheduling system which formalizes the notion of priority. Various classes of scheduling algorithms are defined and related to existing algorithms. A criterion for the implementation efficiency of an algorithm is developed and results in the definition of time-invariant algorithms, which include most of the commonly implemented ones. For time-invariant algorithms, the dependence of processing rates on priorities is derived. The abstract model provides a framework for implementing flexible schedulers in real operating systems. The policy-driven scheduler of Bernstein and Sharp is discussed as an example of</description><issn>0001-0782</issn><issn>1557-7317</issn><fulltext>true</fulltext><rsrctype>magazinearticle</rsrctype><creationdate>1977</creationdate><recordtype>magazinearticle</recordtype><recordid>eNotkL1PwzAUxC0EEqUwsoeFzeU5z18Zq4ovqRILzNaLY9OgNAlxMvS_J1WYTnc6nU4_xu4FbISQ6glVoVFvziLxgq2EUoYbFOaSrQBAcDA2v2Y3Kf3MFpRWK_awzaa2jqe6_c6o74eO_CEbuyz5Q6imZo5v2VWkJoW7f12zr5fnz90b33-8vu-2e-4R1Mg1KVtaK4QnYbwNuUEFKL2gQlmoQEcEKaGgiJ5ykrYEL2UMVBWQmxJwzR6X3fnE7xTS6I518qFpqA3dlFxuC6W1xbnIl6IfupSGEF0_1EcaTk6AO4NwCwi3gMA_GlZN4Q</recordid><startdate>19770701</startdate><enddate>19770701</enddate><creator>Ruschitzka, Manfred</creator><creator>Fabry, R. S.</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19770701</creationdate><title>A unifying approach to scheduling</title><author>Ruschitzka, Manfred ; Fabry, R. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c305t-6a58b8811ca17c8e2735034c1a9580d06f304409af3ca2a48b0c44fead9027b03</frbrgroupid><rsrctype>magazinearticle</rsrctype><prefilter>magazinearticle</prefilter><language>eng</language><creationdate>1977</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Ruschitzka, Manfred</creatorcontrib><creatorcontrib>Fabry, R. S.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Communications of the ACM</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ruschitzka, Manfred</au><au>Fabry, R. S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A unifying approach to scheduling</atitle><jtitle>Communications of the ACM</jtitle><date>1977-07-01</date><risdate>1977</risdate><volume>20</volume><issue>7</issue><spage>469</spage><epage>477</epage><pages>469-477</pages><issn>0001-0782</issn><eissn>1557-7317</eissn><abstract>This paper presents a scheme for classifying scheduling algorithms based on an abstract model of a scheduling system which formalizes the notion of priority. Various classes of scheduling algorithms are defined and related to existing algorithms. A criterion for the implementation efficiency of an algorithm is developed and results in the definition of time-invariant algorithms, which include most of the commonly implemented ones. For time-invariant algorithms, the dependence of processing rates on priorities is derived. The abstract model provides a framework for implementing flexible schedulers in real operating systems. The policy-driven scheduler of Bernstein and Sharp is discussed as an example of</abstract><doi>10.1145/359636.359643</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0001-0782
ispartof Communications of the ACM, 1977-07, Vol.20 (7), p.469-477
issn 0001-0782
1557-7317
language eng
recordid cdi_proquest_miscellaneous_28956683
source Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
title A unifying approach to scheduling
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T01%3A43%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20unifying%20approach%20to%20scheduling&rft.jtitle=Communications%20of%20the%20ACM&rft.au=Ruschitzka,%20Manfred&rft.date=1977-07-01&rft.volume=20&rft.issue=7&rft.spage=469&rft.epage=477&rft.pages=469-477&rft.issn=0001-0782&rft.eissn=1557-7317&rft_id=info:doi/10.1145/359636.359643&rft_dat=%3Cproquest_cross%3E28956683%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c305t-6a58b8811ca17c8e2735034c1a9580d06f304409af3ca2a48b0c44fead9027b03%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=28956683&rft_id=info:pmid/&rfr_iscdi=true