Assigning read requests based on busyness of devices
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jan 23, 2018
Issued Date -
N/A
app pub date -
Aug 24, 2015
filing date -
Dec 21, 2010
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
Techniques are provided for assigning read requests to storage devices in a manner that reduces the likelihood that any storage device will become overloaded or underutilized. Specifically, a read-request handler assigns read requests that are directed to each particular item among the storage devices that have copies of the item based on how busy each of those storage devices is. Consequently, even though certain storage devices may have copies of the same item, there may be times during which one storage device is assigned a disproportionate number of the reads of the item because the other storage device is busy with read requests for other items, and there may be other times during which other storage device is assigned a disproportionate number of the reads of the item because the one storage device is busy with read request for other items. Various techniques for estimating the busyness of storage devices are provided, including fraction-based estimates, interval-based estimates, and the response-time-based estimates. Techniques for smoothing those estimates, and for handicapping devices, are also provided.
First Claim
Other Claims data not available
Family
International Classification(s)
- 2015 Application Filing Year
- G06F Class
- 57200 Applications Filed
- 45873 Patents Issued To-Date
- 80.20 % Issued To-Date
Cited Art Landscape
Patent Citation Ranking
- 0 Citation Count
- G06F Class
- 0 % this patent is cited more than
- 7 Age
Maintenance Fees
| Fee | Large entity fee | small entity fee | micro entity fee | due date |
|---|---|---|---|---|
| 7.5 Year Payment | $3600.00 | $1800.00 | $900.00 | Jul 23, 2025 |
| 11.5 Year Payment | $7400.00 | $3700.00 | $1850.00 | Jul 23, 2029 |
