← Back to Patent Explorer
EP0327188A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Method of storing data on recording tape

Assignee: Hewlett Packard Ltd
•
Filing: 1989-01-04
•
Granted: —
•
Expires: 2009-01-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method is disclosed for effecting update-in-place of data that has been recorded on tape in oblique tracks using a helical-scan recording technique. The data to be updated is recorded in a block (32) of M tracks lying between first and second continuum (81,37) each at least of N tracks where N is the worst-case number of tracks required to achieve head/track alignment. The block (82) of M tracks comprises a first series (100) of at least N tracks, a second series (101) of tracks containing the data, and a third series (12) of at least P tracks. When updating the data, the block (82) is rewritten as a whole in a single continuum with the first track of the block being written within a distance of P tracks from the last track of the first continuum (81).

Inventors

  • 👤 Brian Andrew Milthorp
  • 👤 Bruce Allen Thompson
  • 👤 Kentaro Odaka
  • 👤 Yoshizumi Inazawa

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-03 12:21
CPC Classifications
G; G11; G11B; G11B15/00; G11B20/00; G11B20/10; G11B20/12; G11B20/1201; G11B20/1207; G11B20/1209; G11B27/00; G11B27/02; G11B27/031; G11B27/032; G11B27/10; G11B27/19; G11B27/28; G11B27/30; G11B27/3027; G11B27/3063; G11B27/309; G11B27/32; G11B27/327; G11B27/328; G11B20/1211; G11B2220/00; G11B2220/20; G11B2220/21; G11B2220/215; G11B2220/216; G11B2220/90; G11B2220/91; G11B2220/913

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 271 words
A method of storing data on a recording tape and of subsequently updating that data, said method employing helical scan recording in which data is written in oblique tracks and a head tracking alignment technique is used that enables tracking alignment to be achieved after a maximum number of N tracks, characterised in that said method comprises the steps of: (a) writing a first and second continuum of tracks (91,92) each containing more than N tracks in number and being separated from each other along the tape by a number of tracks Q, the last track of said first continuum (91) being identifiable by data recorded in that continuum beyond the first N tracks thereof, (b) subsequently writing data to tape in a block of M tracks made up of a first series of tracks (93) greater than N in number, a second series of tracks (94) containing said data, and a third series of blanking tracks (95), the operation of writing said block involving the steps of reading said first continuum (91) to identify the last track thereof, and writing said block as a continuum of tracks starting at a location positioned beyond said last track of the first continuum (91) by up to P tracks, said third series of tracks (95) being at least P in number, (c) repeating step (b) each time it is desired to update the data held in said block, the values of N and P being predetermined and the maximum value of M being set by the value of the quantity (Q-P), and step (a) being such that the inequality Q> (N+2P) is satisfied.
Claim 2
Independent Claim 271 words
A method of storing data on a recording tape and of subsequently updating that data, said method employing helical scan recording in which data is written in oblique tracks and a head tracking alignment technique is used that enables tracking alignment to be achieved after a maximum number of N tracks, characterised in that said method comprises the steps of: (a) writing a first and second continuum of tracks (91,92) each containing more than N tracks in number and being separated from each other along the tape by a number of tracks Q, the last track of said first continuum (91) being identifiable by data recorded in that continuum beyond the first N tracks thereof, (b) subsequently writing data to tape in a block of M tracks made up of a first series of tracks (93) greater than N in number, a second series of tracks (94) containing said data, and a third series of blanking tracks (95), the operation of writing said block involving the steps of reading said first continuum (91) to identify the last track thereof, and writing said block as a continuum of tracks starting at a location positioned beyond said last track of the first continuum (91) by up to P tracks, said third series of tracks (95) being at least P in number, (c) repeating step (b) each time it is desired to update the data held in said block, the values of N and P being predetermined and the maximum value of M being set by the value of the quantity (Q-P), and step (a) being such that the inequality Q> (N+2P) is satisfied.
Claim 3
Dependent Claim 27 words
A method according to claim 1, wherein said first and second continuums of tracks (91,92) are written in a single continuous series together with Q intervening tracks.
Claim 4
Dependent Claim 35 words
A method according to claim 1, wherein the starting location for said second continuum (92) is determined by determining the displacement of the tape in moving the latter on from the first said continuum (91).
Claim 5
Dependent Claim 40 words
A method according to claim 1, wherein said data recorded in said first continuum (91) to enable identification of the last track thereof, are numbers recorded in at least some of said tracks and progressing according to a predetermined sequence.
Claim 6
Dependent Claim 50 words
A method according to claim 1, wherein the number of tracks M in said block (93-95) is less than Q by at least 2P whereby a distance of at least P tracks is present between the end of said block (93-95)and the start of said second continuum (92) of tracks.
Claim 7
Dependent Claim 38 words
A method according to claim 1, wherein for a DAT-type system, the following values are given to M, N, P and Q: M = 130 tracks N = 60 tracks P = 20 tracks Q = 160 tracks
Claim 8
Dependent Claim 30 words
A method according to claim 1, wherein the data stored in said block (93-95) is tape usage data, said block being written at the end of a tape usage session.
Claim 9
Dependent Claim 68 words
A method according to claim 7, wherein each track is formatted to have a main area (25) for storing user data and at least one sub area (23) for storing auxiliary information relating to said user data, said tape usage data being stored in its totality in the said at least one sub area (23) of each track of said second series of tracks (94) of said block.
Claim 10
Independent Claim 134 words
A method of storing data on recording tape in which a helical scan technique is employed to write to the tape in oblique tracks each including a main area for storing user data and at least one sub area for storing auxiliary information relating to said user data, characterised in that the method includes the step of writing tape usage data to a system area (82) of the tape at the end of each session of use of the tape, said tape usage data being written in a system block (100-102) made up of a predetermined number of tracks and said tape usage data being stored in its totality in the said at least one sub area (23) of each of a plurality of tracks whereby said information is recorded a plurality of times.
Claim 11
Independent Claim 134 words
A method of storing data on recording tape in which a helical scan technique is employed to write to the tape in oblique tracks each including a main area for storing user data and at least one sub area for storing auxiliary information relating to said user data, characterised in that the method includes the step of writing tape usage data to a system area (82) of the tape at the end of each session of use of the tape, said tape usage data being written in a system block (100-102) made up of a predetermined number of tracks and said tape usage data being stored in its totality in the said at least one sub area (23) of each of a plurality of tracks whereby said information is recorded a plurality of times.
Claim 12
Dependent Claim 86 words
A method according to claim 9, including the further steps of reading said system block (100-102) upon initiation of a session of tape usage, storing said tape usage data in electronic memory (68), and updating said usage data in electronic memory (68) during said session; said step of writing tape usage data being effected at the end of said tape usage session with the tape usage data written into said system block (100-102) being that stored and updated in the electronic memory (68) during said session.
Claim 13
Dependent Claim 19 words
A method according to claim 10, wherein said tape usage session is defined by tape loading and unloading operations.
Claim 14
Dependent Claim 55 words
A method according to claim 10, wherein said tape usage data includes an indication of the number of tracks read during the current or last completed tape usage session, said method involving the step of counting the number of tracks (20,21) read and/or written during said session and updating said indication in electronic memory (68).
Claim 15
Dependent Claim 24 words
A method according to claim 12, wherein the step of counting said tracks (20, 21) is effected by counting groupings (27) of said tracks.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag