When multiple outstanding requests are present in the I/O system, the order of servicing these requests has an important impact on the throughput of the system. Although disk scheduling is a well-studied problem, eager-writing presents a new challenge and a new opportunity. The challenge is that the physical locations of the write requests are unknown at the time the requests are queued. The opportunity is that the flexibility afforded by data location independence may enable an intelligent scheduler to achieve greater throughput. In this section, we first examine a number of eager-writing schedulers for a single disk; we then describe how we perform global scheduling across multiple disks in an EW-Array.