Without such skew the head would be moved to the next track but the desired

boring tracks). Without such skew, the head would be moved to the next track but the desired next block would have already rotated under the head, and thus the drive would have to wait almost the entire rotational delay to access the next block. Another reality is that outer tracks tend to have more sectors than inner tracks, which is a result of geometry; there is simply more room out there. These tracks are often referred to as multi-zoned disk drives, where the disk is organized into multiple zones, and where a zone is con- secutive set of tracks on a surface. Each zone has the same number of sectors per track, and outer zones have more sectors than inner zones. Finally, an important part of any modern disk drive is its cache , for historical reasons sometimes called a track buffer . This cache is just some small amount of memory (usually around 8 or 16 MB) which the drive can use to hold data read from or written to the disk. For example, when reading a sector from the disk, the drive might decide to read in all of the sectors on that track and cache them in its memory; doing so allows the drive to quickly respond to any subsequent requests to the same track. On writes, the drive has a choice: should it acknowledge the write has completed when it has put the data in its memory, or after the write has actually been written to disk? The former is called write back caching (or sometimes immediate reporting ), and the latter write through . Write back caching sometimes makes the drive appear “faster”, but can be dan- gerous; if the file system or applications require that data be written to disk in a certain order for correctness, write-back caching can lead to problems (read the chapter on file-system journaling for details). c circlecopyrt 2014, A RPACI -D USSEAU T HREE E ASY P IECES

6 H ARD D ISK D RIVES A SIDE : D IMENSIONAL A NALYSIS Remember in Chemistry class, how you solved virtually every prob- lem by simply setting up the units such that they canceled out, and some- how the answers popped out as a result? That chemical magic is known by the highfalutin name of dimensional analysis and it turns out it is useful in computer systems analysis too. Let’s do an example to see how dimensional analysis works and why it is useful. In this case, assume you have to figure out how long, in mil- liseconds, a single rotation of a disk takes. Unfortunately, you are given only the RPM of the disk, or rotations per minute . Let’s assume we’re talking about a 10K RPM disk (i.e., it rotates 10,000 times per minute). How do we set up the dimensional analysis so that we get time per rota- tion in milliseconds? To do so, we start by putting the desired units on the left; in this case, we wish to obtain the time (in milliseconds) per rotation, so that is ex- actly what we write down: Time ( ms ) 1 Rotation . We then write down everything we know, making sure to cancel units where possible. First, we obtain 1 minute 10 , 000 Rotations (keeping rotation on the bottom, as that’s where it is on the left), then transform minutes into seconds with 60 seconds 1 minute