Senior Fitness - Exercise and Nutrition for Aging Men and Women
FREE Article Feed for your website.
Home Ownership Magazine
Party Planning Information
Article Marketing Resources
Bio-Medical Research Article Database
Informative Articles on Life, Love and Happiness
Tutorials on Business to Writing
Famous Quotes from Famous People
Song Lyric Information
New US Patent Information
Comprehensive List of Content by Category
Online Auctions and Shopping Related Articles
Article Search
Most Recent Articles
Title: Method for presenting streaming media
Patent Number: 7,436,885 Issued on 10/14/2008 to Burg,   et al.

Title: Method and system for wavelet packet transmission using a best base algorithm
Patent Number: 7,436,884 Issued on 10/14/2008 to Chen,   et al.

Title: Nonlinear inversion
Patent Number: 7,436,883 Issued on 10/14/2008 to Batruni

Title: Decision feedback equalizer and clock and data recovery circuit for high speed applications
Patent Number: 7,436,882 Issued on 10/14/2008 to Momtaz

Title: Per-bin DFE for advanced OQAM-based multi-carrier wireless data transmission systems
Patent Number: 7,436,881 Issued on 10/14/2008 to Nedic,   et al.

Title: Adaptive filtering using fast affine projection adaptation
Patent Number: 7,436,880 Issued on 10/14/2008 to Ding

Title: Spread communication system and mobile station thereof
Patent Number: 7,436,879 Issued on 10/14/2008 to Iwamoto,   et al.

Title: Method and apparatus for efficient carrier bin search for a composite spreading code
Patent Number: 7,436,878 Issued on 10/14/2008 to Harris,   et al.

Title: Method and apparatus to perform surgical reactive jamming while maintaining simultaneous tactical communications
Patent Number: 7,436,877 Issued on 10/14/2008 to Karlsson

Title: System and method for fast acquisition of ultra wideband signals
Patent Number: 7,436,876 Issued on 10/14/2008 to Fisher,   et al.

Title: Laser module having controlled optical power density at exposed surfaces
Patent Number: 7,436,875 Issued on 10/14/2008 to Miura

Title: Laser device
Patent Number: 7,436,874 Issued on 10/14/2008 to Onishi,   et al.

Title: Optical device and semiconductor laser oscillator
Patent Number: 7,436,873 Issued on 10/14/2008 to Sugitatsu,   et al.

Title: High frequency discharge excited gas laser oscillator
Patent Number: 7,436,872 Issued on 10/14/2008 to Egawa,   et al.

Title: Method and device for performing wavelength modulation with Distributed Bragg Reflector (DBR) laser
Patent Number: 7,436,871 Issued on 10/14/2008 to Hu,   et al.

Title: Semiconductor laser device and method for manufacturing the same
Patent Number: 7,436,870 Issued on 10/14/2008 to Ono,   et al.

Title: Laser circuit substrate
Patent Number: 7,436,869 Issued on 10/14/2008 to Aoki

Title: Modular diode laser assembly
Patent Number: 7,436,868 Issued on 10/14/2008 to Schulte,   et al.

Title: Hermetically sealed external cavity laser system and method
Patent Number: 7,436,867 Issued on 10/14/2008 to McDonald,   et al.

Title: Combination optical isolator and pulse compressor
Patent Number: 7,436,866 Issued on 10/14/2008 to Vaissie,   et al.

Title: Tunable optical oscillator
Patent Number: 7,436,865 Issued on 10/14/2008 to Tibbitts

Title: Method for optimising the calibration process of a tuneable laser
Patent Number: 7,436,864 Issued on 10/14/2008 to Farrell,   et al.

Title: Fiber laser beam processing apparatus
Patent Number: 7,436,863 Issued on 10/14/2008 to Matsuda,   et al.

Title: Self-similar laser oscillator
Patent Number: 7,436,862 Issued on 10/14/2008 to Ilday,   et al.

Title: Asynchronous control circuit with symmetric forward and reverse latencies
Patent Number: 7,436,861 Issued on 10/14/2008 to Jones

Title: Method of advertising DNS server address and routing method thereby
Patent Number: 7,436,860 Issued on 10/14/2008 to Lee,   et al.

Title: Demultiplexing device
Patent Number: 7,436,859 Issued on 10/14/2008 to Notoya,   et al.

