US5500803A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Motion optimization for a tape storage system
Assignee: Storage Technology Corp
•
Filing: 1993-11-23
•
Granted: 1996-03-19
•
Expires: 2013-11-23
Abstract
Abstract An automated cartridge system optimizes the time it takes to execute a series of cartridge requests. After cartridge requests are received, the library controller calculates the approximate time it will take to execute each possible sequence of pending cartridge requests. The library controller then executes the first request in the sequence of pending requests which will take the shortest elapsed time. This series of calculations and executions continues until all requests are completed. It is another object of the present invention to carry out the motion optimization in such a manner that assures that a particular cartridge request is not put off indefinitely. Each time a hand or arm is allocated to a request, all other requests waiting for these mechanisms have their calculated execution times reduced to increase the likelihood of execution.
Inventors
- 👤 Frederick Munro
- 👤 Aaron Dailey
- 👤 Richard Defouw
- 👤 David Trachy
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 23:04
CPC Classifications
G; G11; G11B; G11B15/00; G11B15/675; G11B15/68; G11B15/682; G11B15/6835; G11B27/00; G11B27/002; G11B2220/00; G11B2220/40; G11B2220/41; G11B2220/90
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
84 words
An apparatus for transferring objects between locations in a multi-dimensional storage array in response to n pending requests to transfer objects, where n≧2, comprising: a robot for transferring said objects between locations in said storage array; and a library controller having: means for controlling said robot in response to the pending requests to transfer objects; and means for determining the shortest possible time to execute m pending requests, where 2≦m≦n, by considering the time to execute differently ordered sequences of the m pending requests.
Claim 2
Independent Claim
84 words
An apparatus for transferring objects between locations in a multi-dimensional storage array in response to n pending requests to transfer objects, where n≧2, comprising: a robot for transferring said objects between locations in said storage array; and a library controller having: means for controlling said robot in response to the pending requests to transfer objects; and means for determining the shortest possible time to execute m pending requests, where 2≦m≦n, by considering the time to execute differently ordered sequences of the m pending requests.
Claim 3
Dependent Claim
56 words
The apparatus of claim 1, wherein the determining means includes: means for ordering different sequences for executing m requests to transfer objects between locations; means for computing the time to execute different sequences of m requests; and means for selecting for execution a first request in the sequence of m requests having the shortest execution time.
Claim 4
Dependent Claim
16 words
The apparatus of claim 1 further comprising means for moving said robot to execute the requests.
Claim 5
Dependent Claim
63 words
The apparatus of claim 1, wherein the determining means includes: means for determining different sequences for executing m requests to transfer objects between locations; means for computing the time to execute different sequences of m requests to transfer objects between locations; and means for selecting for execution a first request in the sequence of m requests to transfer having the shortest execution time.
Claim 6
Dependent Claim
23 words
The apparatus of claim 1, wherein the determining means includes means for calculating the time to execute a request to transfer an object.
Claim 7
Dependent Claim
31 words
The apparatus of claim 5, the determining means further including means for reducing the calculated time to execute a request to transfer an object to increase the likelihood of its execution.
Claim 8
Dependent Claim
28 words
The apparatus of claim 1, wherein the determining means includes means for executing a procedure for selecting the shortest possible time to execute m requests to transfer objects.
Claim 9
Independent Claim
66 words
A method of transferring objects between locations in a multi-dimensional storage array with robotic means comprising the steps of: controlling said robot means in response to n pending requests to transfer objects between locations in the array, where n≧2; and determining the shortest possible time to execute m pending requests, where 2≦m≦n, by considering the time to execute differently ordered sequences of the m pending requests.
Claim 10
Independent Claim
66 words
A method of transferring objects between locations in a multi-dimensional storage array with robotic means comprising the steps of: controlling said robot means in response to n pending requests to transfer objects between locations in the array, where n≧2; and determining the shortest possible time to execute m pending requests, where 2≦m≦n, by considering the time to execute differently ordered sequences of the m pending requests.
Claim 11
Dependent Claim
31 words
The method of claim 8 wherein the requests are assigned a priority and the m pending requests are those requests having a priority greater than or equal a predetermined threshold priority.
Claim 12
Dependent Claim
18 words
The method of claim 8, further comprising the step of moving said robotic means to execute the requests.
Claim 13
Dependent Claim
62 words
The method of claim 8, the step of determining the shortest possible time comprising the steps of: determining different sequences for executing m requests to transfer objects between locations; computing the time to execute different sequences of m requests to transfer objects between locations; and selecting for execution a first request in the sequence of m requests having the shortest execution time.
Claim 14
Dependent Claim
28 words
The method of claim 8, the step of determining the shortest possible time comprising the step of calculating the time to execute a request to transfer an object.
Claim 15
Dependent Claim
37 words
The method of claim 12, the step of determining the shortest possible time further comprising the step of reducing the calculated time to execute a request to transfer an object to increase the likelihood of its execution.
Claim 16
Dependent Claim
33 words
The method of claim 8, the step of determining the shortest possible time comprising the step of executing a procedure for selecting the shortest possible time to execute m requests to transfer objects.
Claim 17
Independent Claim
77 words
An apparatus for transferring objects between locations in a multi-dimensional storage array in response to n pending requests to transfer objects, where n≧2, comprising: a robot for transferring said objects between locations in said storage array; and a library controller having: means for controlling said robot in response to the pending requests to transfer objects; and means for determining a shortest sequence to execute m pending requests, where 2≦m≦n by considering differently ordered sequences of pending requests.
Claim 18
Independent Claim
77 words
An apparatus for transferring objects between locations in a multi-dimensional storage array in response to n pending requests to transfer objects, where n≧2, comprising: a robot for transferring said objects between locations in said storage array; and a library controller having: means for controlling said robot in response to the pending requests to transfer objects; and means for determining a shortest sequence to execute m pending requests, where 2≦m≦n by considering differently ordered sequences of pending requests.
Claim 19
Dependent Claim
31 words
The apparatus of claim 15, wherein the requests are assigned a priority and the m requests are those requests having a priority greater than or equal to a predetermined threshold priority.
Claim 20
Dependent Claim
21 words
The apparatus of claim 15 further comprising means for moving said robot to execute the first request in the shortest sequence.
Claim 21
Dependent Claim
44 words
The apparatus of claim 15, wherein the determining means includes: means for ordering different sequences of m requests; means for computing the time to execute the different sequences of m requests; and means for selecting for execution a first request in the shortest sequence.
Claim 22
Dependent Claim
23 words
The apparatus of claim 15, wherein the determining means includes means for calculating the time to execute a request to transfer an object.
Claim 23
Dependent Claim
31 words
The apparatus of claim 19, the determining means further including means for reducing the calculated time to execute a request to transfer an object to increase the likelihood of its execution.
Claim 24
Dependent Claim
66 words
The apparatus of claim 15, wherein the determining means includes means for executing a procedure for selecting the shortest sequence to execute m requests to transfer objects, the procedure comprising the steps of: calculating the time to execute a first request to transfer an object; and recursively calling the procedure for selecting the shortest sequence where the procedure is passed the requests less the first request.
Claim 25
Independent Claim
59 words
A method of transferring objects between locations in a multi-dimensional storage array with robotic means comprising the steps of: controlling said robot means in response to n pending requests to transfer objects between locations in the array, where n≧2; and determining a shortest sequence to execute m pending requests, where 2≦m≦n by considering differently ordered sequences of pending requests.
Claim 26
Independent Claim
59 words
A method of transferring objects between locations in a multi-dimensional storage array with robotic means comprising the steps of: controlling said robot means in response to n pending requests to transfer objects between locations in the array, where n≧2; and determining a shortest sequence to execute m pending requests, where 2≦m≦n by considering differently ordered sequences of pending requests.
Claim 27
Dependent Claim
33 words
The method of claim 22 wherein the requests are assigned a priority and the m pending requests are only those requests having a priority greater than or equal to a predetermined threshold priority.
Claim 28
Dependent Claim
23 words
The method of claim 22, further comprising the step of moving said robotic means to execute the first request in the shortest sequence.
Claim 29
Dependent Claim
44 words
The method of claim 22, the step of determining the shortest sequence comprising the steps of: ordering different sequences of m requests; computing the time to execute the different sequences of m requests; and selecting for execution a first request in the shortest sequence.
Claim 30
Dependent Claim
27 words
The method of claim 22, the step of determining the shortest sequence comprising the step of calculating the time to execute a request to transfer an object.
Claim 31
Dependent Claim
36 words
The method of claim 26, the step of determining the shortest sequence further comprising the step of reducing the calculated time to execute a request to transfer an object to increase the likelihood of its execution.
Claim 32
Dependent Claim
70 words
The method of claim 22, the step of determining the shortest sequence comprising the step of executing a procedure for selecting the shortest sequence to execute m requests to transfer objects, the procedure comprising the steps of: calculating the time to execute a first request to transfer an object; and recursively calling the procedure for selecting the shortest sequence where the procedure is passed the requests less the first request.
References Cited (Backward Citations)
US4812629A
Cited
US4864511A
Cited
US4928245A
Cited
US4932826A
Cited
US4864438A
Cited
US4945429A
Cited
US5175690A
Cited
US5121483A
Cited
US5287459A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-03-19 | 1999-09-18 | 2000-03-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-03-19 | 2003-09-18 | 2004-03-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-03-19 | 2007-09-18 | 2008-03-19 | $7700.00 | Window Closed / Lapsed |