On the near-optimality of the shortest-latency-time-first drum scheduling discipline

For computer systems in which it is practical to determine the instantaneous drum position, a popular discipline for determining the sequence in which the records are to be accessed is the so-called shortest-latency-time-first, SLTF, discipline. When a collection of varying-length records is to be a...

Full description

Saved in:
Bibliographic Details
Published in:Communications of the ACM 1973-06, Vol.16 (6), p.352-353
Main Authors: Stone, Harold S., Fuller, Samuel H.
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-c307t-7707933491aaafc2cb7fbd4e5615a590da982108afb2b9d10fd690546ddb12233
cites cdi_FETCH-LOGICAL-c307t-7707933491aaafc2cb7fbd4e5615a590da982108afb2b9d10fd690546ddb12233
container_end_page 353
container_issue 6
container_start_page 352
container_title Communications of the ACM
container_volume 16
creator Stone, Harold S.
Fuller, Samuel H.
description For computer systems in which it is practical to determine the instantaneous drum position, a popular discipline for determining the sequence in which the records are to be accessed is the so-called shortest-latency-time-first, SLTF, discipline. When a collection of varying-length records is to be accessed from specified drum positions, it is known that the SLTF discipline does not necessarily minimize the drum latency time. However, we show that the total time to access the entire collection for any SLTF schedule is never as much as a drum revolution longer than a minimum latency schedule.
doi_str_mv 10.1145/362248.362257
format magazinearticle
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28985423</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28985423</sourcerecordid><originalsourceid>FETCH-LOGICAL-c307t-7707933491aaafc2cb7fbd4e5615a590da982108afb2b9d10fd690546ddb12233</originalsourceid><addsrcrecordid>eNotkDtPxDAQhC0EEuGgpE9F52Ntx3FcohMv6aRrjtpy_CBBeWE7xf17cheq2V19Ws0MQo8EtoQU_JmVlBbV9ixcXKGMcC6wYERcowwACAZR0Vt0F-PPsgIveYaOhyFPjcsHpwMep9T2umvTKR_95RybMSQXE-50coM54QVw2LchptyGuc-jaZydu3b4zm0bTTsto7tHN1530T386wZ9vb0edx94f3j_3L3ssWEgEhYChGSskERr7Q01tfC1LRwvCddcgtWyogQq7WtaS0vA21ICL0pra0IpYxv0tP6dwvg7LzZVv3hwXacHN85R0UpWvLiAeAVNGGMMzqspLEnDSRFQ5-7U2p1au2N_y31h5A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>magazinearticle</recordtype><pqid>28985423</pqid></control><display><type>magazinearticle</type><title>On the near-optimality of the shortest-latency-time-first drum scheduling discipline</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Stone, Harold S. ; Fuller, Samuel H.</creator><creatorcontrib>Stone, Harold S. ; Fuller, Samuel H.</creatorcontrib><description>For computer systems in which it is practical to determine the instantaneous drum position, a popular discipline for determining the sequence in which the records are to be accessed is the so-called shortest-latency-time-first, SLTF, discipline. When a collection of varying-length records is to be accessed from specified drum positions, it is known that the SLTF discipline does not necessarily minimize the drum latency time. However, we show that the total time to access the entire collection for any SLTF schedule is never as much as a drum revolution longer than a minimum latency schedule.</description><identifier>ISSN: 0001-0782</identifier><identifier>EISSN: 1557-7317</identifier><identifier>DOI: 10.1145/362248.362257</identifier><language>eng</language><ispartof>Communications of the ACM, 1973-06, Vol.16 (6), p.352-353</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c307t-7707933491aaafc2cb7fbd4e5615a590da982108afb2b9d10fd690546ddb12233</citedby><cites>FETCH-LOGICAL-c307t-7707933491aaafc2cb7fbd4e5615a590da982108afb2b9d10fd690546ddb12233</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780,27904</link.rule.ids></links><search><creatorcontrib>Stone, Harold S.</creatorcontrib><creatorcontrib>Fuller, Samuel H.</creatorcontrib><title>On the near-optimality of the shortest-latency-time-first drum scheduling discipline</title><title>Communications of the ACM</title><description>For computer systems in which it is practical to determine the instantaneous drum position, a popular discipline for determining the sequence in which the records are to be accessed is the so-called shortest-latency-time-first, SLTF, discipline. When a collection of varying-length records is to be accessed from specified drum positions, it is known that the SLTF discipline does not necessarily minimize the drum latency time. However, we show that the total time to access the entire collection for any SLTF schedule is never as much as a drum revolution longer than a minimum latency schedule.</description><issn>0001-0782</issn><issn>1557-7317</issn><fulltext>true</fulltext><rsrctype>magazinearticle</rsrctype><creationdate>1973</creationdate><recordtype>magazinearticle</recordtype><recordid>eNotkDtPxDAQhC0EEuGgpE9F52Ntx3FcohMv6aRrjtpy_CBBeWE7xf17cheq2V19Ws0MQo8EtoQU_JmVlBbV9ixcXKGMcC6wYERcowwACAZR0Vt0F-PPsgIveYaOhyFPjcsHpwMep9T2umvTKR_95RybMSQXE-50coM54QVw2LchptyGuc-jaZydu3b4zm0bTTsto7tHN1530T386wZ9vb0edx94f3j_3L3ssWEgEhYChGSskERr7Q01tfC1LRwvCddcgtWyogQq7WtaS0vA21ICL0pra0IpYxv0tP6dwvg7LzZVv3hwXacHN85R0UpWvLiAeAVNGGMMzqspLEnDSRFQ5-7U2p1au2N_y31h5A</recordid><startdate>19730601</startdate><enddate>19730601</enddate><creator>Stone, Harold S.</creator><creator>Fuller, Samuel H.</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>19730601</creationdate><title>On the near-optimality of the shortest-latency-time-first drum scheduling discipline</title><author>Stone, Harold S. ; Fuller, Samuel H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c307t-7707933491aaafc2cb7fbd4e5615a590da982108afb2b9d10fd690546ddb12233</frbrgroupid><rsrctype>magazinearticle</rsrctype><prefilter>magazinearticle</prefilter><language>eng</language><creationdate>1973</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Stone, Harold S.</creatorcontrib><creatorcontrib>Fuller, Samuel H.</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>Stone, Harold S.</au><au>Fuller, Samuel H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the near-optimality of the shortest-latency-time-first drum scheduling discipline</atitle><jtitle>Communications of the ACM</jtitle><date>1973-06-01</date><risdate>1973</risdate><volume>16</volume><issue>6</issue><spage>352</spage><epage>353</epage><pages>352-353</pages><issn>0001-0782</issn><eissn>1557-7317</eissn><abstract>For computer systems in which it is practical to determine the instantaneous drum position, a popular discipline for determining the sequence in which the records are to be accessed is the so-called shortest-latency-time-first, SLTF, discipline. When a collection of varying-length records is to be accessed from specified drum positions, it is known that the SLTF discipline does not necessarily minimize the drum latency time. However, we show that the total time to access the entire collection for any SLTF schedule is never as much as a drum revolution longer than a minimum latency schedule.</abstract><doi>10.1145/362248.362257</doi><tpages>2</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0001-0782
ispartof Communications of the ACM, 1973-06, Vol.16 (6), p.352-353
issn 0001-0782
1557-7317
language eng
recordid cdi_proquest_miscellaneous_28985423
source Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
title On the near-optimality of the shortest-latency-time-first drum scheduling discipline
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T19%3A13%3A17IST&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=On%20the%20near-optimality%20of%20the%20shortest-latency-time-first%20drum%20scheduling%20discipline&rft.jtitle=Communications%20of%20the%20ACM&rft.au=Stone,%20Harold%20S.&rft.date=1973-06-01&rft.volume=16&rft.issue=6&rft.spage=352&rft.epage=353&rft.pages=352-353&rft.issn=0001-0782&rft.eissn=1557-7317&rft_id=info:doi/10.1145/362248.362257&rft_dat=%3Cproquest_cross%3E28985423%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c307t-7707933491aaafc2cb7fbd4e5615a590da982108afb2b9d10fd690546ddb12233%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=28985423&rft_id=info:pmid/&rfr_iscdi=true