Title: Methods and systems for adaptive rate management, for adaptive pointer management, and for frequency locked adaptive pointer management
Patent Number: 7,436,858 Issued on 10/14/2008 to Goren,   et al.

Title: Mapping information in wireless communications systems
Patent Number: 7,436,857 Issued on 10/14/2008 to Fong,   et al.

Title: Method for transmitting voice data packets
Patent Number: 7,436,856 Issued on 10/14/2008 to Lipp

Title: Prohibit or avoid route mechanism for path setup
Patent Number: 7,436,855 Issued on 10/14/2008 to Lee,   et al.

Title: Transmitter device for controlling data transmission
Patent Number: 7,436,854 Issued on 10/14/2008 to Miyake,   et al.

Title: Reducing memory accesses in processing TCP/IP packets
Patent Number: 7,436,853 Issued on 10/14/2008 to Basso,   et al.

Title: Resource allocation method for providing load balancing and fairness for dual ring
Patent Number: 7,436,852 Issued on 10/14/2008 to Nam,   et al.

Title: Destination call routing apparatus and method
Patent Number: 7,436,851 Issued on 10/14/2008 to Chambers

Title: Ultra-wideband (UWB) transparent bridge
Patent Number: 7,436,850 Issued on 10/14/2008 to Mowery,   et al.

Title: System and method for partitioning a DSLAM network
Patent Number: 7,436,849 Issued on 10/14/2008 to Amrany,   et al.

Title: Method for mobile node registration management
Patent Number: 7,436,848 Issued on 10/14/2008 to Lewis,   et al.

Title: Method for internet-protocol-based transmission of communication data
Patent Number: 7,436,847 Issued on 10/14/2008 to Zwack

Title: Network device architecture and associated methods
Patent Number: 7,436,846 Issued on 10/14/2008 to Lebizay,   et al.

Title: Input and output buffering
Patent Number: 7,436,845 Issued on 10/14/2008 to Rygh,   et al.

Title: System and method for controlling packet transmission in a communication network
Patent Number: 7,436,844 Issued on 10/14/2008 to Wang,   et al.

Title: Method for access selection
Patent Number: 7,436,843 Issued on 10/14/2008 to Gustafsson,   et al.

Title: Outlet with analog signal adapter, a method for use thereof and a network using said outlet
Patent Number: 7,436,842 Issued on 10/14/2008 to Binder

Title: Presence functionality in the H.323 protocol
Patent Number: 7,436,841 Issued on 10/14/2008 to Pavlak,   et al.

Title: Network system manager for telecommunication carrier virtual networks
Patent Number: 7,436,840 Issued on 10/14/2008 to Hoffman,   et al.

Title: Systems and methods for providing services through an integrated digital network
Patent Number: 7,436,839 Issued on 10/14/2008 to Kafka,   et al.

Title: Automatic prioritization of BGP next-hop in IGP
Patent Number: 7,436,838 Issued on 10/14/2008 to Filsfils,   et al.

Title: Packet forwarding device and method
Patent Number: 7,436,837 Issued on 10/14/2008 to Chou,   et al.

Title: Method and apparatus for detecting support for a protocol defining supplemental headers
Patent Number: 7,436,836 Issued on 10/14/2008 to Mushtaq,   et al.

Title: Forced bearer routing for packet-mode interception
Patent Number: 7,436,835 Issued on 10/14/2008 to Castleberry,   et al.

Title: Efficient frame retransmission in a wireless communication environment
Patent Number: 7,436,834 Issued on 10/14/2008 to Zhang,   et al.

Title: Communication system, router, method of communication, method of routing, and computer program product
Patent Number: 7,436,833 Issued on 10/14/2008 to Jimmei

Title: Asymmetric packets switch and a method of use
Patent Number: 7,436,832 Issued on 10/14/2008 to Gallatin,   et al.

Title: Wireless network load generator dynamic MAC hardware address manipulation
Patent Number: 7,436,831 Issued on 10/14/2008 to Miller,   et al.

Title: Method and apparatus for wire-speed application layer classification of upstream and downstream data packets
Patent Number: 7,436,830 Issued on 10/14/2008 to Ben-Nun,   et al.

Title: Methods and apparatus for reconfiguring packets to have varying sizes and latencies
Patent Number: 7,436,829 Issued on 10/14/2008 to Chen,   et al.

