Patent EP0361683A2 successfully refreshed from Google Patents.
EP0361683A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Data transfer method between memories
Assignee: NCR International Inc
•
Filing: 1989-08-29
•
Granted: —
•
Expires: 2009-08-29
Abstract
Abstract In a method for transferring data from a first memory (26) in a first terminal device (20) to a second memory (26) in a second terminal device (22) the first memory (26 in 20) is divided into a number of partitions (40-1 to 40-N). Stored in the first memory (26 in 20) are a plurality of data bits locating the begin and end blocks (42,44) of data space in each of the partitions (40-1 to 40-N). In the begin block (42) of each partition (40-1 to 40-N) there are stored further data bits identifying the number of freespace maps (62) for its associated partition (40-1 to 40-N) together with the freespace maps (62) identifying the valid data that is to be transferred to the second memory (26 in 22). Using the information contained in the freespace maps (62), a processor transfers the data from the second memory (26 in 20) to the first memory (26 in 22).
Inventors
- 👤 Walter Hannibal Smith, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-05 09:25
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/16; G06F11/20; G06F11/2053; G06F11/2056; G06F11/2071; G06F3/00; G06F3/06; G06F3/0601; G06F3/0628; G06F3/0638; G06F3/0644; G06F11/14; G06F11/1446; G06F11/1448; G06F11/1451; G06F3/0602; G06F3/061; G06F3/0611; G06F3/064; G06F3/0646; G06F3/0668; G06F3/0671; G06F3/0673; G06F3/0674
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
189 words
A method for transferring a data base from a first memory means (26 in 20) to a second memory means (26 in 22) characterized by the steps of: dividing said first memory means (26 in 20) into a plurality of defined memory areas (40-1 to 40-N), each containing a plurality of blocks of data space; storing in a first row (38) of data space of said first memory means (26 in 20) a plurality of sets of first data bits which provide the location of the first block (42) and the last block (44) of data space in each of said defined memory areas (40-1 to 40-N) locating the designated memory space in which data is stored; storing in each of said defined memory areas (40-1 to 40-N) at least one set of second data bits (62) identifying the location of valid and invalid data stored in said designated memory space; reading said first and second data bits to locate said valid data;and transferring only said valid data from said designated memory space in said first memory means (26 in 20) to said second memory means (26 in 22).
Claim 2
Independent Claim
189 words
A method for transferring a data base from a first memory means (26 in 20) to a second memory means (26 in 22) characterized by the steps of: dividing said first memory means (26 in 20) into a plurality of defined memory areas (40-1 to 40-N), each containing a plurality of blocks of data space; storing in a first row (38) of data space of said first memory means (26 in 20) a plurality of sets of first data bits which provide the location of the first block (42) and the last block (44) of data space in each of said defined memory areas (40-1 to 40-N) locating the designated memory space in which data is stored; storing in each of said defined memory areas (40-1 to 40-N) at least one set of second data bits (62) identifying the location of valid and invalid data stored in said designated memory space; reading said first and second data bits to locate said valid data;and transferring only said valid data from said designated memory space in said first memory means (26 in 20) to said second memory means (26 in 22).
Claim 3
Dependent Claim
54 words
A method according to claim 1, characterized in that said step of storing at least one set of second data bits (62) includes the step of storing said at least one set of second data bits in said first block (42) of data space in each of said defined memory areas (40-1 to 40-N).
Claim 4
Dependent Claim
53 words
A method according to claim 2, characterized by the step of storing third data bits in said first block (42) of data space in each of said defined memory areas (40-1 to 40-N) indicating the number of sets of second data bits (62) stored in the associated defined memory area (40-1 to 40-N).
Claim 5
Independent Claim
65 words
A method according to any one of the preceding claims, characterized in that each said set of second data bits (62) includes first-type binary bits representing that valid data is stored in corresponding portions of the associated defined memory area (40-1 to 40-N), and second-type binary bits representing that invalid data is stored in corresponding portions of the associated defined memory area (40-1 to 40-N).
Claim 6
Dependent Claim
93 words
A method according to claim 4, characterized in that said step of transferring data from said first memory means (26 in 20) to said second memory means (26 in 22) includes the steps of: detecting the first-type binary bits in each of said sets of second data bits (62), determining a number of blocks of data that are to be transferred to said second memory means (26 in 22) based on the detected first-type binary bits; and transferring the determined number of blocks of data to the second memory means (26 in 22).
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.