Surveyors Forum High-performance Secondary Memory access, whereas the reading of the parity is followed by a full disk rotation to write it back. We are mainly concerned with homogeneous requests, that is, identically distributed service times for the components of an FJ request, but the following techniques for dealing with interfering requests are applicable to nonhomogeneous requests as well. An exact analysis of FJS for N = 2, Poisson arrivals and exponential service times is given in Flatto and Hahn [ 19841. This result, in conjunction with a scaling approximation, is then used to obtain approximate expressions for R~J for N > 2 servers. This result is utilized in Menon [1994]. More realistic disk-service times are given by the sum of seek, latency, and transfer times. Assuming the independence of successive disk-service times and Poisson arrivals, each disk can be modeled as an M\ G/l queue (see e.g., Chen and Towsley [1993], Thomasian and Menon [ 1994a; 1994b]). Varma and Makowski [1994] develop an approximate method based on interpolation to estimate R~J for the case of general interarrival and service times. The four examples in the paper deal with hyperexponential or Erlang interarrival times with exponential
/lp/association-for-computing-machinery/surveyors-forum-high-performance-secondary-memory-HfxDsxKKHD