BUFFER SYSTEM WITH DETECTION OF READ OR WRITE CIRCUITS' FAILURES

Abstract: An improved data buffer has a storage tray (14) that is addressable for read and write operations by an address of n bits that are supplied by a read address counter (16) and a write address counter (18) which each have n+1 bits. The (n+1)th bit is in effect a modulo-2 counter for passes through the array by the read and write circuits. During a write operation the (n+1)th bit (44) of the write counter (18) is stored as part of a parity bit (P) for the addressed array location. During a read operation the (n+1)th bit (51) of the read address counter (16) is entered into a parity checking function (30) on the word read (25) from the addressed location. An error is signalled if the (n+1)th bit of the read address counter does not agree with the (n+1)th bit of the write counter at the time of the write operation. For example, an error is detected if the write circuits fail and the read circuits make a second pass through words that have not previously been read. This prevents reading the same entries on a next pass through the array (14).

Description: Field of the Invention This invention relates to data processing systems and more specifically to a buffer system with means for detecting errors caused by failures in the read and/or write circuits. Introduction Queues A queue that is implemented in a buffer memory is well known, but it will be helpful to review the features and terminology that particularly apply to this invention. It will usually be helpful to distinguish between terms that identify data units and terms for the associated units of hardware, but it is not always necessary to make this distinction and some of the terminology can be used in a general way. In a data processing system, a "list" is a sequence of data items or entries, for example a list of patent numbers. The ends of the sequence are called the "top" and the "bottom" or the "front" and the "back". The entries in a list can be accessed in some arbitrary order for adding or removing items, and a separate terminology exists for special accessing procedures. When entries are entered at the back of the list and are removed from the front of the list, the list is called a "queue" by analogy to a queue of riders waiting at a bus stop. A queue can also be called a first-in-first-out list. A queue commonly holds a sequence of data items that are being transferred from a sending component to a receiving component. Data items are entered into the queue by the sender and are removed from the queue by the receiver. The first-in-first-out organization of the queue preserves the original sequence in which the items were transmitted from the sender to the receiver. The term "buffer" describes this function, and a queue that is used for this purpose is commonly called a buffer. Data Buffers A queue, which has been described so far as a data construct, can be implemented as a block of sequential storage locations in a physical storage device, one storage location for each entry. The storage device that implements a buffer or a queue is called a buffer store or a buffer memory, or the term buffer can be used to express both the data aspect and the hardware aspect. A buffer can be part of a larger memory or it can be implemented in an independent memory that is used only to implement the queue. A storage location in the buffer can be accessed for a read or write operation by means of an address. An address can be treated as a number, and addresses for accessing each storage location in sequence can be formed by incrementing or decrementing a counter. For an introductory example, the front of the queue can be assigned arbitrarily to the high address storage location. Since the length of the queue varies as items are entered and removed, a queue or buffer management system has a counter that keeps track of the address of the back of the queue. This address is commonly called the back pointer or, to emphasize the memory hardware aspects, the write pointer. As a specific example, suppose that storage locations 0 to 127 have been allocated to the queue and that storage location 127 holds the front of the queue. If the queue is full, the back pointer points to storage location 0 and if it is empty it points to location 127. When an item is added to the storage location of the back pointer, the back pointer is decremented to the next storage location. In this example, when an item is removed from the front of the queue, all remaining items in the queue would be shifted forward one storage location, like riders at the bus stop, and the back pointer would be incremented. More commonly, the data entries do not shift forward when an item is removed, but instead the queue management system has a counter that is analogous to the back pointer that has been described already. The count value of this counter is called the front pointer or the read pointer. When an item is removed from the storage location identified by the front pointer, the front pointer is decremented to point to the storage location of the next item at the new front of the queue. Similarly in this implementation, the back counter is decremented when an item is added to the queue and it is not changed when an item is removed. The queue is often circular: when the back pointer has been decremented to storage location 0 in the example, it next wraps around to storage location 127. The front pointer is similarly decremented. A seven bit address counter wraps around in a way that provides this sequence. Decimal 127 is binary 0111 1111 (the binary digits are grouped in fours to make them easier to read), and decimal 128 is 1000 0000. Such a counter is called a modulo-128 counter. The same effect is achieved by reading only the seven low order bit positions of a longer counter. Note that the pointers are decremented (instead of incremented) only because the queue in the example has been formed with the front arbitrarily at the high address and the back at the low address. From a more general standpoint, a pointer is "advanced" in whichever direction is implemented. For generality, the direction will be from front to back around the circle, with a reference to the wrap around operation only where a reminder is appropriate. The general case will be readily apparent where specific examples are used. The buffer management system handles the pointers for proper data entry. Unless the queue is empty (as discussed later), the front pointer points to a valid entry at the front of the queue. The back pointer points to the first empty storage location, which is one location beyond the last valid entry. As entries are removed from the queue, the front pointer is advanced (the front pointer counter is incremented or decremented) through a sequence of previously filled storage locations. As new entries are made at the back of the queue, the back pointer is advanced through previously emptied storage locations. When the back pointer has been advanced to the front pointer, the queue is full and no more items can be entered. The queue is made large enough to handle data at the maximum rate of the sender to prevent the queue from overflowing, or some appropriate action must be taken to reduce the data rate of the sender to the rate of the buffer. When the front pointer reaches the back pointer, the queue has become empty, and this condition may signal the entry removing circuits to stop. This condition occurs normally after the sending component has sent the last entry to the buffer or when the sending component has momentarily stopped or slowed. Note that a particular pointer management system may advance a pointer before a read or write operation or after the operation, and this choice will affect the relative positions of the read and write pointers in the examples. This effect is well known, and the general case will be understood from the specific examples. This invention will preferably be embodied in a hardware buffer that handles only the queue, and it will be helpful to introduce the terminology of these buffers. The unit of data in a storage location is commonly called a "memory word" or a "word" and a storage location for a word can be called a word location. The operation of entering a word into the buffer is called store or write and the operation of removing a word from the buffer is called fetch or read. Error Detection in Buffer Memories When an error has occurred in a memory word, a bit that had a 0 or 1 value when the word was stored has been changed to the opposite value when the word is read from the memory. A parity checking circuit in effect counts the number of 1 bits in a word and then concatenates a 1 or 0 parity bit to the word such as to make the total count either odd or even, whichever is selected for the error detection system. Adding a 1 bit changes the parity from odd to even or from even to odd, and adding a 0 bit leaves the parity unchanged. From a logic circuit standpoint, the parity function is the Exclusive OR function of the data word, and parity check circuits are usually implemented as a tree of binary Exclusive OR circuits. If the parity circuit adds a bit that gives each word odd parity before the word is stored in the memory, the circuit is called an odd parity circuit. In a system with odd parity, all valid words have odd parity and all words with even parity are invalid. Thus, a single error either increases or decreases the number of 1 bits and thereby changes the parity of the word. If two errors occur in the same word, the word keeps its original parity, and the error is undetectable. It is conventional to provide a parity bit position in each storage location. The write circuits that store a memory word calculate the parity bit and store it as part of the memory word. The read circuits that fetch the memory word similarly calculate the parity of the word and signal an error if it has the wrong parity. It is also known to form a parity bit as a function of both the data and the address. During a write operation, the check bits are formed on the data word and the address in the same way that has been described already for forming the check bits on the data word alone. During a read operation, the checking circuits similarly operate on both the memory address and the word read from the addressed location. The fact that the parity function is associative can be used to provide a simplified viewpoint for this description and for some of the later explanation. As the background has been presented so far, the parity of the address and the data would be formed by one large parity tree circuit. The parity of the data and the address can be formed conceptually by first forming the parity of the data and the parity of the address and then forming the parity of these two parity bits. The circuit can be implemented as a first parity generator for the address, a second parity generator for the data and a third parity generator for the two previously formed parity bits. Thus, it is formally correct to consider the parity of the address and the parity of the data separately, and this viewpoint will simplify some of the examples. To illustrate a failure in the addressing circuits, the data word and address for the write operation can be designated word1 and address1, and the check bits formed on word1 and address1 can be designated check1. In the same notation, check2 is formed from word2 and address2 during the read operation. The failure of the addressing circuit causes address1 and address2 to differ and ordinarily causes word1 and word2 to differ. This error may be detectable as a parity error. If more parity bits are provided for each memory word, more complex errors can be detected and/or corrected. The preferred embodiment of the invention will use a one bit parity check, and the examples will be simplified by describing the preferred system. The explanation can be extended readily to more complex codes, and for generality the terms parity circuits and parity bits will be used where each memory word (and preferably each word location) has one or more parity bits. Objects of the Invention The object of this invention is to improve the system that has been described by providing an apparatus for detecting an additional error condition in a buffer memory system as claimed in claim 1. It is possible for a component failure to allow the read operation to advance beyond the write operation and for the read pointer to enter storage locations that so far in this specification have been treated as being empty. In most buffer systems, these storage locations contain the data that were written during the previous pass through the buffer by the write circuits. If the entries were originally correct, they will not cause an error to be detected in these conventional systems. As one example of such a failure, the write circuits may fail while the write pointer advances properly. When the read pointer catches up with the point of failure, the output of the buffer will be formally correct, but the input data will have been lost. This error will probably be caught at some later stage of the operation and the program will be rerun or the data will be recovered in some other way. A failure with similar results can occur if the read or write pointers fail and the read pointer advances beyond the write pointer. The Prior Art The address pointers are conventionally checked as part of the operation already described to signal that the buffer is full or empty. The prior art has suggested a number of circuit redundancy techniques that may be applicable to the pointer checking circuits. Similarly, the read and write circuits can be made redundant. However, it is usually undesirable to make these circuits more complex. It is possible to assign a validity bit to each storage location and to set the bit to valid after a write operation and to invalid after a read operation. Similarly, each storage location can be cleared after a read operation, or it can be written with an invalid bit combination. For example, a bit pattern with bad parity can be written into each storage location after it has been read. If the storage location is read again before valid data is entered by an intervening write operation, a parity error will be signalled. However, these additional write operations ordinarily slow down the operation of the buffer. The IBM Technical Disclosure Bulletin, Vol. 23, No. 3, August 1980, pages 1218-1219, N-Y, US, D.J. LANG et al. discloses a buffer memory system for transmitting a succession of data words between components of a data processing system with a memory array having 2 n storage locations addressable by an address of n bits, means for accessing the array as a circular queue, said accessing means including a modulo 2 n write address counter, means for forming the parity of data to be stored, means for storing a data word and a parity bit at the location of the write address counter, means for incrementing the write address counter for successive write operations, a modulo 2 n read address counter, means for reading a word from the location of the read address counter, means for incrementing the read address counter, and means for checking parity of a data word on a read operation and signalling an error or the absence of an error. This system is not effective and does not combine the write and read operation. Summary of the Invention Reference should be made to the attached claims in which the invention is set out. The buffer system of this invention has an address of n bits that is conventionally formed by a modulo-2 n counter in the way already described. Each storage location has a parity bit position, and the parity bit is an Exclusive Or function of the data and the address, or preferably the data alone, in a modification of the conventional apparatus that has been described. According to the preferred form of this invention, this address is formed from the low order n bits of a modulo-2 n+1 counter, and bit n+1 of the counter is entered into the parity function. In the notation, that will be used in this specification, the low order address bits of the counter will be numbered 1 through n, in contrast to the alternative numbering 0 through n-1. To continue the example for a 7-bit address, the address part of each address counter advances from 000 0000 to 111 1111 on each pass through the buffer. That is, the full eight bits advance from 0000 0000 to 0111 1111 on one pass through the buffer and from 1000 0000 to 1111 1111 on the next pass. Thus, the (n+1)th bit switches between 0 and 1 at the end of each pass through the memory. As has already been explained, the seven low order bits are unchanged by the fact that the eighth bit switches between 0 and 1 at the end of each pass. The (n+1)th bit acts as a 1-bit counter, or a modulo-2 counter, and it will be convenient to call the read and write passes odd and even according to the value of the (n+1)th bit. Suppose that the data word to be written is unchanged on two consecutive passes by the write circuits (or more simply that the parity of the data is unchanged). In the write circuits, the effect of switching bit n+1 of the write address counter is that the same data word now is stored in the memory with odd parity on one pass and even parity on the other pass. Thus, in this example on one pass through the memory the parity bit would be a 1, say, and on the next pass it would be a 0. In the read circuits, the (n+1)th bit of the read address counter is applied to the parity checking circuit so that the inputs to the read parity circuit are the same as the original inputs to the write parity circuit if there has been no error and if the addressing circuits have not failed. However, if the memory word is unchanged during writing, a parity error now will be detected because bit n+1 has been changed at the input to the read parity generator. A more general explanation will be readily understood after the preferred embodiment has been described. The Drawings FIG. 1 is a block diagram of the buffer system of this invention. FIG. 2 shows a sequence of parity generating and checking operations in the buffer system. The Preferred Embodiment Conventional Features - FIG. 1 A buffer memory system 12 has an array 14 of storage locations, a read address register 16 and a write address register 18, a register 22 for data to be written into an addressed location, a register 25 for data read from a storage location, an Exclusive Or tree for forming a parity bit to be stored with the word in write register 22 and an Exclusive OR tree for forming a parity bit that signals whether an error has been detected in the word read from the memory. Data to be written enters the buffer system on a bus 34 that is connected to a sending component, or data source, and data to be read leaves the buffer on a bus 37 that is connected to a receiving component, or data sink. In a preferred application, the buffer is connected between central processor memory and an auxiliary storage device such as a magnetic recording disk, and means (not shown) are provided for switching busses 34 and 37 for transmitting data in either direction. Preferably buses 34 and 37 are each as wide as the disk storage device. Other components (not shown) change between the format of bus 34 or 37 and the wider bus of main memory. Data from the sender 34 preferably has a parity bit, denoted as Write Data Parity on a line 39. Circuits that are not shown in FIG. 1 check bus 34 and line 39 for correct parity. Similarly, a line 40 carries a parity bit, denoted as Read Data Parity for the data on bus 37. Address counters 16 and 18 receive signals on lines 49 and 41 that advance the counters (increment or decrement) at a suitable point in each memory access cycle. Conventional means is provided to signal that the buffer is full or empty or not empty, and conventional means is provided to prevent the read counter from advancing past the write pointer. As the drawing has been described so far, the components and their interconnections are conventional and are well known in various specific forms. The Write and Read Addressing Circuits--FIG. 1 The low order n bits of write counter 18 form a conventional modulo-2 n counter for addressing the array. The preferred buffer has 128 addressable locations, and counter 18 holds 7 address bits that generally are numbered 1 through n. The (n+1)th bit is not used in addressing but forms a signal Write Pass Parity on a line 44 which is an input to Exclusive Or circuit 27. Circuit 27 produces a signal Write Parity on a line 46 which is entered into the conventional parity bit position (P) of Write Data register 22. The read address circuits are similar to the write address circuits. The low order n bits of read counter 16 form the address for the word at the front of the queue. Exclusive Or circuit 30 receives the conventional Read Parity bit on a line 47 from the parity position of the memory data out register 25, and it receives the bit Read Pass Parity from the (n+1)th position of counter 16 on a line 51. Exclusive Or circuit 30 produces the signal Read Data Parity on a line 40. Bus 37 and parity line 40 are handled conventionally by circuits that receive the data and parity bit except that an addressing circuit fault in buffer system 12 will cause a parity check, as will be explained below, in the description of FIG. 2. Operation--FIG. 2 In FIG. 2, the buses Write Data 34 and Read Data 37 will be familiar from FIG. 1. Block 56 represents one location in memory array 14 for storing the data word and parity bit for this example. The signals Write Pass Parity on line 44 and Read Pass Parity on line 51 are generated by the counters 18 and 16 shown in FIG. 1 and are combined with signals Write Data Parity and Read Parity in Exclusive Or circuits 27 and 30 respectively, as in FIG. 1. FIG. 2 additionally shows a parity tree circuit 57 that operates on the data on Write Data bus 34 to form the Write Data Parity bit on line 39, and it shows a conventional parity checking circuit 58 that is connected to bus 37 and parity bit line 40 at the output of the memory. The parity checking circuit 58 has an Exclusive Or tree 60 that forms the parity of Read Data on bus 37 and Read Data Parity on line 40. An example later will show that an addressing circuit fault causes parity checker 58 to raise a signal Error on line 62. Components 57 and 58 are a conventional part of the data processing apparatus using the buffer system of this invention. It will be helpful to review first the conventional data checking function illustrated by FIG. 2. In conventional apparatus without Write Pass Parity and Read Pass Parity and without Exclusive Or circuits 27 and 30, Write Parity is the same as Write Data Parity and Read Parity is the same as Read Data Parity. An error is signalled if Read Data differs detectably from Write Data. If no data error has occurred, Write Data, Memory Data, and Read Data are all identical and therefore have the same parity. The parity of Write Data on line 39 is stored in the parity bit position P of memory location 56. Exclusive Or tree 60 in effect forms the parity of the bits of Read Data on line 37 and compares it with the parity bit on line 40 from parity bit position P of memory location 56. An error is signalled if the parity of Read Data differs from the parity of Write Data, that is, if the parity bit read from memory location 56 is not the correct parity of Read Data. When the addressing circuits operate without error, Write Pass Parity on line 44 equals Read Pass Parity on line 51. On even passes, Write Pass Parity and Read Pass Parity are each 0, for example. Since a 0 bit has no effect at the input of an Exclusive Or circuit, Write Parity on line 46 equals Write Data Parity on line 39 and Read Parity on line 47 equals Read Data Parity on line 40. Thus, this example is the same as the earlier example of conventional data error checking. Similarly, on odd passes Write Pass Parity and Read Pass Parity both equal 1. Exclusive Or circuit 27 inverts the Write Data Parity bit and Exclusive Or circuit 30 inverts the Read Parity bit. These two changes preserve the original parity and no error is detected in parity check circuit 58. Conversely, if Write Pass Parity and Read Pass Parity are not equal, one of the Exclusive Or circuits 27 or 30 inverts its other input (Write Data Parity or Read Parity) and the other Exclusive Or circuit transmits the other input unchanged. Thus, there is a single change in a bit in the data path, and a parity error will be detected in parity checker 58. As the data transfer operation has been described so far, the write pointer would remain at the position of the last word written into the array and the read pointer would advance to this position as the remaining words are read from the array. After the last word has been read, the read and write pointers would be ready to begin a next data transfer, starting at the next storage location in the array. Some data transfers are handled differently. When an I/O device is the sending unit and a processor memory is the receiving unit, the I/O device may send more data than the processor needs. In this situation all of the data from the sender is written into the array, but the read operation is stopped before all of the data has been read. This unread data is in effect discarded. The pointers are reset in either of two ways, by setting both pointers to a fixed starting position or by setting the read pointer to equal the write pointer. In this buffer system the pointers preferably are reset by the conventional operation of setting the read pointer to the value of the write pointer. This operation has a significant beneficial effect when the buffer handles a short data transfer operation. If the pointers are reset to a fixed position to begin each data transfer, the (n+1)th bit of each counter will always be 0 (or always 1) at the beginning of a data transfer. If a short data transfer does not fill the buffer, the (n+1)th bit of the address counters will not be changed and the next operation will begin with the counters reset to the fixed value In this case, an error that occurs when the buffer is not filled will not be detected on the next pass through the buffer. If several short data transfers occur in succession, an error may go undetected for a significant time. By contrast, setting the read pointer to the value of the write pointer causes the (n+1)th bits to change with each pass through the array without regard to the lengths of the data transfers. As is conventional, the pointers are reset when power is first supplied to the buffer system or on a conventional reset of the buffer system. Other Embodiments Ordinarily, a single parity bit will be stored in memory as has been described. If a failure causes multiple errors that are undetectable at some storage locations in array 14, a detectable error will very probably occur in one of the 2 n locations. A specific object of the invention is to detect the failure when it occurs, but a more general object is to detect that an error has occurred at some point during the data transfer where some recovery action can be taken conveniently, for example retransmitting the data through a different path having a similar buffer. In an unpublished further development, Duffy, Lockwood and Zimmerman have proposed independently forming and separately storing Write Pass Parity bit 44 and Write Data Parity bit 39. Their buffer system does not have Exclusive Or circuits 27 or 30. The Write Data Parity bit in a memory word 56 is conventionally applied to Read Data Parity line 40 and it is handled conventionally by components that are connected to receive data on the Read Data bus 37. If a parity error is detected on this bus, it signifies a conventional data error and not an addressing error. On a read operation, the Read Pass Parity bit on line 51 is compared with the previously stored Write Pass Parity bit. A mismatch signifies an addressing error. This development comes under the present invention in its most general form. The buffer is two bytes wide and is implemented as two arrays with separate addressing circuits. A data parity bit position is provided for each byte, as is conventional. In addition, a Write Pass Parity bit position is provided for each data byte, and the Write Pass Parity bit 44 is stared in each array. On a read operation, a three way comparison is made of the two Write Pass Parity bits and the Read Pass Parity bit. Bit position n+1 of address counters 16 and 18 is used in a somewhat different way to form the Write Pass Parity bit and the Read Pass Parity bit. One Exclusive OR circuit is connected between the (n+1)th bit position of the write address counter and the memory, and another Exclusive OR circuit is connected between the (n+1)th bit position of the read address counter and the compare circuit. A latch output forms a second input to each Exclusive OR circuit so that the (n+1)th bit is inverted when the latch is set and is not inverted when the latch is reset. The latch is set and reset from the external source that supplies data to the buffer system. Ordinarily the buffer is not filled during a data transfer, and the pointers are reset and the latch is flipped to provide a different parity for the next data transfer.