Title: Method and apparatus for label switching data packets
Patent Number: 7,436,828 Issued on 10/14/2008 to Betts,   et al.

Title: Data bearers in a communication system
Patent Number: 7,436,827 Issued on 10/14/2008 to Greis,   et al.

Title: System and method for detecting and indicating communication protocols
Patent Number: 7,436,826 Issued on 10/14/2008 to Celebioglu,   et al.

Title: Method and apparatus for distinguishing between services of all frequency bands and specific frequency band
Patent Number: 7,436,825 Issued on 10/14/2008 to Jeong,   et al.

Title: Distributed switch architecture including a growth input/output bus structure
Patent Number: 7,436,824 Issued on 10/14/2008 to Pepenella

Title: Method for transmitting data
Patent Number: 7,436,823 Issued on 10/14/2008 to Laumen,   et al.

Title: Method and apparatus for the estimation of total transmission delay by statistical analysis of conversational behavior
Patent Number: 7,436,822 Issued on 10/14/2008 to Lee,   et al.

Title: Method and apparatus for providing fault tolerance to intelligent voice-over-IP endpoint terminals
Patent Number: 7,436,820 Issued on 10/14/2008 to Beck,   et al.

Title: Communication apparatus and control method thereof
Patent Number: 7,436,819 Issued on 10/14/2008 to Ezumi

Title: Packet switched network voice communication
Patent Number: 7,436,818 Issued on 10/14/2008 to Nakhla,   et al.

Title: Call clearing for legacy mobile circuit switched domain wireless systems
Patent Number: 7,436,817 Issued on 10/14/2008 to Bienn,   et al.

Title: Method and system for transmission-based billing of applications
Patent Number: 7,436,816 Issued on 10/14/2008 to Mehta,   et al.

Title: Switching system and method having low, deterministic latency
Patent Number: 7,436,815 Issued on 10/14/2008 to Caldara

Title: Selecting transport addresses to route streams between endpoints
Patent Number: 7,436,814 Issued on 10/14/2008 to Bell

Title: Method and system for acquiring time synchronization between base stations in a broadband wireless access communication system
Patent Number: 7,436,813 Issued on 10/14/2008 to Kim,   et al.

Title: System for oderwire modulation
Patent Number: 7,436,812 Issued on 10/14/2008 to Geile

Title: Multicasting data method in a radio communication system
Patent Number: 7,436,811 Issued on 10/14/2008 to Putcha,   et al.

Title: Determination of wireless link quality for routing as a function of predicted delivery ratio
Patent Number: 7,436,810 Issued on 10/14/2008 to Ma,   et al.

System and method for controlling the speed of a tape drive Number:7,154,695 from the United States Patent and Trademark Office (PTO) owispatent

Home    Author Login    Submit Article    Article Search    Add Your Link    Edit Your Link    Contact Us    Advertising    Disclaimer

   

 
Web LinkGrinder.com

Top Breaking News
     Greek, Cypriot Leaders Resume Unification Talks in Nicosia by Nathan Morley
     Indonesia Tobacco Sales Grow, Raising Health Fears
     South Korea Allows Top Defector to Travel Overseas by VOA News

Title: System and method for controlling the speed of a tape drive

Abstract: A control system and method for operating a system comprising a host computer, a buffer, a tape drive and a tape is provided. The method includes writing data to the tape while the tape is traveling at a first speed; stopping the tape; determining an optimum second speed to drive the tape to travel; and, thereafter driving the tape to travel at the second speed while writing data to the tape.

Patent Number: 7,154,695 Issued on 12/26/2006 to Goker,   et al.


Inventors: Goker; Turguy (Solana Beach, CA), Le; Hoa Q. (Orange, CA), Cooper; Stephen C. (Costa Mesa, CA)
Assignee: Certance, LLC (Costa Mesa, CA)
Appl. No.: 10/985,443
Filed: November 10, 2004


Current U.S. Class: 360/73.08
Current International Class: G11B 15/46 (20060101)
Field of Search: 360/73.08,46,50,77.12,78.02,83


References Cited [Referenced By]

