Abstract:
The improved data compression system (100) concurrently processes both strings of repeated characters and textual substitution of input character strings. In this system (100), the performance of data compression techniques based on textual substitution are improved by the use of a compact representation for identifying instances in which a character in the input data stream is repeated. This is accomplished by nesting a run length encoding system (110) in the textual substitution system (111, 112, 120). This structure adds the recognition of runs of a repeated character before the processor performs the textual substitution data compression operation. A further performance improvement is obtained by expanding the alphabet of symbols stored in the compressor's dictionary (120) to include both the characters of the input data stream and repeat counts which indicate the repetion of a character. The handling of these repeat counts by the textual substitution based compression technique is no different than the handling of characters, or certain modifications are made in the handling of repeat counts.
Abstract:
A method and apparatus for loosely coupling a plurality of processors in a multiprocessor system to perform a coordinated task. The coordination of the task is implemented by an early start mode data transfer apparatus which coordinates the reading and writing of data files into and out of the data buffer (101) of the control unit (100) so that a data file can be written into the data buffer (101) while another file is concurrently being read out of the data buffer (101). Thus, both the host computer (130) and the associated tape drive units (140) can be active at the same time that data files are being read from or written into the data buffer (100) of the tape control unit (101).
Abstract:
The use of a dynamically mapped virtual memory system (100) permits the storage of data so that each data record occupies only the physical space required for the data. Furthermore, the data storage subsystem (100) manages the allocation of physical space on the disk drives (122-125) and does not rely on the file extend defined in the count key data format. Data compaction apparatus is provided to remove the gaps contained in the stream of count key data records received from the host processor (11, 12). A data compression algorithm (203-0) is then used to compress the received data into a compressed format for storage on the disk drives (122-125). It is the compacted, compressed data that is finally stored on the disk drives (122-125). Furthermore, any data record received from the host processor (11, 12) absent data in the user data field therein is simply listed in the virtual memory map as a null field occupying no physical space on the disk drives (122-125). The data storage control (101), through its mapping capability, stores the actual data in the minimum physical space required by overcoming the limitations imposed on large form factor disk drives by the use of count key data format data records. However, the data storage subsystem (100) returns this stored data to the host processor (11, 12) in count key data format through a data record reformatting process once the stored compacted compressed data is staged to the cache memory (113) for access by the host processor (11, 12). The data storage subsystem (100) is operationally independent of the host processor (11, 12), yet performs as if it were a standard operationally dependent large form factor disk subsystem.
Abstract:
The adaptive data compression apparatus (100) is located within a tape drive control unit between one or more host computers and tape transports. The apparatus (100) efficiently compresses a data file into a bit oriented compressed format for storage. An input data file is divided into predetermined sized segments which are compressed independently of any other segment. The apparatus (100) uses a plurality of compression algorithms (105) best suited to the data files. A cyclic redundancy check circuit (104, 206) computes a predetermined length CRC code for all incoming data bytes before compression. The CRC code is appended to the end of the compressed data block. The apparatus (100) compresses bytes and strings of bytes into shorter bit string codes called reference values for recording. A run length form for characters repeated three or more times and a string form that recognizes patterns of two or more characters are used.
Abstract:
The moving data storage media mode/direction change optimization apparatus makes use of information received concerning the mode and direction of the next operation to be performed by the data storage system to efficiently reposition the media in a single repositioning operation. In the case where the data storage media is a magnetic tape, the tape control unit (100) receives information (121-131) concerning the mode and direction of the next operation to be performed prior to the completion of the tape transport automatic repositioning cycle. The tape control unit (100) signals the tape transport (111) to abort the standard repositioning operation and instead to initiate a new repositioning operation which repositions the magnetic tape based on the mode and direction of both the presently executing operation and the next operation. This use of a single repositioning operation, taking into account the mode and direction of the timewise subsequent operation, significantly reduces the amount of time required to reposition the magnetic tape to a point appropriate for the next operation.
Abstract:
The improved data compression system (100) concurrently processes both strings of repeated characters and textual substitution of input character strings. In this system (100), the performance of data compression techniques based on textual substitution are improved by the use of a compact representation for identifying instances in which a character in the input data stream is repeated. This is accomplished by nesting a run length encoding system (110) in the textual substitution system (111, 112, 120). This structure adds the recognition of runs of a repeated character before the processor performs the textual substitution data compression operation. A further performance improvement is obtained by expanding the alphabet of symbols stored in the compressor's dictionary (120) to include both the characters of the input data stream and repeat counts which indicate the repetion of a character. The handling of these repeat counts by the textual substitution based compression technique is no different than the handling of characters, or certain modifications are made in the handling of repeat counts.
Abstract:
A method and apparatus for loosely coupling a plurality of processors in a multiprocessor system to perform a coordinated task. The coordination of the task is implemented by an early start mode data transfer apparatus which coordinates the reading and writing of data files into and out of the data buffer (101) of the control unit (100) so that a data file can be written into the data buffer (101) while another file is concurrently being read out of the data buffer (101). Thus, both the host computer (130) and the associated tape drive units (140) can be active at the same time that data files are being read from or written into the data buffer (100) of the tape control unit (101).
Abstract:
The adaptive data compression apparatus (100) is located within a tape drive control unit between one or more host computers and tape transports. The apparatus (100) efficiently compresses a data file into a bit oriented compressed format for storage. An input data file is divided into predetermined sized segments which are compressed independently of any other segment. The apparatus (100) uses a plurality of compression algorithms (105) best suited to the data files. A cyclic redundancy check circuit (104, 206) computes a predetermined length CRC code for all incoming data bytes before compression. The CRC code is appended to the end of the compressed data block. The apparatus (100) compresses bytes and strings of bytes into shorter bit string codes called reference values for recording. A run length form for characters repeated three or more times and a string form that recognizes patterns of two or more characters are used.
Abstract:
The present data file storage management system for snapshot copy operations maintains a two level mapping table which enables the data files to be copied using the snapshot copy process and only having to update a single corresponding mapping table entry when the physical location of the data file is changed. The snapshot copy updates to the contents of the first level of the two level mapping table are stored on the backend data storage devices to provide a record of the snapshot copy operation which can be used to recover the correct contents of the mapping table. This record of the snapshot copy operations remains valid even though the physical location of a copied data file instance is subsequently changed. Furthermore, the physical storage space holding the updated portions of the first level of the two level mapping table can be managed using techniques like those used to manage the physical storage space holding data file instances. Mapping table updates resulting from the snapshot copy operation are delayed until all mapping table updates resulting from earlier data file write operations have been completed and any attempt to update the mapping table to reflect data written to the original data file or the copy data file that occurs after initiation of the copy must wait until the first set of mapping table pointers has been copied.
Abstract:
Le système (100) amélioré de compression de données traite simultanément à la fois des chaînes de caractères répétés et une substitution textuelle de chaînes de caractères d'entrée. Selon ce système (100), on améliore la performance de techniques de compression de données basées sur la substitution textuelle, par l'emploi d'une représentation compacte permettant d'identifier les cas dans lesquels un caractère se trouvant dans le flux de données d'entrée est répété. On parvient à ce résultat par emboîtement d'un système (110) codant une longueur de passage, dans le système (111, 112, 120) de substitution textuelle. Cette structure ajoute la reconnaissance de passages d'un caractère répété avant que le processeur ne procède à l'opération de compression de données de substitution textuelle. On obtient une autre amélioration de performance en élargissant l'alphabet des symboles stockés dans le dictionnaire (120) du compresseur afin d'inclure à la fois les caractères du flux de données d'entrée et les comptages de répétition indiquant la répétition d'un caractère. La manipulation de ces comptages de répétition à l'aide de la technique de compression basée sur la substitution textuelle n'est pas différente de la manipulation de caractères, ou certaines modifications sont effectuées dans la manipulation de comptages de répétition.