Aspects of Path Sharing in I/OUniversity of California, Santa Cruz, Computer Research Laboratory, 1987 - Computer input-output equipment - 36 pages |
From inside the book
Results 1-3 of 3
Page
... relative performance merits of sequential versus overlapped organization of read transfers . The results obtained show that , as the I / O throughput increases , it is possible for the performance of overlapped I / O to become worse ...
... relative performance merits of sequential versus overlapped organization of read transfers . The results obtained show that , as the I / O throughput increases , it is possible for the performance of overlapped I / O to become worse ...
Page 2
... relative performance merits of overlapped and sequential transfer organizations . Therefore , we start by considering the buffered DASD control unit configuration of Figure 1 under simplifying assumptions . The configuration comprises a ...
... relative performance merits of overlapped and sequential transfer organizations . Therefore , we start by considering the buffered DASD control unit configuration of Figure 1 under simplifying assumptions . The configuration comprises a ...
Page 16
... relative performance merits of sequential and overlapped read transfer organizations . The results obtained show that , for higher I / O rates , the performance of overlapped I / O can be worse than that of sequential This due to the ...
... relative performance merits of sequential and overlapped read transfer organizations . The results obtained show that , for higher I / O rates , the performance of overlapped I / O can be worse than that of sequential This due to the ...
Common terms and phrases
a₁ approach assume asynchronous disk I/O asynchronous I/O b₁ buffer ports buffer transfer bus bandwidth channel and device channel to buffer channel transfer class i actuators classes of requests coefficient of variation computed conditional expected confidence intervals consider control unit corresponding DASD reconnection DASD workload denote different numbers different speeds disks sharing example expected number groups of disks I/O rate I/O service I/O transfer paths iteration loss system missed reconnection delay n₁ number of class number of request numbers of servers overlapped organization overlapped transfer organization Overlapped vs sequential ovlap paths are busy probability of success propose a simple queueing models r₁ Random Number read access relative error relative performance merits request of class request sources resource Rotational Position Sensing RPS miss seek and latency sequential organization server utilization sharing of I/O simulation results solution string paths success probabilities successful reconnection T₁ total I/O U₁ varying number W₁