System for performing action by sorting actions into immediate and deferred queues, processing immediate queue while still sorting, and appending deferred queue to immediate after sorting
US5623693A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Feb 17, 1994 |
| Grant date | Apr 22, 1997 |
| Priority date | — |
| Expiry date | Feb 17, 2014 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F3/0686
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A procedure for the optimal processing of variable-cost actions such as encountered in the storage reclamation procedures for a multivolume data library. The procedure introduces a temporary processing queue to minimize idle processing capacity during the scanning and sorting of a large plurality of variable-cost actions such as the recycling of a plurality of data storage volumes each having a variable recycle processing cost related to the action of valid data remaining on the volume. Volumes (actions) are selected for the immediate queue according to a dynamically-adjusted threshold test for the processing cost. This processing cost threshold is dynamically adjusted to optimize the immediate queue in relation to the available processing capacity. After scanning and sorting all volumes according to recycle processing cost, the temporary (immediate) queue is updated to a final recycle processing queue by appending a sorted deferred queue to the remainder of the immediate queue. The procedure of this invention minimizes idle processing capacity during the queue-building interval, thereby optimizing the number of recovered data storage volumes released in a given time interval.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.