U.S. Patent Documents
2351410 June 1944 Ianni
4338640 July 1982 Yabu et al.
5303095 April 1994 Vuong
5426537 June 1995 Yeh et al.
5953177 September 1999 Hughes et al.
6118605 September 2000 Call et al.
6775088 August 2004 Kobayashi et al.
6785076 August 2004 Alva
6958878 October 2005 Jaquette et al.
2006/0098324 May 2006 Goker et al.
Foreign Patent Documents
0268745 Jun., 1988 EP
0468112 Jan., 1992 EP
2079516 Jan., 1982 GB
59028260 Feb., 1984 JP
Primary Examiner: Tzeng; Fred F.
Attorney, Agent or Firm: Spolyar; Mark J.

Claims



What is claimed is:

1. A method for operating a system comprising a host computer, a buffer, a tape drive and a tape, the method comprising: writing data to the tape while the tape is traveling at a first speed; stopping the tape; determining an optimum second speed to drive the tape to travel; and, thereafter driving the tape to travel at the second speed while writing data to the tape; wherein the optimum second speed is determined based on a calculated ideal speed and the optimum second speed is greater than the ideal speed.

2. A method according to claim 1 wherein the step of determining an optimum second speed to drive the tape to travel comprises determining a relationship between the host computer rate, the speed of the tape and a number of under runs of the tape.

3. A method accordingly to claim 1 wherein the tape drive writes data sets to the tape and the step of determining an optimum second speed to drive the tape to travel comprises monitoring a number of data sets being written while the tape is traveling at the first speed.

4. A method according to claim 1 wherein stopping the tape occurs when the buffer becomes empty, and the tape is repositioned and an under run is done after stopping the tape.

5. A method according to claim 4 wherein the step of determining an optimum second speed to drive the tape to travel comprises determining a number of data sets which have been written to the tape since an immediately preceding under run.

6. A method according to claim 1 wherein the tape is driven to travel through a complete wrap, and the optimum second speed is determined so that at least one under run will occur during the complete wrap of the tape.

7. A method for operating a system comprises a host computer, a buffer, a tape drive and a tape, the method comprising: simulating an operation of the system to develop data correlating the tape speed, the data rate of the host, and back up time; writing data to the tape while the tape is traveling at a first speed; stopping the tape; determining an optimum second speed to drive the tape to travel based on the simulation of the operation of the system; and, thereafter driving the tape to travel at the second speed while writing data from the buffer to the tape; wherein the optimum second speed is determined based on a calculated ideal speed and the optimum second speed is greater than the ideal speed.

8. A control system for controlling a tape drive system comprising a host computer, a buffer, a tape drive and a tape, the control system comprising: tape drive control means to control the tape drive to drive the tape to travel at a first speed and a second speed while data is written to the tape and to stop the tape between travel at the first speed and at the second speed; and, speed determination means for determining an optimum second speed to drive the tape to travel, said speed determination means being coupled to said tape drive control means; wherein the optimum second speed is determined based on a calculated ideal speed and the optimum second speed is greater than the ideal speed.

9. A control system according to claim 8 wherein the speed determination means comprises relationship determining means for determining the relationship between the host computer rate, the speed of the tape and a number of under runs of the tape.

10. A control system according to claim 8 wherein the tape drive control means is configured to control the tape drive to write data sets to the tape and the speed determination means comprises monitoring means for monitoring a number of data sets being written while the tape is traveling at the first speed.

11. A control system according to claim 8 wherein tape drive control means is configured to stop the tape when the buffer becomes empty and to accomplish repositioning and under run motions after stopping the tape.

12. A control system according to claim 11 wherein the speed determination means is configured to determine a number of data sets which have been written to the tape since an immediately preceding under run.

13. A control system according to claim 8 wherein said speed determination means comprises estimating means for estimating the host transfer rate occurring while the tape is traveling at the first speed.

14. A control system according to claim 13 wherein the speed determination means comprises relationship determining means to determine a relationship between a data set count and a transfer error rate.

15. A control system for controlling a tape drive system comprising a host computer, a buffer, a tape drive and a tape, the control system comprising: simulating means for simulating a operation of the tape drive system to develop data correlating the tape speed, a data rate of the host, and back up time; tape drive control means to control the tape drive to drive the tape to travel at a first speed and a second speed while data is written to the tape and to stop the tape between travel at the first speed and at the second speed; and, speed determination means for determining an optimum second speed to drive the tape to travel based on the data correlating the tape speed, the data rate of the host, and back up time, said speed determination means being coupled to said tape drive control means; wherein the optimum second speed is determined based on a calculated ideal speed and the optimum second speed is greater than the ideal speed.
Description



