Write procedure using estimated best setting in first run
First Claim
Patent Images
1. A tape drive system, comprising:
- a read channel;
a write channel;
logic configured to receive a request for a write operation to be performed in a tape drive;
logic configured to determine an optimum write procedure from among a plurality of candidate write procedures in response to receiving the request, the plurality of candidate write procedures comprising;
a backhitch (BH) write procedure,a same wrap backhitchless flush (SWBF) write procedure, anda recursively accumulating backhitchless flush (RABF) write procedure, andwherein determining the optimum write procedure is based on expected writing times of each of the plurality of candidate write procedures and an expected transaction size of a next write operation; and
logic configured to invoke the determined optimum write procedure in response to determining the optimum write procedure.
1 Assignment
0 Petitions
Accused Products
Abstract
In one general embodiment, a tape drive system includes: a read channel; a write channel; logic configured to receiving a request for a write operation to be performed in a tape drive; logic configured to determine an optimum a write procedure in response to receiving the request, the determining being based on expected writing times of each of a plurality of write procedures and an expected transaction size of a next write operation; and logic configured to invoke the determined optimum write procedure in response to determining the optimum write procedure.
21 Citations
20 Claims
-
1. A tape drive system, comprising:
-
a read channel; a write channel; logic configured to receive a request for a write operation to be performed in a tape drive; logic configured to determine an optimum write procedure from among a plurality of candidate write procedures in response to receiving the request, the plurality of candidate write procedures comprising; a backhitch (BH) write procedure, a same wrap backhitchless flush (SWBF) write procedure, and a recursively accumulating backhitchless flush (RABF) write procedure, and wherein determining the optimum write procedure is based on expected writing times of each of the plurality of candidate write procedures and an expected transaction size of a next write operation; and logic configured to invoke the determined optimum write procedure in response to determining the optimum write procedure. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19)
-
-
11. A computer program product comprising non-transitory computer readable program code embodied on a computer readable storage medium, the computer readable program code comprising:
-
computer readable program code configured to receiving a request for a write operation to be performed in a tape drive; computer readable program code configured to determine an expected transaction size of a next write operation; computer readable program code configured to compare the expected transaction size of the next write operation to each of a first transaction size threshold and a second transaction size threshold in response to receiving the request; computer readable program code configured to determine an optimum write procedure based at least in part on the comparison; and computer readable program code configured to invoke the optimum write procedure in response to determining the optimum write procedure, wherein the first transaction size threshold is greater than the second transaction size threshold, and wherein the optimum write procedure is selected from the group consisting of;
a backhitch write procedure, a same wrap backhitchless flush (SWBF) write procedure, and a recursively accumulating backhitchless flush (RABF) write procedure.
-
-
20. A tape drive system, comprising:
-
a read channel; a write channel; logic configured to receive a request for a write operation to be performed in a tape drive; logic configured to determine an optimum write procedure from among a plurality of candidate write procedures, the plurality of candidate write procedures comprising; a backhitch (BH) write procedure, a same wrap backhitchless flush (SWBF) write procedure, and a recursively accumulating backhitchless flush (RABF) write procedure; and logic configured to invoke the determined optimum write procedure in response to determining the optimum write procedure; and wherein the determining is based at least in part on; an expected writing time for each of the plurality of candidate write procedures; an expected time remaining until a next write operation; and an expected transaction size of the next write operation.
-
Specification