Footnotes

 

(1)

We do not report on commercial systems due to lack of their implementation detail, see [Nat95] for an overview of these systems.

 

(2)

With the buffered interface of the HP-UX file system, one might read and write a single byte. This functionality is supported by a buffer pool manager that translates this byte read/write to a (1)/(2)KByte read/write against the physical device.

 

(3)

The size of a page has no impact on the granularity at which a process might read a section. This is detailed below.

 

(4)

To simplify the discussion, assume that the total number of pages is a power of . The general case can be handled similarly and is described below.

 

(5)

A lazy variant of this scheme would allow these lists to grow longer and do compaction upon demand, i.e., when large contiguous pages are required. This would be complicated as a variety of choices might exist when merging pages. This would require the system to employ heuristic techniques to guide the search space of this merging process. However, to simplify the description we focus on an implementation that observes the invariant described above.

 

(6)

We intend to implement VARB in the near future.

 

(7)

This web site is maintained by Daniel Tobias (http://www.softdisk.com/comp/hits/). The ranking of the clips is determined through voting by the Internet community, via E-mail.

 

(8)

Thirteen is computed based on the bandwidth of the innermost zone, consumption rate of CD-quality audio, and maximum seek and rotational latency times.

 

(9)

However, the results are presented such that one can estimate the performance of the system with unreasonable choice of d and k values.