Aspects of Path Sharing in I/OUniversity of California, Santa Cruz, Computer Research Laboratory, 1987 - Computer input-output equipment - 36 pages |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Common terms and phrases
approach assume asynchronous I/O ba bandwidth left buffer ports buffer transfer channel and device channel to buffer channel transfer class i actuators class loss model classes of requests coefficient of variation Computer conditional expected confidence intervals consider control unit corresponding DASD reconnection DASD workload denote different speeds disks sharing evaluate example expected number Figure groups of disks Hez ſue I/O service I/O transfer paths iteration least ba bandwidth loss system Mbytes/s missed reconnection delay number of class numbers of servers overl overl apped overlapped organization overlapped transfers paths are busy probability of success propose a simple queueing models Random Number read access reconnection attempt relative performance merits request of class request sources resource Rotational Position Sensing seek and latency sequential accesses sequential organization sharing of I/O simulation results solution string paths success probability successful reconnection total bandwidth total I/O transfer organizations varying number
Bibliographic information
| Title | Aspects of Path Sharing in I/O Technical report (University of California, Santa Cruz. Computer Research Laboratory) |
| Author | Alexandre Brandwajn |
| Contributor | University of California, Santa Cruz. Computer Research Laboratory |
| Publisher | University of California, Santa Cruz, Computer Research Laboratory, 1987 |
| Original from | the University of California |
| Digitized | Nov 5, 2009 |
| Length | 36 pages |
| Export Citation | BiBTeX EndNote RefMan |