Skip to main content

An optimal drum scheduling algorithm

  • Chapter
  • First Online:
  • 2036 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 31))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1975). An optimal drum scheduling algorithm. In: Analysis of drum and disk storage units. Lecture Notes in Computer Science, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07186-5_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-07186-5_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07186-0

  • Online ISBN: 978-3-540-37532-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics