scispace - formally typeset
Search or ask a question

Showing papers on "Data Corruption published in 1996"


Patent
03 Sep 1996
TL;DR: In this paper, the authors present a heuristic analysis of the methods of the present invention locate and identify buffers accessed within the captured state logic data and buffer descriptors accessed within a captured-state logic data despite the time dispersion thereof.
Abstract: Methods and associated apparatus for analyzing and presenting captured state logic data including memory accesses by an intelligent I/O interface device and an attached computer system. The data analysis and display of the present invention aids an engineer in locating data corruption failures in a system. The heuristic analysis of the methods of the present invention locate and identify buffers accessed within the captured state logic data and buffer descriptors accessed within the captured state logic data despite the time dispersion thereof. The buffers and buffer descriptors located and identified within the captured state logic data are displayed on a computer display screen in a manner to more effectively assist an engineer in locating a root cause of data corruption than was possible with prior methods devoid of the analysis of the present invention. In particular, the display visually identifies buffers regardless of the state/time dispersion in the original captured state logic data and distinguishes read access from write access thereto. The display includes indicia used to associate a located and identified buffer descriptor with the identified buffer to which it refers. In response to user requests, the data contained in a selected buffer or selected buffers may be textually displayed either in a raw form or in accordance with the protocol specifications of the underlying data exchange application being debugged. The identified buffers may also be easily searched for a user specified string without concern for the time dispersion of the buffers in the captured state logic data.

48 citations


Journal ArticleDOI
TL;DR: The IBMLZ1 compression algorithm was designed not only for robust and highly efficient compression, but also for extremely high reliability, because compression removes redundancy in the source, the compressed data become extremely vulnerable to data corruption.
Abstract: Data compression allows more efficient use of storage media and communication bandwidth, and standard compression offerings for tape storage have been well established since the late 1980s. Compression technology lowers the cost of storage without changing applications or data access methods. The desire to extend these cost/performance benefits to higher-data-rate media and broader media forms, such as DASD storage subsystems, motivated the design and development of the IBMLZ1 compression algorithm and its implementing technology. The IBMLZ1 compression algorithm was designed not only for robust and highly efficient compression, but also for extremely high reliability. Because compression removes redundancy in the source, the compressed data become extremely vulnerable to data corruption. Key design objectives for the IBMLZ1 development team were efficient hardware execution, efficient use of silicon technology, and minimum system-integration overhead. Through new observations of pattern matching, match-length distribution, and the use of graph vertex coloring for evaluating data flows, the IBMLZ1 compression algorithm and the chip family achieved the above objectives.

35 citations


Journal ArticleDOI
01 Apr 1996
TL;DR: Message size, coding techniques and interleaving are examined with respect to the choice of a coding strategy for a secure data communication system for unit protection.
Abstract: The dramatic growth in new designs of microprocessor relays has led to a growth in the use digital communications for protection. Unfortunately in any communication system there will always be some corruption of the received data. Part of the art and science of relay design is therefore to take this into account. This paper examines coding techniques designed to minimise the probability of corrupted data being declared as healthy. Message size, coding techniques and interleaving are examined with respect to the choice of a coding strategy for a secure data communication system for unit protection.

2 citations