FIELD OF THE INVENTION

The present invention relates to tape drives. More particularly, the present invention relates to control of the speed of a tape drive.

BACKGROUND OF THE INVENTION

High-density recording on multiple tracks of a magnetic tape is known. In certain arrangements, parallel tracks extend along a longitudinal direction of the magnetic tape. The magnetic tape is moved transversely across a read/write head and data is recorded or read.

Many conventional tape drives are used to back up data stored on the hard disc drive of a computer system. Generally the speed at which the hard disc system can deliver data differs from the speed at which the tape drive can record data and in such cases a data buffer is used. The data is read from the hard disc drive or "host" computer and stored on the data buffer and then the data is transmitted from the data buffer to be recorded on the tape drive.

When a data buffer is used, repositions and under runs of the tape drive are important parts of the operation. They are invoked by the tape drive when the data buffer becomes empty so there is no more data to be written to the tape. At this time the tape is moving at a certain speed and must slow down and stop. Then the tape direction is reversed to cause the tape to go back some distance so that the read/write heads precede the location where writing of data was stopped. The tape then is ready to speed up in the forward direction and rewriting can be started from the last place it ended. This can be called the append process.

The reposition operation is the motion that begins at the time when the drive is slowed down to stop and the tape moves backward to reposition the magnetic head ahead of a particular position on the tape such as the last place the data was written. The time it takes from the point of start of ramp down to final rest position is defined as the reposition time. The under run operation is a combination of two physical motions, reposition followed by a ramp up motion to restart the writing process.

Commonly in conventional drive design, the reposition and under run operations are done by speed control and moving the tape back far enough during reposition so that if the drive was commanded to rewrite it has plenty distance to move during the ramp up part of the process such that it is ready to append to the data at the appropriate location on the tape.

A conventional tape drive system is shown in FIG. 1. This system comprises a tape drive 12 connected to a host computer 10 by a cable 16, and an associated tape cartridge 14. The tape drive 12 includes a receiving slot 22 into which the tape cartridge 14 is inserted. The tape cartridge 14 comprises a housing 18 containing a length of magnetic tape 20. The tape drive 12 is preferably compatible with the associated host computer, and can assume any one of a variety of cartridge or cassette linear formats.

A typical configuration of the tape drive 12 is schematically shown in FIG. 2. The tape drive 12 in FIG. 2 comprises a deck 24 including movable parts, and a control card 26 including various circuits and buses. The deck 24 includes a head assembly 28 which contacts the tape 20 of the tape cartridge inserted into the tape drive 12 to read and write data and read a servo pattern, and motors 34 and 36 for respectively rotating a supply reel 30 and a take-up reel 32. For a tape cartridge 14 of a dual reel type, both of the reels 30 and 32 are included in the tape cartridge 14. For a tape cartridge 14 of a single reel type, however, only the supply reel 30 is included in the tape cartridge 14 while the take-up reel 32 is provided in the tape drive 12. Although not shown in FIG. 2, the deck 24 additionally includes a mechanism for moving the head assembly 28 across the width of the tape 20, a mechanism for holding the inserted tape cartridge, and a mechanism for ejecting the inserted tape cartridge.

The control card 26 includes a microprocessor (MPU) 38 for the overall control of the tape drive 12; a memory 42, a servo control unit 44, a data flow unit 46 and an interface control unit 48 all of which are connected to the MPU 38 via an internal bus 40; a motor control unit 50 and a head control unit 52 which are connected to the servo control unit 44, and a data buffer 54 which is connected to the data flow unit 46. While the memory 42 is shown as a single hardware component in FIG. 2, it is actually preferably constituted by a read only memory (ROM) storing a program to be executed by the MPU 38, and a working random access memory (RAM). The servo control unit 44 manages speed control for the motors 34 and 36 and position control for the head assembly 28 by transmitting the respective control signals to the motor control unit 50 and the head control unit 52. The motor and head control units 50 and 52 respond to these control signals by physically driving the motors 34, 36 and positioning the head assembly 28, respectively.

The head assembly 28 includes servo heads which read data from servo tracks or bands on the tape 20. Control card 26 utilizes data from the servo tracks to generate a position error signal (PES), and the PES is used by the servo control unit 44 to cause the head control unit 52 to position the head assembly 28. In some conventional designs the head assembly 28 includes a voice coil motor (VCM) 56 which receives electrical signals from the head control unit 52 and positions the head assembly 28 according to the received signals.

The data flow unit 46 compresses data to be written on the tape 20, decompresses data read from the tape 20 and corrects errors, and is connected not only to the data buffer 54 but also to the interface control unit 48. The interface control unit 48 is provided to communicate data to/from the host computer 10 via the cable 16. The data channel unit 54 is essentially a data modulating and demodulating circuit. That is, when data is written to the tape 20, it performs digital-analog conversion and modulation for data received from the data flow unit 46, and when data is read from the tape 20, it performs analog-digital conversion and demodulation for data read by the head assembly 28.

It can now be understood that the speed of the tape is an important parameter in read/write operations. The maximum data transfer rate of a tape drive is normally specified under ideal conditions where a host computer is used which has a data transfer rate equal to the data transfer rate of the tape drive. In actual applications this is generally not the case and the tape drive can be used with a variety of computers having different transfer rates, which therefore affects the overall system transfer rate. For instance, a fast, state of the art tape drive when used with a slow host can actually result in very slow overall system performance due to the fact that the drive must frequently do repositioning in order to wait for the slow host.

In order to improve system performance, variable speed tape drives are sometimes used. However, the current systems to control the speed of the drives suffer from certain shortcomings.

Accordingly, it is an object of the present invention to provide a system and method to optimize the speed of tape drives.

SUMMARY OF THE INVENTION

The present invention includes a method for operating a system comprising a host computer, a buffer, a tape drive and a tape. The method includes writing data to the tape while the tape is traveling at a first speed; stopping the tape; determining an optimum second speed to drive the tape to travel; and, thereafter driving the tape to travel at the second speed while writing data to the tape.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated into and constitute a part of this specification, illustrate one or more embodiments of the present invention and, together with the detailed description, serve to explain the principles and implementations of the invention.

In the drawings:

FIG. 1 is a view of a conventional tape drive system.

FIG. 2 is a block diagram showing an exemplary arrangement of a control card and tape drive according to the prior art.

FIG. 3 schematically illustrates the under run and reposition operations.

FIG. 4 is a table showing example parameters for a tape drive system.

FIG. 5 is a table showing back up times,

FIG. 6 is a table showing repositioning times.

FIG. 7 is a table showing number of under runs.

FIG. 8 is a graph showing rate error as a function of data set count.

DETAILED DESCRIPTION

Embodiments of the present invention are described herein in the context of a system and method for tape drive control. Those of ordinary skill in the art will realize that the following detailed description of the present invention is illustrative only and is not intended to be in any way limiting. Other embodiments of the present invention will readily suggest themselves to such skilled persons having the benefit of this disclosure. Reference will now be made in detail to implementations of the present invention as illustrated in the accompanying drawings. The same reference indicators will be used throughout the drawings and the following detailed description to refer to the same or like parts.

In the interest of clarity, not all of the routine features of the implementations described herein are shown and described. It will, of course, be appreciated that in the development of any such actual implementation, numerous implementation-specific decisions must be made in order to achieve the developer's specific goals, such as compliance with application- and business-related constraints, and that these specific goals will vary from one implementation to another and from one developer to another. Moreover, it will be appreciated that such a development effort might be complex and time-consuming, but would nevertheless be a routine undertaking of engineering for those of ordinary skill in the art having the benefit of this disclosure.

In accordance with the present invention, the components and process steps may be implemented using various types of operating systems, computing platforms, computer programs, and/or general purpose machines. For example, the calculations and algorithms described below could be carried out in an MPU such as the MPU 38 shown in FIG. 2. In addition, those of ordinary skill in the art will recognize that devices of a less general purpose nature, such as hardwired devices, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), or the like, may also be used without departing from the scope and spirit of the inventive concepts disclosed herein.

