Data storage device with histogram of idle time and scheduling of background and foreground jobs
A data storage device includes a cumulative data histogram of lengths of idle times between foreground user service requests. The cumulative data histogram is updated with measured lengths of current idle times between successive user service requests. Background service request are scheduled following a user service request after a time delay that is controlled as a function of the cumulative data histogram and a calculated length of a busy time of the background service request.
1. An apparatus comprising:
a cumulative data histogram comprising a distribution of past lengths of idle times;
an update circuit that updates the cumulative data histogram with lengths of current idle times; and
a schedule circuit that schedules a background service request following a user service request after a time delay that is controlled as a schedule function of the cumulative data histogram and a calculated length of a busy time of the background service request.
2. The apparatus of claim 1 wherein the schedule function maintains a performance level of an average wait time for starting service of foreground user service requests.
3. The apparatus of claim 1 wherein the time delay is controlled to maintain a performance level of an average wait time by dynamically responding to a distribution of idle times obtained by on line monitoring of recent idle times.
4. The apparatus of claim 1 wherein the schedule circuit schedules multiple background service requests during an idle time as a function of the cumulative data histogram.
5. The apparatus of claim 1 wherein the schedule circuit computes an acceptable delay for an incoming foreground busy period without violating a foreground service average performance target.
6. The apparatus of claim 1 wherein the schedule function comprises an idle waiting algorithm that avoids scheduling background tasks during short idle times.
7. The apparatus of claim 1 wherein the schedule function comprises a limit of the amount of background service requests that are serviced during an idle time.
8. The apparatus of claim 1 wherein starting of service of unstarted background service requests is preempted by arrival of a foreground user service request.
9. The apparatus of claim 1 wherein the schedule circuit provides a schedule, based on buffer space limitations, when the background service requests are more than what can be served in the available idle times and when the background service requests can be fit in the available idle times.
10. A data storage device, comprising:
data storage media having stored thereon a cumulative data histogram comprising a distribution of past lengths of idle times of the data storage device; and
a data storage device controller coupled to the data storage media and comprising an update circuit that updates the cumulative data histogram with lengths of idle times, and comprising a schedule circuit that schedules a background service request following a user service request after a time delay that is controlled as a function of the cumulative data histogram.
11. The data storage device of claim 10 wherein the data storage media comprises magnetic storage media.
12. The data storage device of claim 10 wherein the data storage media comprises ferroelectric storage media.
13. The data storage device of claim 10 wherein the data storage media comprises flash memory media.
14. The data storage device of claim 10 wherein the schedule circuit reduces an average wait time for starting service of the user service request.
15. The data storage device of claim 10 wherein the time delay is controlled to dynamically respond to a distribution of idle times obtained by on line monitoring of recent idle times.
16. The data storage device of claim 10 wherein the schedule circuit schedules multiple background service requests as a function of the cumulative data histogram.
17. The data storage device of claim 10 wherein the schedule circuit computes an acceptable delay for an incoming foreground busy period without violating a foreground service average performance target.
18. The data storage device of claim 10 wherein the schedule circuit comprises an idle waiting algorithm that avoids scheduling background tasks during short idle periods.
19. A method comprising:
providing a cumulative data histogram comprising a distribution of past lengths of idle times between successive foreground user service requests;
updating the cumulative data histogram with measured lengths of current idle times between successive user service requests; and
scheduling a background service request following a user service request after a time delay that is controlled as a schedule function of the cumulative data histogram and a calculated length of a busy time of the background service request.
20. The method of claim 19 wherein the cumulative data histogram comprises 3-tuples of comprising a smallest point in a range of idle length intervals, an empirical probability of occurrence of an idle interval, and an empirical cumulative probability of an idle interval.