Efficient scalable I/O scheduling
US9436391B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 28, 2014 |
| Grant date | Sep 6, 2016 |
| Priority date | — |
| Expiry date | Mar 28, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F3/0653
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An input/output (I/O) request is dispatched. A determination is made regarding a storage volume to service. A determination is made regarding whether an actual disk throughput exceeds a first threshold rate. The first threshold rate exceeds a reserved disk throughput. Responsive to determining that the actual disk throughput exceeds the first threshold rate, a first storage volume is selected based on credits or based on priority. Responsive to determining that the actual disk throughput does not exceed the first threshold rate, a second storage volume is selected based on guaranteed minimum I/O rate. An I/O request queue associated with the determined storage volume is determined. An I/O request is retrieved from the determined I/O request queue. The retrieved I/O request is sent to a persistence layer that includes the selected storage volume.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.