EP0361683A2 - Méthode de transfert de données entre mémoires - Google Patents

Méthode de transfert de données entre mémoires Download PDF

Info

Publication number
EP0361683A2
EP0361683A2 EP89308699A EP89308699A EP0361683A2 EP 0361683 A2 EP0361683 A2 EP 0361683A2 EP 89308699 A EP89308699 A EP 89308699A EP 89308699 A EP89308699 A EP 89308699A EP 0361683 A2 EP0361683 A2 EP 0361683A2
Authority
EP
European Patent Office
Prior art keywords
data
block
memory
space
memory means
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP89308699A
Other languages
German (de)
English (en)
Other versions
EP0361683A3 (fr
EP0361683B1 (fr
Inventor
Walter Hannibal Smith, Jr.
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NCR International Inc
Original Assignee
NCR Corp
AT&T Global Information Solutions International Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NCR Corp, AT&T Global Information Solutions International Inc filed Critical NCR Corp
Publication of EP0361683A2 publication Critical patent/EP0361683A2/fr
Publication of EP0361683A3 publication Critical patent/EP0361683A3/fr
Application granted granted Critical
Publication of EP0361683B1 publication Critical patent/EP0361683B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
    • G06F11/2053—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant
    • G06F11/2056—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant by mirroring
    • G06F11/2071—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant by mirroring using a plurality of controllers
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/0644—Management of space entities, e.g. partitions, extents, pools
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operations
    • G06F11/1446—Point-in-time backing up or restoration of persistent data
    • G06F11/1448—Management of the data involved in backup or backup restore
    • G06F11/1451—Management of the data involved in backup or backup restore by selection of backup contents
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061—Improving I/O performance
    • G06F3/0611—Improving I/O performance in relation to response time
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/064—Management of blocks
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0674—Disk device

Definitions

  • This invention relates to a method for transferring a data base from a first memory means to a second memory means.
  • a backup system has been utilized to ensure that no data is lost when the primary terminal device becomes disabled.
  • the backup system includes a second primary terminal device which receives the same data as the first primary terminal device during a merchandising operation. When the second primary terminal device becomes disabled or is withdrawn from operation, the data stored in the first primary terminal device is required to be downloaded to the second primary terminal device at the conclusion of a day's operation so as to update the data in the second primary terminal device.
  • a method for transferring a data base from a first memory means to a second memory means characterized by the steps of: dividing said first memory means into a plurality of defined memory areas, each containing a plurality of blocks of data space; storing in a first row of data space of said first memory means a plurality of sets of first data bits which provide the location of the first block and the last block of data space in each of said defined memory areas locating the designated memory space in which data is stored; storing in each of said defined memory areas at least one set of second data bits 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 to said second memory means.
  • FIG. 1 there is shown a schematic block diagram of the first and second primary terminal devices indicated by numerals 20 and 22 arranged for a downloading operation.
  • Each of the terminal devices 20, 22 includes an operating system 23, a processor 24, a disk file 26 and a plurality of disk drivers 28 for writing and reading data in the disk file and a communication controller 30 for controlling the transfer of data over a communication bus 32 coupled between the terminal devices 20 and 22.
  • the basic storage area in the disk file is a block of data 34 which comprises a maximum of 256 bytes of data.
  • Four blocks of data comprise one granule containing a maximum of 1024 bytes of data.
  • FIG. 3 there is shown a schematic diagram of the disk file 26 (Fig. 1) in which the file of the present embodiment is divided into a number of partitions 40-1 to 40-N inclusive.
  • the first row of data 38 of the disk file 26 contains thirty-three blocks of data comprising a directory in which the data represents the location of a first or begin block 42 and a last or end block 44, which blocks define the allocated disk space in each of the partitions 40-1 to 40-N in which data may be stored.
  • the end block 44 in each of the partitions 40-1 to 40-­N inclusive may be located at any position in the partition depending on the desired amount of data to be stored therein.
  • the disk file 26 (Fig. 1) in which the file of the present embodiment is divided into a number of partitions 40-1 to 40-N inclusive.
  • each of the terminals may contain up to four partitions 40-1 to 40-N inclusive.
  • the begin block 42 for each partition contains data representing the number of freespace maps that are located in the begin block.
  • a freespace map locates the number of granules of data in the partition which have valid data stored therein.
  • FIG. 4 there is illustrated a diagrammatic representation of an eight bit portion 46 of a freespace map 62 (Fig. 6) located in the begin block 42 (Fig. 3) of each partition in which each bit in the map indicates whether or not valid data is contained in a corresponding granule of data.
  • Each bit of the freespace map 46 may contain a binary one comprising a flag which represents that a corresponding granule of data in the partition contains valid data that is to be transferred.
  • the first bit 48 in the freespace map 46 represents the storage condition of a corresponding granule 52 of data, as indicated by the line 50.
  • the granule 52 is allocated by the operating system 23 (Fig.
  • the flag bit is set by the system 23 to one in block 48 of the freespace map 46.
  • the portion 46 contains the hexadecimal data F8 (Fig. 6)
  • the blocks 48 would contain the binary bits illustrated.
  • the eighth block 54 represents the storage condition of the number eight granule 58, as indicated by the line 56, and is set to a binary zero, representing that no valid data is stored in granule 58.
  • the first row in the directory block contains hexadecimal data at locations 05-0C inclusive which indicates, according to a predetermined code, that this information relates to the first partition 40-1 (Fig. 3).
  • the hexadecimal data F0, F0, F0, F3 and F3 located therein indicates that the begin block of partition 40-1 is block 33.
  • the hexadecimal data F0, F2, F5, F6 and F1 in locations 22-26 inclusive, in the third row represent the location of the end block of the partition, which in the present embodiment is 2561.
  • the partition 40-1 is indicated as having up to 2528 blocks of allocated data space, of which only the valid data contained therein is to be transferred.
  • Fig. 6 there is shown the begin block 33 referred to in the description of Fig. 5, in partition 40-1.
  • the hexadecimal signal 01 found at location 00 indicates that there is one freespace map for this partition.
  • Each freespace map represents up to one megabyte of data.
  • the freespace map indicated by the reference character 62 includes the digits 00 when no valid data is stored in the corresponding granules of data and includes hexadecimal data such as F8 (Fig. 4) which represents the granules having valid data stored therein.
  • the freespace map starts at location 80 and extends through location CE, allowing the map to cover 632 granules of disk space.
  • Each partition may contain more than one freespace map, depending on the amount of data stored on the disk file.
  • a flag bit is set to 1 in the byte of the freespace map corresponding to that location in the physical disk layout, indicating an allocated granule.
  • searching backwards from location CE at the end of the map it will be found, in the present example, that the first non-zero byte F8 is at location 80, indicating the location of blocks of disk space that contain valid data.
  • FIG. 7 there is shown a flow chart of an overall view of a downloading operation which begins (block 66) by the processor 24 in terminal device 20 determining the begin block and the end block of each disk partition (block 68) in the disk file 26 by reading the information in the directory row 38 of the disk file 26 (Figs. 3 and 5) and then reading the freespace maps in the begin block to determine the location of the valid data in the partition.
  • the processor 24 in the first primary terminal device 20 will enable the drivers 28 to transfer the valid data in each of the partitions by reading the data block by block from the primary disk file 26 to the other primary disk file 26 in the second primary terminal device 22 (block 70).
  • the processor 24 in terminal device 20 will detect if another partition is to be transferred (block 72). If it is, the processor will return over line 77 to block 68 until all of the valid data in each of the partitions has been transferred. This processor will then disable the drivers (block 74) to complete (block 76) the transfer operation.
  • Figs. 8A and 8B there is shown a flow chart of the operation for determining the begin block and the end block of the valid data in each of the partitions.
  • the processor 24 in terminal device 20 (Fig. 1) will start the operation (block 78) by determining the location of the begin block and the end block for each partition (block 80) by reading the blocks of data in the directory row 38 of the disk file 26 (Fig. 3). After detecting the location of the begin block in a partition, the processor will read the begin block (Fig. 6) to determine the number of freespace maps in the partition (block 82). The processor will then read the last freespace map (block 84) byte-by-byte for a flag indicating an allocated granule (Fig.
  • the processor will then determine if the freespace map is associated with the first partition (block 96) and if it is, it will then set the begin block to the first block in row 1 of the disk file (block 98) which is the directory row 38 of the disk file (Fig. 3) which directory row is transferred with the valid data.
  • the processor will then set the end block equal to the begin block plus the number of allocated blocks (block 100) and then return to its original position (block 102). If the partition to be copied is not the first partition, the system will go over line 101, bypassing the step of setting the begin block to the first block of the directory row of the disk file 26.
  • FIG. 9 there is shown a flow chart of the downloading process in which the processor 24 of terminal device 20 will begin (block 104) by opening or operating the disk drivers 28 (Fig. 1) (block 106) for each of the partitions 40 (Fig. 3) and then set a counter (not shown) located in the disk file to the begin block (108) location.
  • the processor will then copy three blocks of valid data (block 110) since this has been found to be the optimum transfer rate of the communication system.
  • the processor increments the counter by three (block 112) and then checks to see if the output count of the counter is greater than the end block number (block 114). If it is not, it will then return over line 116 and copy the next three blocks (block 110) of data. If the count is greater than the number associated with the end block, the processor will return to its initial operating position (block 118).

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Quality & Reliability (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Computer And Data Communications (AREA)
EP89308699A 1988-08-30 1989-08-29 Méthode de transfert de données entre mémoires Expired - Lifetime EP0361683B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US23864188A 1988-08-30 1988-08-30
US238641 1988-08-30

Publications (3)

Publication Number Publication Date
EP0361683A2 true EP0361683A2 (fr) 1990-04-04
EP0361683A3 EP0361683A3 (fr) 1991-07-24
EP0361683B1 EP0361683B1 (fr) 1995-06-14

Family

ID=22898725

Family Applications (1)

Application Number Title Priority Date Filing Date
EP89308699A Expired - Lifetime EP0361683B1 (fr) 1988-08-30 1989-08-29 Méthode de transfert de données entre mémoires

Country Status (3)

Country Link
EP (1) EP0361683B1 (fr)
JP (1) JP2761937B2 (fr)
DE (1) DE68923044T2 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999013403A1 (fr) * 1997-09-09 1999-03-18 Storage Technology Corporation Systeme de gestion de memoire de fichiers de donnees pour operations de copie selective
GB2353611A (en) * 1999-08-24 2001-02-28 Ibm Disk image backup/restore with data preparation phase
EP0874312A3 (fr) * 1992-08-26 2001-09-05 Mitsubishi Denki Kabushiki Kaisha Methode de remplacement de disques defectueux dans un reseau redondant de disques.

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
IBM TECHNICAL DISCLOSURE BULLETIN, vol. 18, no. 8, January 1976, pages 2643-2644, New York, US; R.F. ARNOLD et al.: "Checkpoint copying" *
IBM TECHNICAL DISCLOSURE BULLETIN, vol. 23, no. 5, October 1980, pages 2091-2095, New York, US; R.W. COLLINS et al.: "Directory recovery" *
MICROPROCESSORS AND MICROSYSTEMS, vol. 9, no. 4, May 1985, pges 179-183, Guildford, Surrey, GB; B. SRINIVASAN et al.: "Recoverable file system for microprocessor systems" *
PROC. OF THE INTERNATIONAL CONFERENCE ON SUPERCOMPUTING SYSTEMS, Washington, DC, 16th - 20th December 1985, pages 265-272, IEEE, New York, US; J. KAUNITZ: "Database backup and recovery in transaction driven information systems" *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0874312A3 (fr) * 1992-08-26 2001-09-05 Mitsubishi Denki Kabushiki Kaisha Methode de remplacement de disques defectueux dans un reseau redondant de disques.
EP0871120A3 (fr) * 1992-08-26 2001-09-05 Mitsubishi Denki Kabushiki Kaisha Méthode de stockage de données dans un groupe de disques redondant et réseau redondant de disques
WO1999013403A1 (fr) * 1997-09-09 1999-03-18 Storage Technology Corporation Systeme de gestion de memoire de fichiers de donnees pour operations de copie selective
US6038639A (en) * 1997-09-09 2000-03-14 Storage Technology Corporation Data file storage management system for snapshot copy operations
GB2353611A (en) * 1999-08-24 2001-02-28 Ibm Disk image backup/restore with data preparation phase
US6658435B1 (en) 1999-08-24 2003-12-02 International Business Machines Corporation Disk image backup/restore with data preparation phase
GB2353611B (en) * 1999-08-24 2004-03-17 Ibm Disk image backup/restore with data preparation phase

Also Published As

Publication number Publication date
JPH02120945A (ja) 1990-05-08
DE68923044T2 (de) 1996-02-22
DE68923044D1 (de) 1995-07-20
JP2761937B2 (ja) 1998-06-04
EP0361683A3 (fr) 1991-07-24
EP0361683B1 (fr) 1995-06-14

Similar Documents

Publication Publication Date Title
US5109485A (en) Method for transferring data between memories
US5568626A (en) Method and system for rewriting data in a non-volatile memory a predetermined large number of times
US5566314A (en) Flash memory device employing unused cell arrays to update files
EP0375188A2 (fr) Système de fichiers
EP0361176A3 (fr) Méthode et despositif pour la communication des données entre multiples tâches dans des systémes de traitement des données
MY121756A (en) External storage apparatus and data processing method
US5896546A (en) "Sticky" logical drive letter assignments
US4685057A (en) Memory mapping system
EP0361683B1 (fr) Méthode de transfert de données entre mémoires
EP1540660B1 (fr) Procede et appareil pour la detection d'une erreur en ecriture a une memoire permanente
EP0319147A3 (fr) Méthode de mise en mémoire de fichiers de groupes préstructurés d'informations connexes dans un système de traitement de données
US5625557A (en) Automotive controller memory allocation
JPS63272198A (ja) モジューラ通信システムのハードウエア・ソフトウエア互換性を維持するためのシステム
US4249250A (en) Computer storage arrangements with overwrite warning
JP2661131B2 (ja) 情報記憶読出方法とその装置
US5386553A (en) Disk file updating control device and method using updating data stored in a first-in-first-out queue
EP0522728B1 (fr) Méthode pour accéder efficacement à des données dans une table de liaison
GB2106290A (en) Electronic equipment with character memory
EP0902354B1 (fr) Système et méthode de gestion de fichier
ES8106062A1 (es) Sistema de interconexion del tipo de cola circular
WO1996005703A3 (fr) Procede de transfert de fichiers de donnees d'une memoire de grande capacite a un systeme de post-traitement
KR960006673B1 (ko) 인쇄 회로 어셈블리를 트랙킹하고 식별하기 위한 장치 및 방법
JP3446397B2 (ja) Ｅｅｐｒｏｍの制御方法
EP0745938A1 (fr) Dispositif de mémoire principale avec région de ressources de système d'exploitation
JPS61296455A (ja) メモリサイズの判別方法

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): DE FR GB

17P Request for examination filed

Effective date: 19920109

17Q First examination report despatched

Effective date: 19940302

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NCR INTERNATIONAL INC.

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: AT&T GLOBAL INFORMATION SOLUTIONS INTERNATIONAL IN

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

REF Corresponds to:

Ref document number: 68923044

Country of ref document: DE

Date of ref document: 19950720

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
REG Reference to a national code

Ref country code: FR

Ref legal event code: CD

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 19970823

Year of fee payment: 9

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990601

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 19990705

Year of fee payment: 11

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 19990723

Year of fee payment: 11

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20000829

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20000829

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20010430

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST