Search⌘ K
AI Features

Storing Files on Tape

Explore how greedy algorithms help optimize the order of storing files on magnetic tape to minimize access times. Understand how file lengths and access frequencies influence the best ordering strategy. Learn to apply proofs showing sorting by file length or by length-to-frequency ratio leads to minimal expected access cost.

Introduction to storing files

Suppose we have a set of nn files that we want to store on magnetic tape. In the future, users will want to read those files from the tape. Reading a file from tape isn’t ...