FIG. 3 schematically illustrates the under run and reposition operations. The upper part of FIG. 3 shows the relative quantity of data in the data buffer 54 (on the vertical axis Y) as a function of time (on the horizontal axis X.) The lower part of FIG. 3 illustrates the speed of the tape (on the vertical axis Y.sub.1) as a function of the position on the tape (on the horizontal axis X.sub.1). Beginning at the left of the Figure it can be seen that there is data in the data buffer 54, the tape is traveling forward at a speed V.sub.0, and the tape drive is writing data from the buffer 54 to the tape 20. Then when the data buffer 54 becomes empty, the time is T.sub.A, and the tape is at the append position 60. At this time the data flow unit 46 instructs the servo control 44 and motor control unit 50 to slow the tape down and stop the tape at stop point 62. The motor control unit 50 then commences the reposition operation which causes the tape to travel in the reverse direction until the tape reaches maximum reverse speed at point 64 and then slows down to stop as indicated at reposition point 66. The motor control unit 50 keeps the tape stopped until the buffer contains sufficient data, at which time the servo control unit 44 instructs the motor control unit to accelerate the tape in the forward direction until the tape reaches the next tape speed V.sub.1 as indicated at ramp-up end point 70. When the tape then reaches the append position 60, or at some predetermined distance thereafter, data is again written to the tape from the buffer 54.

It should be understood that the next tape speed V.sub.1 can be the same as the prior speed V.sub.0 or different from the prior tape speed V.sub.0. In some applications it is desirable to always use the same tape speed, in which case V.sub.1 is always equal to V.sub.0. However, we have developed a system and method to optimize the tape speed, in which case V.sub.1 is not necessarily the same as V.sub.0. With reference to FIG. 3, if V.sub.1 is less than V.sub.0, then ramp-up end point 70 is lower than V.sub.0 and ramp-up end point 70 precedes the append position 60. On the other hand, if V.sub.1 is equal to V.sub.0, then ramp-up continues from point 66, through point 70 and up to end point 71, as indicated by the dashed line 72, and writing begins at the append point 60.

Simulation

We have developed a computer simulation of a tape drive and computer system using the Matlab-Simulink modeling tool. It should be understood that others could use other tools such as C programming to accomplish comparable simulations. Also, it should be understood that comparable data and tables could be determined based on experiments with computers and tape drives.

We ran our simulation under a variety of conditions to develop data to compile tables for a variety of host and tape drive systems. As one example we used the parameters shown in Table I (FIG. 4) in a set of simulations to compile the data shown in shown in FIGS. 4 6 (Tables II, III and IV, respectively). The "Values" shown in the right most column of Table I are typical for many computer systems and tape drives.

The following definitions apply to terms used in Tables I-IV: Repo-to-Repo Time: This is the time that it takes to empty out a saturated buffer, i.e. the time between one reposition operation and the next succeeding reposition operation. Total Write Time: This data tells us the total time that it took to write a predefined dataset number to the tape. Number of Under Runs: The total number of under runs that the drive had to do during the writing of the tape.

The following explains Tables II, III and IV: Table II shows the back up time, for a given host rate in Mb/sec and a tape speed, V.sub.t, in m/sec, i.e. how long it takes to write a full wrap of data, in seconds. Full wrap is a run from bot to eot. Table III is the actual repo-to-repo time for each case. Table IV is the number of detected under runs for each case. In Table II "ideal speed" is the ideal tape speed in m/sec--the speed that corresponds to the theoretical maximum transfer rate for a given host rate. For instance, for a host rate of 13 MB/s and Max Tape speed of 5.916 m/s and Max Transfer Rate of 34 MB/s, the ideal speed is 2.3 m/s (which is between V.sub.t of 2.077 and 2.5 shown in Table II.) Ideal time is the time takes to run the full wrap at ideal speed. Times indicated by an asterisk in Table II are determined with reference to Table IV. In Table IV certain times correspond to zero under runs, and those times are identified in Table II with an asterisk. For example, in Table IV for the host rate of 20 Mb/sec the corresponding speed Vt is 3.5 m/sec. Thus in Table II the time of 163.9, which corresponds to the speed of 3.5 m/sec, is shown with an asterisk. Error is the delta time between the ideal time and the times indicated with an asterisk. For example, for a host rate of 20 Mb/sec, the time of 163.9 is indicated by an asterisk; the ideal time is 156.2 sec; and the error is -7.66 sec.

The following example can now be understood. For instance, when Host Rate is 13 MB/s and the drive is running at 3.5 m/s speed, we generate 26 under runs (Table IV) and 6.32 sec delta time between the under runs (Table II). This number of under runs will result in a total time for a full wrap of data of 260.8 sec. (Table II). Since the ideal time at this host rate is 240.4 sec (Table II) the system will suffer drastically causing a time delay of 20.4 seconds.

