Patent US2573337A successfully refreshed from Google Patents.
Patent US5293606A successfully refreshed from Google Patents.
US5293606A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for transferring interleaved data objects in mass storage devices into separate destinations in memory
Assignee: Gateway Inc
•
Filing: 1991-04-02
•
Granted: 1994-03-08
•
Expires: 2011-04-02
Abstract
Abstract A system for transferring interleaved data objects in mass storage devices into separate destinations in a system memory is described. The method includes the steps of determining for each of the data objects a destination address and a size; one time seeking of a data object from a location of the mass storage means; transferring data from the data object into the destination address, wherein the data has a size equal to the size for the data object; and repeating the transferring step for subsequent data objects.
Inventors
- 👤 Carl E. Sassenrath
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 17:20
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/06; G06F3/0601; G06F13/00; G06F13/14; G06F13/20; G06F13/28; G06F3/0602; G06F3/061; G06F3/0611; G06F3/0628; G06F3/0646; G06F3/0647; G06F3/0655; G06F3/0656; G06F3/0668; G06F3/0671; G06F3/0673; G06F3/0674; G06F3/0677
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
136 words
In a computer system having a memory and a optical storage means, said optical storage means interleaving a plurality of data objects into a location and said optical storage means having a plurality of locations sequentially arranged, a method for transferring the data objects into separate destinations in the memory comprising the steps of: (a) constructing a transfer list having a plurality of nodes, wherein said nodes include size and destination information of the data objects; (b) seeking once a data object at a location of the optical storage means; (c) determining from a next node a size and a destination address for the data object; and (d) transferring data from the data objects into the memory at said destination address, wherein said transferred data has a size equal to the size for the data object.
Claim 2
Dependent Claim
136 words
In a computer system having a memory and a optical storage means, said optical storage means interleaving a plurality of data objects into a location and said optical storage means having a plurality of locations sequentially arranged, a method for transferring the data objects into separate destinations in the memory comprising the steps of: (a) constructing a transfer list having a plurality of nodes, wherein said nodes include size and destination information of the data objects; (b) seeking once a data object at a location of the optical storage means; (c) determining from a next node a size and a destination address for the data object; and (d) transferring data from the data objects into the memory at said destination address, wherein said transferred data has a size equal to the size for the data object.
Claim 3
Dependent Claim
54 words
The method of claim 1, wherein said node includes a pointer to a next node in the transfer list, a pointer specifying memory location storing the data from the data object, a length of the data to transfer from the data object, and a length of the data actually transferred from the data object.
Claim 4
Dependent Claim
16 words
The method of claim 2, wherein said node further includes a pointer to a callback function.
Claim 5
Dependent Claim
76 words
The method of claim 2, wherein step (d) comprises transferring data from the data object into the memory by: (e) transferring the length of the data object if the next node exists; (f) reading the next node if the next node does not exist at step (e); (g) indicating the end of memory access if the next node does not exist at step (f); and (h) repeating step (e) for remaining data in the data object.
Claim 6
Dependent Claim
42 words
The method of claim 2, wherein step (b) comprises seeking a data object at a location of the optical storage means by determining the length and an offset of the data object; and sending a read command to the optical storage means.
Claim 7
Dependent Claim
131 words
In a computer system having a memory and a mass storage means, said mass storage means interleaving a plurality of data objects into a frame and said mass storage means having a plurality of frames sequentially arranged, a method for transferring interleaved data objects into separate destinations in the memory comprising the steps of: (a) establishing a transfer list having a plurality of nodes, where each of the nodes includes a size and a destination address for one data object; (b) seeking once a data object from a frame of the mass storage means; (c) reading a node from the transfer list; and (d) transferring data from said one data object to said destination address, wherein said transferred data has a size equal to the size for said one data object.
Claim 8
Dependent Claim
131 words
In a computer system having a memory and a mass storage means, said mass storage means interleaving a plurality of data objects into a frame and said mass storage means having a plurality of frames sequentially arranged, a method for transferring interleaved data objects into separate destinations in the memory comprising the steps of: (a) establishing a transfer list having a plurality of nodes, where each of the nodes includes a size and a destination address for one data object; (b) seeking once a data object from a frame of the mass storage means; (c) reading a node from the transfer list; and (d) transferring data from said one data object to said destination address, wherein said transferred data has a size equal to the size for said one data object.
Claim 9
Dependent Claim
20 words
The method of claim 6, further comprising the step of: (e) repeating steps (c)-(d) for each of said data objects.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-03-07 | 1997-09-06 | 1998-03-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-03-07 | 2001-09-06 | 2002-03-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-03-07 | 2005-09-06 | 2006-03-08 | $7700.00 | Window Closed / Lapsed |