Claims: Buffer memory system (12) for transmitting a succession of data words between components (34, 37) of a data processing system, having memory array means (14) having 2 n storage locations (56) addressable by an address of n bits, means for accessing the memory array means as a circular queue, said accessing means including a modulo-2 n write address counter (18), means (57) for forming the write data parity (39) of data to be stored, means for storing a data word and a parity bit at the storage location (56) indicated by the write address counter, means (49) for incrementing the write address counter for successive write operations, a modulo-2 n read address counter (16), means (14, 25) for reading a data word and a read data parity from the storage location indicated by the read address counter, means (41) for incrementing the read address counter, means (58) for checking parity of a data word on a read operation and signalling an error or the absence of an error, read and write circuit means, characterized by a cycle of one of said address counters (16, 18) corresponding to a pass through the memory array means (14) by the read or write circuit means, additional bit position means (n+1) in said write address counter (18) for counting passes through the memory array means by said write circuit means and additional bit position means (n+1) in said read address counter (16) for counting passes through the memory array means by said read circuit means, means for beginning a data transfer with the value of the read pass count (51) set according to the write pass count (44), first Exclusive OR circuit means (27) in said write circuit means for forming a write parity (46) as the combined parity of said write data parity (39) and the write pass count (44) defined by said additional bit position means (n+1) of said write address counter (18), second Exclusive Or circuit means (30) in said read circuit means for forming a combined read data parity (40) for data leaving (37) the memory array means (14) as a function of the read data parity (47) of a data word (25) read from the memory array means and the read pass count (51) defined by said additional bit position means (n+1) in said read address counter (16), and means (58) for checking the data leaving the memory array means, including the read data (37) and the combined read parity (40), whereby a mismatch between the write pass count (44) and the read pass count (51) produces a parity error (62) in the read out data. Buffer memory system as set forth in claim 1, characterized by bit position means (P) in each storage location (56) of the memory array means (14) and means (44, 27, 46, 22) for entering a function of the write pass count into said bit position means of a storage location addressed for a write operation, and means (30, 40, 58) for comparing the read pass count (51) of the read address counter (16) with the write pass count in a word (25) read from the array and for signalling (62) an error if said counts do not compare equal. Buffer memory system as set forth in claim 2, characterized in that the additional bit position means in each of said counters comprises one bit position (n+1), and said means (44, 27, 46, P in 22) for entering and storing a function of the write pass count further comprises one bit position (P) in each storage location (56) of the memory array means (14). Buffer memory system as set forth in claim 3, characterized in that the array is addressable by an address of n bits, said counters each comprise n bit positions of lower order designated 1 through n for the address and a bit position (n+1) for said pass count. Buffer memory system as set forth in claim 4, characterized by means for setting said read address counter (16) according to the value of the write address counter (18) at the beginning of an operation, whereby the said address sequence is continued from one data transfer operation to the next without reset to a fixed starting value and consecutive passes through the array have different count values in the read and write counters (16, 18).

Inventors: CASPER, DANIEL F.
Applicants: INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1985
Main classification: G06F11
IPC codes: H04L13, G06F11, G06F7, G06F5