We have found that the optimum tape speed is a speed slightly higher than the ideal tape speed so that we can achieve 1 to 2 under runs over the full wrap and therefore we are able to detect host rate increases as well as run at nearly ideal speeds. In other words, it might appear to be desirable to run that tape at the ideal speed. However, if one were to do so then zero under runs would be achieved and we would not be able to account for increases in the Host Rate. This can be understood from the following example. Let us assume that the Host Rate is 20 MB/s and the drive running at 3.5 m/s; so that zero under runs occur, as indicated in Table IV. Now, if the Host rate increases to e.g. 30 Mb/sec, zero under runs will still occur, and the drive would continue to operate at 3.5 m/sec. Thus it can be seen that the Host-Drive system will not perform optimally since the Host will frequently fill the buffer which in turn requires that the Host stop filling the buffer until the drive is able to catch up. Frequently stopping and starting the Host results in a relatively slow overall system transfer rate.

Turning again to the example above, with Host Rate of 13 MB/s and the drive running at 3.5 m/s speed the optimum speed is of 2.3 m/s that will result of 1 to 2 under runs over the full wrap.

Graph I

Turning now to Graph I (FIG. 8) the graph shows Transfer Rate Error vs. Data Set Count. The Data Set Count is defined as the number of data sets that are written to the tape from the start of the tape to the beginning of the first under run. The Transfer Rate Error is defined as the difference between the drive Transfer rate and the Host Transfer Rate.

We created Graph I experimentally. However, similar graphs could be created using computer simulations.

Now, having Graph I we determine an equation describing the graph. In this particular case, the equation, Equation 1 in this example, is Y=3780.6 X.sup.-1.027

Actual Operation

Having this information, we can now optimize the tape speed during operation of a tape drive--host computer system, as follows.

For example, assume that we have a tape drive and host system with the parameters given in Table I, and the tape has been traveling at the rate of 6 m/sec. and the drive has a transfer rate of 34 Mb/sec. Our system continuously monitors the number of data sets being written. When the buffer becomes empty a reposition operation is initiated, and the system determines the number of data sets which have been written since the immediately preceding under run. In this case let us assume that that number of data sets is 220. Now the system uses Equation 1 or Graph I to determine the Transfer Rate Error, which in this case is approximately 8 Mb/sec. Knowing this information the system estimates that the host transfer rate was 34 minus 8=26 Mb/sec. Then the system utilizes Tables II and IV. For the given host rate of 26 Mb/sec it can be seen that the ideal tape speed is about 4.5 m/sec since at that speed there would be zero under runs. Accordingly the system selects the next higher tape speed above 4.5 m/sec., if a discrete speed system is being used. In this example, the next higher tape speed is 5.1 m/sec as shown in Tables II and IV. However, if a variable speed drive system is in use, the system selects the appropriate higher speed to achieve one or two overruns, which in this example would be about 4.6 m/sec.

While embodiments and applications of this invention have been shown and described, it would be apparent to those skilled in the art having the benefit of this disclosure that many more modifications than mentioned above are possible without departing from the inventive concepts herein. The invention, therefore, is not to be restricted except in the spirit of the appended claims.

*


Free Web Sudoku Puzzles.
Solve with your browser.
      4       3  
          6     1
  4 5 7   1   6  
  1   9         6
3 8           4 2
6         4   9  
  3   6   2 7 5  
1     8          
  2       5      
What is it?



Add Your Site · Terms Of Service · Privacy Policy


DISCLAIMER
Linkgrinder is a free service that searches the Internet and indexes all files found so that you may search quickly and easily for shared files. These files are created and made available individually by users whose identity we are not aware of and who we have no control over. In essence we function like a search engine tool; these files ARE NOT STORED OR SERVED BY OUR NETWORK. We are not responsible for any materials obtained by using our service. We do not monitor any of the contents of these files. These files may contain viruses, illegal materials, materials inappropriate for minors, offensive files and the like. BY USING OUR SERVICE, YOU ASSUME FULL RESPONSIBILITY FOR DOWNLOADING THESE MATERIALS AND WILL INDEMNIFY US FOR ANY DAMAGES THAT MAY BE INCURRED.

For More Specific Information VIEW OUR TERMS OF SERVICE.

Thank you and Enjoy!