INTELLIGENT PROCESS CONTROL COMMUNICATION SYSTEM AND METHOD

Abstract: An intelligent front-end communication system which is interposed between a plurality of actively redundant process control computers and a computer network. The intelligent front end communication system includes at least one front end computer which is coupled to the computer network, and a serial communication interface which is coupled between the actively redundant process control computers and the front end computer. The serial communication interface transmits sequential sets of dynamic data from the actively redundant process control computers to the front end computer. The front end computer includes a plurality of reflective or shadow memory buffers for storing and time aligning corresponding sets of dynamic data which are asynchronously received from the serial communication interface.

Description: INTELLIGENT PROCESS CONTROL COMMUNICATION SYSTEM AND METHOD BACKGROUND OF THE INVENTION The present invention generally relates to "front-end" communication techniques between process control computers and a plant/local area network More specifically, the present invention relates to an intelligent front-end communication system and method which is capable of handling a plurality of actively redundant process control computers. In chemical manufacturing plants and other relatively large processing plants, a o network of control computers and operator workstations may be needed to achieve automated control of an ongoing physical process in the plant. For example, the Jones et. al U.S Patent No. 4,663,704, issued on May 5, 1987, shows a distributed processing system for a plant in which a single data highway connects all the various input/output terminals, data acquisition stations, control devices, record keeping devices and so forth. Similarly, the Henzel 5 U S. Patent No. 4,607,256, issued on August 19, 1986, shows a plant management system which utilizes a plant control bus for the purpose of transmitting data to physical computer modules on the network In some of these process control computer networks, redundant process control computers are employed to enhance the reliability of the plant control and monitoring system. 0 For example, the Fiebig et. al U.S. Patent No. 5,008,805, issued on April 16, 1991 , shows a networked control system which includes a "hot standby" redundant processor that synchronously processes a control schedule table for comparison with control messages from a sender processor that are transmitted on the network. The redundant listener processor maintains a duplicate con iguration in its memory ready to take over control of the system in 5 the event of a failure of the sender processor. As another example, the McLaughlin et. al U.S. Patent No. 4,958,270, issued on September 18, 1990, shows a networked control system which employs a primary controller and a secondary controller. In order to maintain consistency between the primary data base and a secondary image of the data base, only predetermined areas changed are updated as a way of increasing the efficiency of the update function. 0 Similarly, the Slater U.S. Patent No.4,872,106, issued on October 3, 1989, shows a networked control system which employs a primary data processor and a back- up data processor. Normally, the back-up processor will be in a back-up mode of operation, and it will not operate to exercise control over the input/output devices or receive data concerning the states of the input output devices. Accordingly, control over the input/output devices is exclusively carried 5 out by the primary processor. However, the primary processor periodically transfers status data relating to its operation in the control of the input/output devices to the back-up data processor via a dual ported memory connecteα between the two processors In contrast with the above networked control systems, another control technique tor redundant process control computers exists in which both of the process control computers operate on input data ana issue control commands to the same output devices This type of control tecnnique may be reterred to as active redundancy, because each of the redundant process control computers operate independently and concurrently on common input data A discussion of this type of control technique may be found in the Glaser et al U S Patent Application Serial No 07/864,931 , filed on March 31 , 1991 , entitled ' Process Control Interface System Having Triply Redundant Remote Field Units" This application is hereby incorporated by reference The use of active redundancy as a control technique presents a difficult problem in terms of communication with the plant computer network, as each actively redundant process control computer will receive a set of input values and each of these process control computers will generate a set of output values In the case where the actively redundant process control computers arbitrate or resolve some or all of the input and/or output values, to the extent that differences do exist, then multiple sets of input and output values could be created For example, a set of pre-arbitratioπ and post-arbitration input data values could potentially be available from each of the actively redundant process control computers Accordingly, it would be desirable to enable some or all of these data sets to be matched up and analyzed by another computer on the plant network without interfering with or slowing down the operation of the actively redundant process control computers Additionally, it would be desirable to permit one or more of the computers on the plant network to modify certain values used by the program in each of the actively redundant process computers as the need may arise, such as analog constants However, it should be appreciated that such an activity would need to be restricted in some manner, as predictable changes in the operation of physical devices should be assured Accordingly, it is a principal objective of the present invention to provide an intelligent front-end communication system and method which enables rapid communication between actively redundant process control computers and a plant/local area network It is another objective of the present invention to provide an intelligent front-end communication system and method which enables corresponding data sets to be asynchronously received and time aligned in a manner that is non-intrusive to the operation of the actively redundant process control computers It is an additional objective of the present invention to provide an intelligent front-end communication system and method which enables the actively redundant process control computers to be remotely located from the plant/local area network It is a further objective of the present invention to provide an intelligent front- end communication system and method which provides substantial data transmission protection for communication with the remotely located, actively redundant process control computers It is yet another objective of the present invention to provide an intelligent front- end communication system and method which enables the correlation of dynamic process data -rom portions of different time aligned data sets SUMMARY OF THE INVENTION To achieve the foregoing objectives, the present invention provides an intelligent front end communication system which is interposed between a plurality of actively redundant process control computers and a computer network The intelligent front end communication system includes at least one front end computer which is coupled to the computer network, and a serial communication interface which is coupled between the actively redundant process control computers and the front end computer The serial communication interface transmits sequential sets of dynamic data from the actively redundant process control computers to the front end computer The front end computer includes a plurality of reflective or snadow memory buffers for storing and time aligning corresponding sets of dynamic data which are asynchronously received from the serial communication interface In one form of the present invention, the serial communication interface includes a first interface circuit which is connected to each of the actively redundant process control computers, a second interface circuit which is connected to the front end computer, and a fiber optic link for enabling remote, bi-directional and simultaneous communication oetween the second interface circuit and each of the first interface circuits Additionally, the reflective memory buffers in the front end computer are triply buffered and operate in a round robin manner The reflective memory buffers may also include a set of correlate buffers to enable oortions of two time-adjacent sets of dynamic data from each of the process control computers to be formed into corresponding data tables that represent data from the same time period. Additional features and advantages of the present invention will become more fully apparent from a reading of the detailed description of the preferred embodiment and the accompanying drawings in which- 3RIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a block diagram of the intelligent front-end communication system according to the present invention. Figures 2A and 2B provide a diagrammatic representation of the data tables stored in a time aligned reflective memory buffer and the Correlate buffer shown in Figure 1 Figure 3 is a block diagram of the application software for the front end computers shown in Figure 1 Figure 4 is a diagrammatic illustration of the configuration for the front end computers. Figure 5 is a diagrammatic illustration of the relationship between the reflective memory buffers in the front end computers, the transfer map in the IFS circuit and the data memory in the process control computers. Figure 6 is a block diagram of the IFS circuit shown in Figure 1 Figure 7 is a block diagram of the IFQ circuit shown in Figure 1 DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Referring to Figure 1 , a olock diagram is shown of an intelligent front-end communication system 10 which is coupled to a pair of actively redundant process control computers 12a-12b. Each of the process control computers 12a- 12b receive common input data from field computer units (not shown) or other suitable field instrumentation In this regard, the Glaser et. al. U.S. Patent Application Serial No. 07/864,931 , referenced above, describes in detail the communication and control links between a pair of actively redundant process control computers, such as process control computers 12a- 12b, and the input/output devices directly associated with the physical process being controlled. While the redundancy of two actively operating process control computers has certain fault tolerance advantages over a single decision making process control computer, it should be understood that the principles of the present invention are not limited to any particular configuration of process control computers. Thus, for example, it may be desirable to employ three process control computers in the place of the two process control computers 12a- 12b shown in Figure 1 underthe appropriate circumstances. In the present embodiment, the process control computers 12a- 12b preferably operate concurrently on all of the signals transmitted from one or more field computer units. In other words, each of the process control computers 12a- 12b are capable of making independent decisions based upon the data received by these redundant computers from the field. The decisions made by the process control computers 12a-12b determine the output signal values which are ultimately directed to specific output devices (for example, valves, pump motors and reactor heaters) by the appropriate field computer units. While the output signal values are preferably reconciled at least to some extent between the two actively redundant process control computers 12a-12b before the transmission of these signals to the field, it should be understood that two independent sets of output signal values could be communicated to the field computer units. In this regard, the input values received from a field computer unit could be arbitrated, which should make it unnecessary to reconcile or arbitrate output values. This is because both of the process control computers 12a- 12b would then be working with the same process control program and operating on the same set of arbitrated input values. As an example of a preferred form of possible value reconciliation, corresponding input value tables in each of the process control computers 12a- 12b could be compared during a preset time period, and one of the values could be chosen for each input value signal to oe subjected to the process control program This selection of input values could be made on a suitable criteria to the process being controlled, such as the use of the value determined by the Left process control computer 12a when the value determined by the Right process control computer 12b is within a certain predetermined percentage limit (for example, 2 5%) Otherwise, the distinct input values of both the Left and Right process control computers could each be employed when these values are found to be outside the predetermined percentage limit Alternatively, the selection of different input/output values from the Left and Right process control computers could be made on the basis of a software implemented preference Thus, for example, under certain process conditions, it may be considered more appropriate to select either the hign or low value, regardless of whether the value was determined by the Left or Right process control computer To facilitate this arbitration or reconciliation process, a parallel communication link 14 is provided between the process control computers 12a-12b Parallel communication link 14 is referred to as the major" link, as it permits a direct transfer of data and timing signals between the process control computers It should also be noted that the Left process control computer 12a is labeled "fox", while the Right process control computer 12b is labeled "dog" These are logical designations for alternative operating modes of the process control computers 12a-12b While each of the process control computers 12a-12b make independent decisions, which may be subject to arbitration, the process control computer currently in the fox mode has the ability to force the process control computer in the dog mode to move to a subsequent step in a programmed sequence in order to keep the cooperative efforts of the two process control computers in relative synchronization Additionally, the process control computer in the fox mode will transmit a timing signal to the process control computer in the dog mode at the beginning of its process control program cycle (for example, a one second period), so that the process control computer in the dog mode will know to begin a new process control program cycle as well As the process control computers 12a- 12b operate under their own clock oscillators, the detection and interpretation of this program cycle timing signal by the process control computer in the dog mode will help to periodically keep these process control computers in relative synchronization However, it should be appreciated that the program cycle of the process control computer in the dog mode will typically follow the program cycle of the process control computer in the fox mode by the period of time it takes to transmit and then detect the program cycle timing signal (for example, 20-mιcroseconds to 20- milliseconds) In the event that process control comDuters 12a- 12b are temporarily not able to communicate over the maior link 14, eacn of these process control computers will continue their operations in a mooe which assumes that they are operating alone In this mode of operation, it should oe appreciated that the program cycles of the process control computers 5 12a- 12b may gradually drift apart in time relative to each other Nevertheless, as will be seen from the discussion below, the front end communication system 10 is designed to enable data received from the process control computers 12a-12b tp be time aligned for real-time analysis As illustrated in Figure 1 , each of the process control computers 12a- 12b includes a stealth interface In particular, process control computer 12a includes stealth interface circuit 10 16a, wnile process control computer 12b includes stealth interface circuit 16b As the stealth interface circuits 16a-16b comprise identical circuits, these stealth interface circuits are sometimes referred to generally herein as stealth interface circuit 16 Due to the redundant nature of the front end communication system 10, a general reference number will also be used for other duplicative components in the system 15 The stealth interface 16 provides transparent data transfers between the process control computer to which it is connected and external communication devices In this regard, the data transfers are transparent to the process control computer 12 in that the operation of the process control computer is not delayed or otherwise adversely affected by a transfer of its data to one or more external communication devices The stealth interface 16 also enables the 20 transfer of messages from an external communication device without affecting the operation of the process control computer 12 The primary example of such an external communication device is shown in Figure 1 to be comprised of a pair of redundant front end computers 18a- -. 18b The front end computers 18a-18b are redundant, because communication paths are provided for enabling each of these front end computers to exchange data and messages with 25 both of the stealth interface circuits 16a-16b Each of the front end computers 18a-18b provide a highly intelligent interface between the stealth interface circuits 16a-16b and a plant local area network, which is generally designated by reference numeral 20 However, since each of the redundant front end computers 18a- 18b are capable of communicating with each of the stealth interface 30 circuits 16a- 16b, it should be appreciated that this redundancy is not required, and that a single front end computer could be utilized in the appropriate application Additionally, as will be more apparent from the discussion below, each of the stealth interface circuits are capable of exchanging data and messages with other external communication devices, as well as the front end computers 18a-18b 35 As illustrated in Figure 1 , the stealth interface circuit 16 features a dual-ported memory "DPM" 22 which resides on the bus structure of the process control computer 12. Indeed, in the embodiment disclosed herein, the dual- ported memory 22 provides the primary or only data memory for the process control computer 12 Thus, in accordance with the present nvention, the stealth interface circuit 16 will selectively grant external devices direct access to * ne data memory of the process control computer itself The dual-ported memory 22 includes an internal port which is connected to the bus structure of the process control computer 12 and an external port, which is sometimes referred to herein as the stealth port While the dual- 5 p orted memory 22 could be configured to provide additional ports, the dual-ported memory p referably includes an aroitration circuit which enables a plurality of external communication devices to have alternative access to the stealth port In other words, only one external device will be able to use the data and address lines of the stealth port at any given time when access to the dual-ported memory is permitted through the stealth port, even though more than one - Q external device may ultimately be coupled to the data and address lines of the stealth port In the present embodiment, the stealth interface arbitration circuit employs a first-come, first- serve approach to granting access rights. However, in accordance with the preferred embodiment, this arbitration circuit operates only on the stealth port. There is no arbitration per se between the internal and < 5 external ports of the stealth interface circuit 16 Rather, access to the dual-ported memory 22 from the external/stealth port is available only during those times when the process control computer 12 cannot access the dual-ported memory More specifically, in the emPodiment disclosed herein, the machine cycle of the process control computer 12 is utilized to control access to the dual-ported memory 16 As is well known, the central process unit of any 20 computer must fetch and decode one or more programmed instructions in order to operate on one or more data words. In computers based upon the von Neumann architecture, it typically takes several computer clock cycles to fetch, decode and execute an instruction However, in the present embodiment, the process control computer 12 is based on the Harvard architecture, which permits both an op-code instruction and the operand data for this instruction to be 25 fetched in the same clock cycle This is because a computer based upon the Harvard architecture includes physically separate instruction and data stores, and each of these stores have their own address and data lines to the central processing unit. Thus, during the portion of the clock cycle for the process control computer 12 that is devoted to fetching and decoding an instruction, the dual-ported data memory 22 may be accessed from the stealth port. Then, 30 during the portion of the clock cycle for the process control computer 12 that is devoted to fetching the operand from the data store, the process control computer will have access to the oual-ported data memory 22 from the internal port. The stealth interface circuit 16 watches for a specific transition in the memory clock signal of the process control computer 12 in order to determine when the stealth port 35 may have access to the dual-ported data memory 16 In this regard, it should be understood that the process control computer itself is not affected by this external access, as external access is permitted by the stealth interface circuit 16 only during those time periods wnen tne process control computer 12 will not need to access the dual-ported data memory 22. Indeed, the process control computer 12 does not even have to know that externally generated read/write activity is actually occurring with respect to its data store Nevertheless, an important distinction is made between the ability to " read" from the dual-ported data memory 22 and the ability to 'write ' to the dual-ported data memory, as far as the stealth port is concerned While it may be desirable to enable an external communication device to read each and every memory location in the dual-ported data memory 22, this may not be true with respect to the ability of an external device to write to memory locations in the dual-ported memory In this regard, the dual-ported data memory 22 will store not only dynamic data associated with the physical process being controlled, but it may also store other process control variables, such as analog and digital constants Accordingly, the dual-ported memory 22 includes two "logical " memory sections, namely variable section 24 and mailbox section 26 These memory sections are logically distinct, because they are treated separately, even though they may both reside in the same physical memory circuit cnip or chip set. In the present embodiment, the mailbox section 26 is comprised of a set of 256 memory word locations (16 bits each) in the dual-ported data memory 22, and the variable section 24 is comprised of the remaining memory locations in the dual- ported data memory 22 (for example, a block of 64k memory word locations) The variable section 24 may also include a message area for holding system messages from the process control computer 12 to the front end computer 18 The mailbox section 26 is used to provide a specific region in memory for storing messages from external devices, such as the front end computers 18a- 18b In this regard, it should be appreciated that the memory locations of the mailbox section 26 do not need to be physically contiguous While the mailbox section 26 may be configured to hold more than one message at any one time, depending upon the message transmission protocol employed, the mailbox section need only be large enough to hold one complete message These messages may be as simple as an external request for the process control computer 12 to gather and transmit health/status data from a remote field computer unit that it may obtain less frequently. A message may also include a command to change a particular variable stored in the dual-ported data memory 22. Additionally, the mailbox section 26 of the dual- ported data memory 22 may also be used to electronically convey a program revision to the process control computer 12 The stealth interface circuit 16 also includes a guardian circuit which prevents any external entity from writing to any memory locations in the variable section 24 of the dual- ported data memory 22. Thus, while some or all of the memory locations in the dual-ported data memory 22 may be read from the stealth port, an external entity is only permitted to write to the memory locations in the mailbox section 26 of the dual-ported memory 22 This feature of the present invention provides a hardware safe-guard at the process control computer 12 which insures that no external entity will be able to inadvertently interfere with the data processing operations of the process control computer 12 This feature of the present invention could also be employed to grant or deny external write access to any particular memory location or set of memory locations in the dual- ported data memory 22 A furtner discussion of the stealth interface circuit 16 may be found in Sederlund et al patent application, serial no , filed on even date herewith, and entitled "Stealth 5 Interface for Process Control Computers" This patent application is hereby incorporated by reference In order to rapidly pump data into or out from the stealth port, the front end communication system 10 of Figure 1 is also shown to include an interface to stealth " IFS" circuit 28, an interface to Q-bus " IFQ" circuit 30, and a set of fiber optic cables 32 interposed 10 therebetween. The IFS circuit 28 is connected to the stealth port of the dual-ported data memory 22, while the IFQ circuit 30 resides on the "Q bus" of the front end computer 12. Due to the redundant nature of the front end communication system 10, it should be appreciated that the IFS circuit 28a is connected to the stealth port of dual-ported data memory 22a, while IFS circuit 28b is connected to the stealth port of dual- ported data memory 22b. Similarly, the 15 IFQ circuit 30a is connected to the Q bus of the front end computer 18a, while the IFQ circuit 30b is connected to the Q bus of the front end computer 18b. In the embodiment disclosed herein, the front end computer 18 is preferably comprised of a MICRO AX 3400 computer using the real-time ELN operating system from the Digital Equipment Corporation " DEC" While the VAX family of computers from DEC offer considerable speed and networking 20 advantages, it should be appreciated that other suitable front end computers may be employed in the appropriate application In order to permit each of the front end computers 18a- 18b to conduct bi¬ directional communications with both of the stealth interface circuits 16a-16b, the fiber optic cables 32 actually include two sets of send and receive optical fibers (for example, 25 62.5/125/0.275NA type fibers) However, the separate send and receive optical fibers for each of the front end computers 18a-18b are represented as single channels in Figure 1 for simplicity Thus, fiber optic channel 34a includes a separate optical fiber for sending information from the front end computer 18a to the stealth interface circuit 22a and an optical fiber for receiving information from the stealth interface circuit 22a. Similarly, the fiber optic channel 36a 30 includes a separate optical fiber for sending information from the front end computer 18a to the stealth interface circuit 22b and an optical fiber for receiving information from the stealth interface circuit 22b This arrangement of optical fibers is also duplicated for the front end computer 18b In the present embodiment, the combination of the IFS circuit 28, the IFQ circuit 35 30 and the fiber optic cables 32 provide an optical transmission interface which permits the front end computers 18a-18b to be remoted located from the process control computers 12a- 12b For example, in this embodiment it is possible for the front end computers 18a- 18b to be located up to 2 km from the process control computers 12a-12b Additionally, it should be noted that the Fiber Distπouted Data Interface " FDDI " protocol may be used to transmit information between the IFQ and IFS circuits over the fiber ootic cadles 32. The IFS circuit 28 includes the appropriate address and data buffer circuits (not shown) for transferring information to and from the stealth port of the dual-ported data 5 memory 22. The IFS circuit 28 also includes a transfer map 37 which enables data from selected locations in the dual-ported data memory 22 to be gathered and transferred as one contiguous block of data. The transfer map 37 may be comprised of a static RAM with sufficient address storage capability to gather data from all of the available memory locations in the dual- ported data memory 22. 1 o Additionally, the IFS circuit 28 includes a separate transmitter and receiver circuit for each of the two front end computers 18a- 18b, such as transmitter 38a and receiver 40a. The transmitter 38a is adapted to convert parallel data words (for example, 16 bits) from the stealth port into a serial bit stream suitable for transmission over one of the fiber optic cables 32. Similarly, the receiver 40a is adapted to convert a serial bit stream from the front end computer 15 18 into a parallel data word for transmission to the stealth port through one or more of the IFS circuit buffers. A corresponding set of transmitters and receivers are also provided in the IFQ circuit 30, such as transmitter 38b and receiver 40b. From the above, it should be appreciated that the use of two sets of transmitter-receiver pairs enables data to be transferred and/or received simultaneously between both of the IFS circuits 28a-28b and both of the IFQ circuits 20 30a-30b. Thus, for example, the IFS circuit 28a is capable of simultaneously transmitting data acquired from the process control computer 12a to both of the front end computers 18a- 18b. While not shown for illustration simplicity, it should appreciated that a laser or LED light source is interposed between each of the transmitters (for example, transmitters 38a- 38b) and their respective optical fibers. Similarly, a photo- detector is also interposed between 25 each of the receivers (for example, receivers 40a- 40b) and their respective optical fibers. For example, these light converters may be comprised of a pair of AT&T ODL200 series converters. While fiber optic cables are preferred for their speed, low error rate and security advantages over mediums such as coaxial cable, it should be understood that that other suitable data transmission medium could be employed in the appropriate application. 30 In the present embodiment, the transmitters and receivers in the IFS and IFQ circuits are preferably comprised of a high-performance Gallium Arsenide chipset, such as the "Gazelle" GA901 1 transmitter and GA9012 receiver from Tnquint Semiconductor, Inc., 2300 Owens St., Santa Clara, CA. These particular transmitters and receivers permit data transmission rates in excess of 200 Mbits second. These transmitters and receivers utilize a 40- 35 bit wide parallel bus which enables data to be encoded into a 50-baud word using FDDI- standard 4B/5B encoding. In this encoding, 4-bιt data nibbles are translated into a 5-baud code symbol. Accordingly, the 4B/5B encoding produces ten 5-baud symbols from ten 4-bιt data nibbles in order to comprise a data frame. The GA901 1 transmitters also convert the serial stream from a Non-Return to Zero " NRZ" format to a Non-Return to Zero, Invert on ones ' NRZI" format, which combines the transmission of data and CIOCK signals into a single waveform The NRZI waveform denotes a logical one with a polarity transition and a logical zero with no transition within the bit-time-frame These logical ones and zeros are called bauds, and each group of five bauds are called a symbol. For example, a "0000" 4-bιt binary input will be converted to a " 1 1 1 10" 5-baud binary symbol output, while a " 101 1 " 4-bιt binary input will be converted to a ' 101 1 1 " 5-baud binary symbol output The use of 4B/5B encoding and NRZI formatting combine to substantially enhance the reliability of high-speed data transmissions over the fiber optic cables The GA9012 receivers have built in clock and data recovery (for example, NRZI to NRZ conversion), and they also monitor the incoming 5B symbols for validity. In this regard, the 4B/5B encoding creates a number of invalid symbols which may be checked for at the GA9012 receivers. As the presence of noise or jitter across the fiber optic link could cause one or more of the bauds to change to an unintended value, the detection of invalid symbols reduces the possibility of a transmission error going undetected As an additional layer of protection from potential errors, data transmissions from the IFS circuit 28 are formed into complete data frames, which are comprised of the data to be transferred (that is, the 40-bιt input data frame), a 16-bιt destination address field, a 4-bιt control code field and a 4-bιt error detection code field. These complete data frames are preferably separated from each other on the fiber optic link by at least one sync frame. As potential physical link errors may have a burst or clustering nature, the error code needs to be able to detect up to four contiguous bit errors. In this regard, a Longitudinal Redundancy Check "LRC" code is employed to prevent masked errors from potentially corrupting subsequent data processing operations. This type of error code is also referred to as a " Longitudinal Parity Check" In a LRC code, a 4-bιt nibble composed of parity bits is generated and inserted into the encoded data stream for a predetermined number of data nibbles in the encoded data stream, as shown below: b4 b3 b2 b1 data nibble 1 X X X x data nibble 2 data nibble 3 data nibble 8 ,' x x x x | data nibble 9 | x x x x j data nibble 10 p4 p3 p2 p1 wnere pi = bι 1 Xor bι2Kor Xor bι9, ano i = bit location 1 to 4 Thus, the ith bit of this parity check character checks the ith information pit position in data niboles 1 through 9 under even p arity conditions The combination of the LRC error checking, the 4B/5B encoding and the NZRI conversion enable the front end communication system 10 to provide a targeted Baud Error Rate "BER" of 1 E- 12 While a Cyclic Redundancy Check "CRC" code could be employed in lieu of the LRC code, the more complicated CRC code would also increase the complexity of the IFQ and IFS circuits Additionally, the LRC coding more readily permits dual fiber optic channel signal transmissions between the IFS and IFQ circuits, and the intrinsic synchronization features of the the Gazelle transmitters 38a-38b and receivers 40a-40b may be used to frame the LRC based protocols The IFQ circuit 30 includes a microprocessor 42 (for example, an Intel 80186 chip) which provides the data pump for the front end computer 18. The microprocessor 42 is not only responsible for all IFQ/IFS protocol control and relaying data from the process control computers 12a- 12b to a destination on the network 20, but it is also responsible for controlling the integrity of write activities to the IFS and IFQ circuits. For example, the microprocessor 42 may be used to program the transfer map 37 in the IFS circuit 28, so that only a particular sub¬ set of data in the dual-ported data memory 22 may be gathered and transmitted to the front end computer 18, if less than all of the available variables (for example, input/output values, alarms and events) is desired. In this way, the actual contents of the transfer map 37 may be dependent upon a specific process control application All signal transmissions between the IFQ circuit 30 and the IFS circuit are under the control of IFQ circuit microprocessor 42. In this regard, there are three types of data transmissions from the IFQ circuit 30 to the IFS circuit 28, namely "load transfer map", "send command messages" and "receive data" The load transfer map transmission will enable the IFQ circuit 30 to load the transfer map 37 of the IFS circuit 28 with the specific variable addresses which will steer the data memory transmit bursts from the IFS circuit The receive data transmission will cause the IFS circuit 28 to return the requested segment of memory from the dual-ported data memory 22 A command message transmission will start with a Wnte-Lock request to the IFS circuit 28 Assuming that incoming buffer is free, the IFS circuit 28 will assert a Wnte-Lock on the mailbox section 26 of the dual-ported data memory 22, and return a positive acknowledgement to the IFQ circuit 30 The IFQ circuit 30 may then transmit its message with the assurance that no other device will be able to write to the mailbox section 26 until its message has been completely stored and preferably read by the process control computer 12. However, a time limit may be imposed on the Write Lock to ensure that the flow of communications is not impeded by one of the external entities connected to the stealth interface circuit 16 It should also be appreciated that message transmissions should not take place during any time in which a data burst should be received from the IFS circuit 28 As another measure of data transmission protection, the IFQ circuit 30 will cause the IFS circuit 28 to read back a message transmitted to and stored in the mailbox section 26 of the dual-ported data memory 22 in order to be sure that the message was transmitted and stored correctly Once the IFQ circuit 30 determines that the message nas been accurately received and stored, then the IFQ circuit will cause a flag to be set which will signal the process control computer 12 to pick up the new message In the event that this data verification fails, then the entire message transmission process will be repeated The IFQ circuit 30 also includes a process data buffer 44, which is shown as block in Figure 1 for illustration simplicity However, the process data buffer 44 should include o sufficient memory capacity to store a separate data table for each of the process control computers 12a-12b (for example, 262,144 bytes). Each of these data tables will include both the SDSS and DSS data transmissions Additionally, a DMA buffer (not shown) may also be provided to allow some elasticity in processing the data being received In this regard, it should be noted that the both the IFS circuit 28 and the IFQ circuit 30 are configured to facilitate bi- 5 directional Direct Memory Access " DMA" transfers between the IFQ circuit 30 and the Q-bus of the front end computer 18 In this way, the central processing unit 45 of the front end computer 18 does not need to devote substantial time to processing data transfers to and from the IFQ circuit 30. Accordingly, the DMA buffer is preferably used as a bucket brigade area to perform DMA transfers on blocks of data from the process data buffer 44 (for example, 8K 0 bytes at a time) to a suitable memory residing on the Q-bus of the front end computer 18 The use of DMA transfers also enhances the ability of the front end communication system 10 to achieve the goal of making available real-time data from the process control computers 12a- 12b to one or more computers on the network 20 More specifically, the front end communication system 10 is designed to request, receive and answer 5 network queries on both pre- nk and post- arbitrated data from each of the process control computers 12a-12b within a one- second time resolution For example, in this particular embodiment, each of the process control computers 12a-12b wιll issue a Sequence Data Stable Strobe "SDDS" signal in every one-second program cycle, which indicates that approximately 1024 (16 bit) words of pre-link dynamic analog/digital input data is stable and available in the 0 dual-ported data memory 22. This specific data set is referred to as pre-link data, as this data has not yet been arbitrated between the process control computers 12a- 12b via data transmissions across the major link 14. Subsequently, in the same one-second program cycle, each of the process control computers 12a-12b will issue a Data Stable Strobe " DDS" signal, which indicates that a complete set of post-arbitrated input and output data is stable and 5 available in the dual-ported data memory 22 This data set is referred to as post-arbitrated, as the input values will have been arbitrated or resolved by this point in the program cycle In the present embodiment, this post- arbitrated data set may be comprised of up to 65,536 (16-bιt) words, as it will include both input and output values (and any other variables stored in the dual- ported data memory 22) It should also pe noted at this point that one of the first functions in the program cycle of the process control computers 12a- 12b is to rrιaκe output value decisions from the post- aroitrated input data obtained in the immediately preceding program cycle. Accordingly, it snould be appreciated that the post- aroitrated data set will include the arbitrated input values from the current program cycle ano the output values from the immediately previous program cycle It is also important to understand that the function of obtaining a copy of the o pre-link and post-arbitrated data sets cannot be permitted to delay the operations of the process control computers 12a- 12b Thus, for example, the front end communication system 10 must be sufficiently fast to ootain a cppy of the ore-link data sets before the process control computers 12a-12b need to have the ability to change one or more of these data values through the arbitration process. Accordingly, in the context of the present embodiment, the 5 front end communication system 10 needs to be able to acquire a pre-link data set within ten milliseconds of the time that the SDSS signal was initially asserted in order to have the assurance of data stability. Similarly, the front end communication system 10 needs to be able to acquire a post-arbitrated data set within fifty milliseconds of the time that the DSS signal was initially asserted. In this regard, it should be appreciated that each of these data sets need 0 to be independently acquired from both of the process control computers 12a- 12b by each of the front end computers 18a-18b. Additionally, each of the front end computers 18a-18b must also be able to send messages to the one or both of the process control computers 12a- 12b during time periods outside of the SDSS and DSS data acquisition windows. In order to further facilitate the ability of the front end communication system to 5 acquire the SDSS and DSS data sets without any data transfer blocknecks, and also provide the ability to group and time align the data sets being received, each of the front end computers 18a- 18b includes a set of at least three reflective buffers for each of the process control computers 12a- 12b. Each of these logically distinct reflective buffers or shadow memories may reside in the same physical memory chip or chip set in the front end computer 18 As shown in 0 Figure 1 , the set of reflective buffers contained in the front end computer 18a is generally comprised of a ZERO buffer "ZL" 46a for the Left process control computer 12a, a ZERO buffer "ZR" 48a for the Right process control computer 12b, a ONE buffer "OL" for the Left process control computer, a ONE buffer "OR" for the Right process control computer, a TWO buffer "TL" for the Left process control computer, and a TWO buffer "TR" for the Right process 5 control computer. Additionally, it should be understood that a corresponding set of reflective buffers are contained in the front end computer 18b, such as the ZERO buffer "ZL" 46b for the Left process control computer 12a and the ZERO buffer "ZR" 48b for the Right process control computer 12b. The IFQ circuit 30 writes to these left and right buffers in a round robin ' fashion using DMA data transfers In other words, the IFQ circuit 30 will fill the ZERO buffer 46a with pre-link and post-arbitrated data of a particular process control cycie from the Left process control computer 12a Then, when pre-link and post-arPitrated data for the next process control cvcle is received from the Left process control computer 12a, the IFQ circuit will increment to the ONE buffer 50a in order to store this data Similarly, the IFQ circuit 30 will turn to the TWO buffer 54a wnen pre-link and post-arbitrated data for the third process control cycle is received from the Left process control computer 12a in order to store this data Then, when pre-link and post-arbitrated data for the forth in time process control cycle from the Left process control computer 12a is to be stored, the IFQ circuit 30 will return to address the ZERO buffer 46a for data storage Of course, it should be appreciated that the IFQ circuit 30 will employ the same round robin sequence for individually transferring pre-link and post- arbitrated data to the three reflective buffers 48a, 52a and 56a that are used for the Right process control computer 12b For purposes of illustration, Figure 1 shows three reflective memory buffers (46a, 50a and 54a) for the Left process control computer 12a, and three reflective memory buffers (48a, 52a and 56a) for the Right process control computer 12b However, as the SDSS and DSS data transfers are treated as independent DMA events, the reflective memory buffers preferably include distinct reflective memory buffers for each of these events Accordingly, a total of twelve reflective memory buffers are preferably provided in the front end computer 18 Additionally, each of these reflective memory buffers are individually tracked, so that the ordering of these buffers do not necessarily have to follow the regimen shown below: Second N: (ZERO-SDSS-L ZERO-DSS-L ZERO-SDDS-R ZERO-DSS-R) Second N + 1 (ONE-SDSS-L ONE-DSS-L ONE-SDDS-R ONE-DSS-R) Second N + 2 (TWO-SDSS-L TWO-DSS-L TWO-SDDS-R TWO-DSS-R) Rather, the ordering of these buffers could also proceed under other regimens, such as shown below: Second N: (ONE-SDSS-L TWO-DSS-L ZERO-SDDS-R ONE-DSS-R) Second N + 1 (TWO-SDSS-L ZERO-DSS-L ONE-SDDS-R TWO-DSS-R) Second N + 2 (ZERO-SDSS-L ONE-DSS-L TWO-SDDS-R ZERO-DSS-R) It is important to understand that the corresponding left and right reflective buffers (for example, buffers 46a and 48a) will generally not become filled at the same time, as the program time line of the process control computer in the dog mode should follow the program time line of the process control computer in the fox mode by a predeterminable period of time (for example, 20-mιcroseconds to 20- milliseconds) However, these time lines may become considerably separated in the event that communications across the major link 14 are not possible, as mentioned above Even when the left and right SDSS or DSS signals are asserted at near the same time, the delays reαuired to transfer this information to the IFQ circuit 30 and then transterthis information into the appropriate reflective memories may r esuit in a wider time skew between these events as seen by the application software of the front end computer 18 than as seen by tne process control computer and IFS circuit hardware Nevertheless, it is the responsibility of the front end computer 18 to ensure that the data sets 5 ultimately made available to the computer network 20 represent data from the process control computers 12a-12b ιn the same program cycle (for example, a one second period) In this regard, the application software of the front end computer 18 includes a procedure, referred to as 'Ml Sync ' , which groups individual data transfer events into a cohesive set of buffers that represent a 'snapshot" of the pre-link and post- arbitrated data for a particular process control ι o c y e The Ml Sync procedure uses a set of reflective memory buffer management structures (Ml RMBMS) to track the status of incoming data transfers When the IFQ circuit driver software signals to the Ml Sync procedure that a DMA transfer has completed, Ml Sync records the required information in the appropriate Ml RMBMS data structure When Ml Sync 15 determines that a complete set of buffers has been received and stored (that is, left SDSS, right SDSS, left DSS and right DSS), it updates a global data structure (MI_RM_DATA) with the pointers to the newly received data These pointers are copied from the Ml RMBMS data structure Accordingly, Ml RM DATA includes the pointers to the currently available "complete" or time aligned set of reflective memory buffers Depending upon where the front 20 end computer 12 is in the round robin procedure, the most current time aligned set of reflective memory buffers may be TWO buffers 54a and 56a at one time interval, the ONE buffers 50a and 52a at the next time interval, and the ZERO buffers 46a and 48a at the ^ __ following time interval In the event that the SDSS or DSS data from one of the process control computers 12a-12b is not received by the IFQ circuit 30, Ml Sync will still maintain time 25 alignment by using an appropriate timeout (for example, 700 milliseconds) for updating the Ml RM DATA pointers An indication will also be provided as to which buffer or buffers are unavailable The buffer pointers within Ml RM DATA are protected by a mutual exclusion semaphore or "mutex" Ml SYNC requests this mutex before copying the new pointers to 30 Ml RM DATA and releases it immediately after the copy is complete When a network entity needs to access reflective memory data, a copy of the Ml RM DATA pointers is made by requesting the mutex, copying these buffer pointers to a local data structure, and then releasing the mutex. Since the application for querying or reading the data uses a copy of the pointer, contention forthe mutex is minimized, and Ml Sync will be able to update 35 Ml RM DATA with new pointers as soon as the next complete set of data has been stored In this regard, it is important to note that this method will enable the reading application to still access the same set of reflective memory buffers while Ml Sync updates Ml RM DATA with new pointers Since reading applications will access the most current time aligned set of reflective memory buffers, it should be understood that a reading application could be accessing one set of reflective memory buffers (for example, the TWO buffers 54a and 56a), while a subsequent reading application could be given access to another set of reflective memory buffers (for example, the ONE buffers 50a and 52a) once Ml Sync updates Ml RM DATA with new pointers It should also be understood that applications which access the reflective memories will be able to run to completion before the referenced buffers are overwritten with new incoming data In one embodiment of the front end communication system 10, applications requiring reflective memory data are assigned execution priorities high enough to allow them to run to completion in less than one second However, it should be appreciated that the front end computer 18 could be configured with additional sets of buffers to allow the development of an application that may take longer to run to completion It should also be appreciated from the above that the use of the front end computers 18a-18b also enables the communication system 10 to have the necessary intelligence to answer specific data requests The use of the front end computers 18a-18b also permit a rapid check to be made that the process control computers 12a-12b are in fact continuing to send real-time data Additionally, the front end computers 18a- 18b are also preferably programmed to make determinations as to whether read or write requests from the process control computers 12a-12b should be granted with respect to the entity on the computer network 20 which has forwarded the request. As will be discussed more fully below the front end computers 18a-18b contain both a security table and two permissive tables in their memories for facilitating these determinations The security table is used determine wnether communications will be permitted at all with various entities on the computer network 20, while the permissive tables are used to evaluate write command messages from an entity on the computer network which could affect specific locations in the dual-ported data memories 22a-22b The front end computers 18a-18b may also utilize at least one set of additional reflective buffers, such as Correlate buffers 58a and 60a. In light of the fact that the DSS data set will contain the post-arbitrated input value data from the current program cycle and the output value data that was based upon the post-arbitrated input values of the immediately preceding program cycle, it may be desirable to correlate into one data table the output values for a particular program cycle with the input values used to decide these output values. Accordingly, the front end computer 18a may employ the Correlate buffers 58a and 60a to store a copy of the post-arbitrated input values from the current DSS data set, and then wait for the alignment of the next DSS data set in order to store a copy of the output values from this subsequent data set in the same Correlate buffers In this regard, it should be appreciated that this copying procedure will be made from the most current time aligned set of reflective memory buffers. Thus, for example, Figure 2A shows a diagrammatic example of a data table in a time aligned buffer wnile Figure 2B shows a similar example of a data table in the Correlate buffer CL In anv event it should be understood that the time alignment capabilities of the front end computers 18a- 18b provide a powerful diagnostic tool τor analyzing both the operation of the process control computers 12a-12b ano the physical process being controlled For example, the arbitration performed with respect to the input αata values may pe analyzed for both of the prpcess control computers 12a- 12b, as pre-link ano post-arbitrated input data values are time aligned and made available by the front end computers 18a- 18b The computer network 20 is shown in Figure 1 to generally include a direct control segment, a process information segment and a connection to a Wide Area Network 'WAN" Each of these network segments preferably employ Ethernet compliant mediums and IEEE 802 3 compatible communication protocols The direct control segment is comprised of dual Plant Area Networks 'PAN-1 " and "PAN-2", while the process information segment is comprised of Plant Area Network "PAN-3" At least one bridge 62 is used to interconnect the PAN-1 and PAN-2 segments Additionally, at least one bridge 64 is used to interconnect the PAN-2 segment with the PAN-3 segment Another bridge may be used to interconnect the PAN-1 segment with the PAN-3 segment One or more orιdges 66 may also be used to i nterconnect the PAN-3 segment with the WAN It should be noted that the front end computer 18a is coupled to the PAN-1 segment, while front end computer 18b is coupled to the PAN-2 segment While a single plant area network could be provided, the use of dual plant area networks shown nerein have certain communication and redundancy advantages over a single plant area network In this regard, the bridges will typically filter communications by Ethernet hardware addresses to reduce the amount of traffic on each of the network segments For example, a communication between the security server 68 and the operator station 70 will not be transmitted across the bridge 62 to the PAN-1 segment The bridges 62-66 also provide a layer of physical separation between the network segments, so that if a fault occurs on one of the network segments, then the fault will be prevented from adversely affecting the other network segments Additionally, one or more of the bridges are also used to filter communications on the basis of specific data communication protocol identifications to enhance the overall security of the network 20 For example, the bridge 64 may be used to prevent the transmission of messages employing the Ethernet compliant protocol used by the security server 68 from one of the PAN- 2 and PAN-3 segments to the other Similarly, the bridge 64 may be used to prevent the transmission of messages employing the Ethernet compliant protocol used to write information into the mailbox section 26 of the dual-ported data memory The computer network 20 also includes a plurality of operator workstations, such as operator workstations 70 and 72 As shown in Figure 1 , these operator workstations may be located on different network segments, and the number of operator workstations will be dependent upon the particular process control application One or more of these operator Λ orkstations may be used to view or analyze data received from tne front end computers 18a- 18b Additionally, these operator workstations may be used by an authorized control room operator to transmit the appropriate instructions to the front end computers 18a- 18b which will cause a command message to be conveyed to the process control computers 12a-12b 5 The network 20 further includes a process information computer 74 which may perform a variety of functions For example, the process information computer may oe used to store a history of process data received from the front end computers 12a- 12b Additionally, the process information computer 74 may be used to store the compilers neeoed to change the computer programs residing in the front end computers 18a-18b, as well as the programs 10 residing in the process control computers 12a- 12b The process information computer 74 may also include loading assistant software for transferring operating program revisions to the process control computers 12a-12b The network also includes a control room data manager computer 76, which may be used to perform various file serving and tracking functions among the computers connected to the network 15 An expert download assistant 78 is also provided to facilitate program revisions in the front end computers 18a-18b In contrast, the loading assistant software in the process information computer 74 may be used to cause a new computer program to be downloaded to one of the process control computers 12a- 12b through at least one of the front end computers 18a- 18b and the mailbox section 26 of the dual-ported data memory 22 While the download 20 assistant 78 may be resident in its own network computer, the download assistant could also reside in a suitable network computer, such as the process information system computer 74 The loading assistant may also be used to cause the process control computer with the revised program to start operating in a mode which will enable real-time testing of the revised program In this mode of operation, the process control computer will receive input 25 data and make output decisions, but these output decisions will not be transmitted to the field instrumentation devices This will permit the plant engineer to evaluate the revisions, and even make further revisions if necessary before instructing the process control computer to assume an active mode of operation, such as the fox or dog modes Whenever it is decided that the manner in which the process control computers 30 12a-12b perform their particular manufacturing control operations should be changed through a program revision, the revised program for the process control computers 12a- 12b must be compiled from the the source programming language to an executable file or set of dynamically linked files In the preferred embodiment, a unique identifier is emoedded into the executable code during the compile procedure This identifier represents (or is otherwise 35 associated with) the version of the revised software for the process control computers 12a-12b Tne program version identifier is used to ensure proper alignment between the version of the program being executed by the process control computers 12a- 12b and the files/tables in the front end computers 18a- 18b used to evaluate write command messages to these process control computers As mentioned above, each of the front end computers 18a- 18b include two permissive ta les, such as the " PL" permissi e table 80a for the Left process control computer 12a, and the "PR" permissive table 82a for the Right process control computer 12b These permissive tables are used by the front end computers 18a- 18b to determine whether any entity on the computer network 20 should be permitted to change the contents of specific locations in the dual- ported data memories 22a-22b However, it should be appreciated that the data structure of the permissive table could be constructed to protect the contents of any memory location or area in the process control computers 12a- 12b which could altered from a write command message When a message is received by a front end computer 18 from an entity on the network which uses the write command protocol, such as a write command message from one of the operator workstations 70-72, a "data write check" sub- routine will be called by the central process unit of front end computer The data write check routine will perform a comparison between the variable elements identified in the write command message and the variable elements in the permissive table for which changes should be authorized or denied. For example, if the front end computer 18a receives a write command message which seeks to increase/decrease an analog gain "AG" factor used by the program being executed by the Left process control computer 12a, the front end computer 18a will look up the element word for this particular AG factor in permissive table 80a and determine if a bit has been set to deny the authorization needed to change this factor If authorization is denied, then the front end computer 18a will not transmit the write command message to the process control computer 12a. Instead, the front end computer 18a will preferably send a reply message to the host entity on the computer network 20 that originally sent the write command message, to inform the host entity that a write error has occurred From the above, it should be appreciated that the PL and PR permissive tables stored in the front end computers 18a- 18b need to be closely coordinated with the version of the program being executed by each of the process control computers 12a- 12b. In order to ensure that each of these permissive tables are sufficiently matched with the programs being executed by their respective process control computers 12a-12b, the program version identifier discussed above is also embedded into these permissive tables when they are compiled. This program version identifier may then be sent to the process control computer 12 along with a verified write command message, so that the process control computer 12 will be able to confirm that the commanded variable change is appropriate to its program version To enhance the security of this verification process, the program version identifier from the permissive table is preferably altered by a suitable encryption algorithm before it is transmitted with the write command message to the mailbox section 26 of the stealth interface orcuit 16 for the intended process control computer 12 The process control computer 12 receiving the write command message will then decode this version identifier, ana compare it with the program version identifier embedded in its program to determine if their is a match If the program version identifiers match, then the process control computer 12 will oerfprm the commanded variable change Otherwise, the process control computer 12 will resppnd by discarding the write command message and transmitting an appropriate error message to the front end computer 18 The PL and PR permissive tables are also preferably provided with a data structure whicn permits write command authorization determinations to be made for specific host o entities on the computer network 20 In other words, the permissive table 80a may permit particular variable changes to be made from operator workstation 70 that are not allowed to oe made from operator workstation 72 Thus, the permissive tables may have several station specific table sections, as well as a default table section Nevertheless, the ability may also be provided to bypass a check of the appropriate permissive table, through the use of a suitable 5 password at a host entity on the computer network 20 However, in this event, a log should be created and stored in the front end computer 18 which will identify this transaction and the identity of the host entity (for example, a CPU identifier) It should be noted that the use of separate permissive tables for the process control computers 12a- 12b has the ad vantage of enabling a program downloading operation 0 to be performed on one of the process control computers while the other process control computer continues to actively control a manufacturing process Indeed, even after a revised program has been successfully transferred to the process control computer 12a (and the corresponding permissive table 80a loaded in front end computer 18a), the use of separate permissive tables will enable the front end computer 18a to evaluate a write command 5 message intended for the process control computers 12a which is distinct from a write command message intended for the process control computer 12b While it may not be advisable in some circumstances to run the process control computers 12a-12b with different program versions in an active control mode, a passive operating mode may be used forthe process control computer with the revised program while the other process control computer is 0 in an active control mode In such an event, the plant engineer may use the download assistant 78 during final program testing to issue write command messages for the passive process control computer, while another plant engineer issues write command messages to the active process control computer through the same front end computer 18 The security server 68 is used to inform each of the computers residing on the 5 network 20 who they may communicate with on the network In this regard, the security server stores a specific security table for each of the valid entities on the network Each of these security tables will identify which of the network computer entities a particular network computer may conduct bi- directional communications For example, in the case of the front end computers 18a- 18b. one of the first functions on start up will be to obtain their respective security tables from the security server 68 Accordingly, the security server 68 is shown in Figure 1 to store a security table 'S 1 " f or the front end computer 18a, and a security table "S2" for the front end computer 18b While the security server could also be used to send the PL and PR permissive tables discussed above to the front end computers 18, it is preferred that newly compiled permissive tables be received from the download assistant 78. In this regard, it should oe noted that the download assistant is also preferably used to send the transfer map 37 intended for the IFS circuit 28 to the front end computer 18 along with the appropriate permissive table In order to assure the integrity of security table transfers from the security server 68 to the front end computers 18a- 18b, a method of validating these transfers is utilized in the present embodiment. In accordance with this method, the front end computer 18 will embed a random or pseudo-random numpeπn a broadcast network message to request that the security server 68 identify itself as a prelude to sending the appropriate security table. The security server will respond to tnis request with an acknowledgement message that utilizes a security protocol identifier wnich is different than that used with other types of network messages Importantly, this acknowledgement message will include the random number from the front end computer 18 in a transformed state. In this regard, a suitable encryption algorithm may be used to alter the random number, and the random number should have a bit length which will make it difficult for any unauthorized entity to decode (for example, 32 bits). Upon receipt of the acknowledgement message, the front end computer 18 will then either reverse the encryption process to obtain the random number or encrypt its original random number to make a comparison between the transmitted and received random numbers Assuming that these random numbers match, then the front end computer 18 will determine that the acknowledgement message has been received from a valid security server, and the transfer process will proceed In order to further enhance the security of communications between the front end computers 18a- 18b and other entities on the computer network 20, an additional validation procedure is preferably implemented More specifically, this additional validation procedure is utilized to permit communication between the front end computers 18a-18b and any network entity for which a write command message may be recognized. In accordance with this validation method, the front end computer 18 will send a contract offer message on a periodic basis to the Ethernet address of each host entities on the network 20 which it recognizes as having a write message capability. Each of these contract offer messages will include a random or pseudo-random number or other suitably unpredicable message component. In order for a host entity to able to nave its write command messages recognized, it must respond to its contract offer message within a predetermined period of time (for example, 10 seconds) with a contract acceptance message that includes a transformed version of this unoredicable message component While any appropriate encryption algorithm e jsed for this purpose, it is preferred that this encryption algorithm oe different than the encryption algorithm used to validate the transfer of a security table from the security server 68 Additionally, it should be noted that the security message protocol may be used for these contract offer and acceptable messages The front end computer 18 will then decrypt the random number embedded in the contract acceptance message to determine if a time limited communication contract will be established between the front end computer and this host entity at the specific Ethernet address forthe host entity that was contained in the security table This time limited communication contract will ensure that a write command message link between a front end computer 18 and a particular host entity will be reliable and specific Thus, for example, the front end computer 18a will send a contract offer message to the Ethernet address of the operator workstation 72 which will contain a new random number (for example, 32 bits in length). The operator workstation 72 will respond with a contract acceptance message that includes an encrypted version of this particular random number Then, the front end computer 18a will either decrypt this number with the contract algorithm key stored in its memory for this purpose or use the same encryption algorithm to compare the offer and acceptance numbers If these numbers match, then the front end computer 18a will be process write command messages from the operator workstation 72 for a predetermined period of time. Otherwise, if the numbers do not match, then the front end computer 18a will disable a write command authorization bit for the Ethernet address of the operator workstation 72 from its security table S1 to indicate that write command messages from this operator workstation should be ignored. The communication contract established for write command messages is time limited to enhance the transmission security of these particular messages In the preferred embodiment, the communication contract will automatically expire within twenty seconds after being initiated. Nevertheless, in order to ensure that the ability to send write command messages is not interrupted, the contract offer messages should be sent from the front end computer 18 to each of the appropriate host entities on the network 20 on a periodic basis which will provide this continuity. For example, with a communication contract of twenty seconds, it is preferred that the contract offers be transmitted at a rate of approximately every ten seconds. In other words, every ten seconds, each of the host entities that are capable of transmitting recognizable write command messages will receive a new random number from each of the front end computers 18. In the event that a host entity fails to respond to a contract offer message from a front end computer 18, the front end computer will preferably make three tries to establish or maintain a time limited communication contract. If no response is received from these three tries, then the the front end computer 18 will disable the write command authorization bit for the Ethernet address of this host entity from its security table. In sucn an event, the affected nost entity will not be able to have its write command messages processed by the front end computer 18 until the security server 68 transmits a new security table to the front end computer 18 5 It should be appreciated from the aoove that only the random numbers need to be encrypted tP facilitate a transfer of the security taole or to establish the time limited communication contract for write command messages. However, it should be understood that the security table itself or the write command messages could be encrypted as well in the appropriate application Nevertheless, the use of different Ethernet protocols for security 1 o messages and write command messages, the use of different encryption algorithms for security table transfers and write command communication contracts, the limitation of the time of the write command communication contracts to short durations, and the use of specific permissive tables for each of the front end computers 18, all combine to provide a very high degree of communication and write command security forthe process control computers I2a-12b. 15 Additional protection is also substantially provided by the guardian circuit in the stealth interface circuit 16, the embedding of a program version identifier in the PL and PR permissive tables, and the encryption of the these program version identifiers by the front end computers 18a- 18b when a verified write command message is transmitted to the process control computer 12a- 12b In this regard, it should be noted that the encryption algorithm used by the 20 front end computers 18a- 18b for the program version identifiers is preferably different than the encryption algorithm used for security table transfers or the encryption algorithm used to establish the time limited communication contracts for write command messages. A further discussion of these security and verification features may be found in the de Bruijn et. al. patent application, serial no. , filed on even date herewith, and entitled "Secure 25 Front End Communication System and Method" This patent application is hereby incorporated by reference. Referring to Figure 3, a block diagram of the application software 300 forthe front end computer 18 is shown. In this regard, Figure 3 shows the interaction of the application software with the Q-bus 302 of the front end computer 18 and with the Ethernet 30 services 304 forthe computer network 20. Thus, for example, a bi-directional line is provided between the Q-bus 302 and the IFQ driver 308. The IFQ driver 308 represents the device driver software for controlling the communicating with the CPU of the front end computer 18. The I FQ driver 308 is coupled to the " M I Sync" subsystem 310 through a datastore event 312. In this regard, the Ml Sync subsystem receives notification of DMA completions from the IFQ driver 35 308, such as when the SDSS data from one of the process control computers 12a-12b has been completely received in the appropriate Interim buffer (for example, Interim buffer 46a or 48b) The reflective memories 46a-56a from Figure 1 are shown in Figure 3 as reflective memories 314 Figure 3 also illustrates that the reflective memories 314 are operatively coupled to the Q- bus 302 of the front end computer 18. The Ml Sync subsystem 310 represents that portion of the application software 300 whicn is responsible for synchronizing the incoming SDSS and DSS data frames from each of the process control computers 12a- 12b through the operation of the reflective memories 314, as discussed above. The Ml Sync subsystem aiso notifies the "Ml MOD Health" module 316 and " System Messages" module 318 when a data frame is available for processing Additionally, the Ml Sync subsystem 310 is also used to detect whether or not reflective memory updates are not occurring, such as when one of the process control computers has stopped sending data to the front end computer 18 This procedure is implemented through the "MOD Status" module 320 and the "Ml Watchdog" module 322 The Ml Watchdog module 322 uses a two-second timer to detect if the front end computer 18 has stopped receiving data from either of the process control computers 12a-12b. The Ml MOD Health module 316 processes health bit changes in the data being received by the front end computer 18 from the process control computers 12a- 12b. In this regard, the Ml MOD Health module 316 sends these changes to the " EVT Event Handler" module 324. Similarly, the Ml System Messages module 318 processes incoming system messages from the process control computers, and it queues any requests to the EVT Event Handler module 324. The EVT Event Handler module 324 processes event buffers, formats text for output to the Print Services module 326, and records errors and other events in an event log. The reflective memories 314 are coupled to the "Ml CISS Memory Read" module 328, which performs read operations on the reflective memories In this regard, the Ml CISS Memory Read module 328 formats query responses into the standard Ethernet protocol for transferring data/messages, and directs the response to the requesting network entity via port 330. The " Nl CISS" module 332 receives incoming query requests from a network entity using the standard protocol for transferring data/messages. The Nl CISS module 332 performs an initial security check on the message, and routes the request to the appropriate process as determined by the message type. For example, the Nl CISS module 332 wiil route a read data message to the Ml CISS Memory Read module 328. Additionally, the Nl CISS module 332 will route program download requests to the "Ml Download Handler" module 334. Other request messages will be routed to the "Ml Message Services" module 334. The application software 300 also includes modules which facilitate communication with a User Interface. In this regard, the User Interface is used to provide a window into the operation of the front end computer 18, as opposed to an interface to one of the process control computers 12a- 12b. The User Interface software may be accessed "locally" through a terminal connected directly to the front end computer 18. The User Interface software may also be accessed "remotely" through an application that could be run from the security server 68. The User Interface is used to disable or re-enaole network communications •' or a specific protocol, perform diagnostic functions, re-boot the τ' ront end computer 18, monitor reflective memory updates, monitor network activity, ana otherwise manage access to Dπviiegeα front enα computer functions. 5 The application software modules that handle User Interface requests are the " Nl Remote User" module 338, the ' Ul Local " module 340 and the " Ul Services" module 342. The Nl Remote User moαule 338 receives all messages having the protocol for User Interface communications, and it forwards valid reαuests to the Ul Services moαule 342. The Ul Services module 342 provides a data server for both local and remote user requests. The Ul Local 1 o module 340 handles the local User Interface display screens in oroer to display responses on the local terminal. The application software 300 also includes an " Nl Transmit Done" module 344, which receives notification of Ethernet-write completions and maintains a free queue of network interface transmit message buffers. Additionally, an " EVT File Maint" module 346 is 15 used to delete aged event log files. Furthermore, an " Nl Watchdog" module 348 and an " Nl SCSP" module 350 to implement the watchdog security process discussed above. In this regard, the Nl Watchdog module 348 sends watchdog request messages to the operator stations, and the Nl SCSP module 350 processes the reply messages (as well as ail other network messages using the security protocol) The Nl Watchdog module 348 also checks to see if reply messages 20 were received to each of the watchdog request messages. Other than watchdog reply messages, the Nl SCSP module 350 forwards all other security protocol messages to the "CFG Config Manager" module 352. The CFG Config Manager module 352 processes the security requests ano performs the initial loading of the permissive tables 80a-82a. The CFG Config Manager module 352 also performs the loading of a 25 memory map to be discussed below in connection with Figure 4 The application software 300 also includes a "MIF Master Process" module 354, which performs the basic initialization routines to create all of the other front end computer processes. The MIF Master Process module 354 is also used to detect an unexpected termination of any of these processes. Referring to Figure 4, a diagrammatic illustration of the configuration forthe 30 front end computer 18a is shown. Specifically, Figure 4 illustrates that the CFG Config Manager module 352 interacts with the security server 68 and the download assistant 78 to obtain the information necessary to configure the front end computer 18a on boot up In this regard, the CFG Config Manager module 352 is responsive to requests from the MIF Master Process module 354 to perform these configuration activities. In other words, the CFG Config Manager module 35 352 will locate the security server 68 through the broadcast network message (as described above) and load the security table S1 which is ultimately received from the security server. Additionally, the CFG Config Manager module 352 will also load both of the permissive tables 80a-82a from the download assistant 78 The CFG Config Manager module 352 also receives a memory map for each of the process control computers 12a- 12b sucn as tne memory map 356 snown in Figure 4 The memory maps are used to enable the front eno computer 18a to build tne transTer tables (for example, transfer table 37) and interpret the data received in each of tne reflective memory buffers 314 In other words, each of the memory maps identify the data which is stored in each addressable location of the dual-ported data memory 22 for each of the process control computers 12a-12b As part of this process, the memory map divides the dual- ported data memory 22 of the process control computer 12 into logical segments The first set of segments are used for SDSS data values, while the DSS data values include the SDSS memory segments, as well as additional segments As discussed above, the Ml Sync subsystem 310 is responsible for grouping the DMA completion events relative to the transfer of SDSS and DSS data for both process control computers 12a-12b into a cohesive pair of data tables that represent data for a given process control cycle snap-shot For purposes of this discussion these DMA completion events will be referred to as the Left SDSS buffer, the Right SDSS buffer, the Left DSS buffer and the Right DSS buffer The exact order in which these data buffers are received may vary, but the SDSS buffers will precede the DSS buffers The Ml Sync subsystem 310 is responsive to the above identified DMA events In this regard, the Ml Sync subsystem 310 will wait for the completion of a DMA event, and then check the status to determine the type of buffer received If the buffer received is an SDSS buffer and the front end computer 18 has already received a corresponding DSS buffer, then final completion processing will be performed Likewise, if the buffer for this type has already been received, final completion processing will be performed If the buffer received is not the first buffer, then the Ml Sync subsystem 310 will check the time difference between the current time and the time at which the first buffer was received If this difference exceeds a predetermined tolerance, such as 0 7 seconds, then the steps for final completion processing will be performed If this is the first buffer (for example, the Left SDSS buffer), then the time that this buffer was received will be recorded If this buffer was not expected at this point, then its status will be changed to expected The pointer to this buffer will also be recorded, and the buffer will be marked as received The Ml Sync subsystem 310 will also check to see if all expected buffers have been received (for example, the Left/Right SDSS and Left/Right DSS buffers) If all the expected buffers have been received, then final completion processing will be performed During final completion processing, the buffer pointers for the received buffers will be copied to a system data structure which will allow other applications to access this data This procedure is protected by a mutual exclusion semaphore, which is referred to as the " mutex" Additionally, tne error counters will be zeroed for all received buffers If any expected buffers were not received, the associated error counters will be incremented If the error counters exceed the allowed threshold, then the affected buffers will be marked as not expected Then all buffers will be marκeo as not received in oroer to set up the processing for the next set of buffers Applications that access the memory buffers received may then cooythe buffer pointers out of the shared system data structure for use. Iπ order to more fully illustrate the operation of the Ml Sync subsystem 310, a module synopsis and the pseudo-code for this software will be presented below Additionally, the data structures for the reflective memory buffers 314 will also oe set forth as well to assist the interpretation of the oseudo-code The data structures are contained in Tables 1-3, the module synopsis is cpntained in Table 4, and the pseudo-code follows immediately thereafter. RM_ MUTEX Mutex Mutex used to protect this data structure RM_ STATUS Word Indicates current reflective memory status LEFT_SDSS_PTR Pointer Pointer to current left SDSS reflective memory buffer RIGHT_SDSS_PTR Pointer Pointer to current right SDSS reflective memory buffer LEFT_DSS_PTR Pointer Pointer to current left DSS reflective memory buffer RIGHT_DSS_PTR Pointer Pointer to current right DSS reflective memory buffer FOX_DSS_PTR Pointer Pointer to current fox DSS reflective memory buffer DOG_DSS_PTR Pointer Pointer to current dog DSS reflective memory buffer FOX MAP PTR Pointer Pointer to current memory map (left or right) for the current fox buffer DOG MAP PTR Pointer Pointer to current memory map (left or right) forthe current dog buffer FOX_SIDE Longword Indicates the channel that is the fox. 0 = left,1 = right, -1 = undefined. DOG SIDE Longword Indicates the channel that is the dog. 0 = left, 1 = right, -1 = undefined. LEFT INFO BYTE Byte Info byte for outbound CISS requests satisfied from the left buffer Includes fox/dog status RIGHT_INFO_BYTE Byte Info byte for outbound CISS requests satisfied from the right buffer Includes fox/dog status. FOX INFO BYTE Byte Info byte for outbound CISS requests satisfied from the fox buffer. Includes left/right status. DOG_INFO_ BYTE Byte Info byte for outbound CISS requests satisfied from the dog buffer. Includes left/right status. TABLE 2 Reflective Memory Data Structures Data Item Data Format Description Data Structure Ml RMBMSf4l - Structure Array NOTE: The Reflective Memory Buffer Management Structure (Ml RMBMS) array consists of four MI_RMB STATUS_TYPE (define below data structures) Each RMBMS entry is used to keep track of a specific reflective memory type (left/right SDSS and DSS) Symbolic indices are defined to access this array: Ml RM L SDSS, Ml RM R SDSS, Ml RM L DSS, and Ml RM D DSS. LAST RECEIVED Time Specifies the time of receipt of the last buffer for this type. DMA EVENT Object Contains the VAXELN object ID for the event signaled Variable by IFQ Driver when a DMA completion for this type of memory buffer completes. ENABLE EVENT Object Contains the VAXELN object ID for the event signaled Variable by calling MI_ENABLE_STROBES to tell Ml Sync that strobes have been enabled DISABLE EVENT Object Contains the VAXELN object ID for the event signaled Varaible by IFQ Driver when a DMA completions for this type of memory by calling MI_DISABLE_STROBES to tell Ml Sync that strobes have been disabled. PEND BUFF PTR Pointer Contains a pointer to the DMA buffer received for this memory type in the current time window Reset to nul by Ml Sync upon copying pointers to Ml RM DATA RMB STS Longword Longword bit masks indicating the status of this reflective memory buffer The individual bit fields are listed below RMB_STS_V Bit Bιt ιn RMB_STS that EXPECTED indicated that the associated strobe for this reflective memory type is enabled, thus indicating that DMA completions are expected. RMB_STS_V_ Bit Bιt ιπ RMB_STS used by Ml RECEIVED Sync to indicate that a DMA completion for this reflective memory type has occurred in the current DMA time window. Cleared whenever a complete set of buffers has been received, and then set for each individual buffer type as it is received RMB_STS_V_ Bit Ml Sync to indicate that a DSS_BUFF DMA completion forthis reflective memory type has occurred in the current DMA time window. Cleared whenever a complete set of buffers has been received, and then set for each individual buffertype as it is received. Indicates if the reflective buffer type in question is either for the left or right DSS reflective memory buffer. RMB_STS_V Bit Indicates if the associated ENABLED strobe is enabled. CONS ERR COUNT Longword Specifies the number of consecutive receive failures for this buffer type. DMA ERR COUNT Longword Specifies the numper of consecutive DMA completion failures for this buffer type. ADSB Structure Specifies the Asynchronous Data Status Block used by the drive to indicated DMA completion status. This structure is of the IFQ$_ADSB type and includes a status field and a buffer number field. 3UFFER PTR Pointer The BUFFER PTR array the addresses of up to eight Array[8] DMA buffers used for this reflective memory type, in the order the buffers where specified in the IFQ$_ENABLE_DSS or SDSS call. This array is subscripted by the buffer number field returned in the ADSB to retrieve the base address of the DMA buffer j ust received. This dimension of this array allows for the maximum number of DMA buffers supported by the IFQ driver. BUFF HIST IDX Longword Index to the BUFF HIST_PTR array. Indicates the most recently updates buffer. BUFF HIST PTR Pointer Circular buffer of most recently received buffers. DMA Array[8] Indicates the buffers received in the last eight seconds. BUFF HIST IDX points to the most recent entry. MOD TASK Longword Indicates the PCC task state as indicated bythe most recent reflective memory update. Valid only if RMB STS V DSS BUFF is set. LAST DSS L PTR Pointer Pointer to most recent left DSS buffer. Set by Ml Sync and used by Ml Health Check and Ml System Messages. LAST DSS R PTR Pointer Pointer to most recent right DSS buffer. Set by Ml Sync and used by Ml Health Check and Ml System Messages. WD FLAG Longword Flag used by Ml Sync and Ml Watchdog to check for Ml Sync activity. DMA_BUFFER Longword Specifies the number of DMA buffers currently in use. COUNT Copied from MIF_MP.NUM_DMA_BUFFERS on startup. TIME CHANGE Event Set when a time change occurs. Tells Ml Sync tore- Object determine the time of the first DMA receipt. SYSMSG L SEMA Semaphore Set by Ml Sync to trigger Ml System Messages to Object process left reflective memory. SYSMGR R SEMA Semaphore Set by Ml Sync to trigger Ml System Messages to Object process right reflective memory. HEALTH L SEMA Semaphore Set by Ml Sync to trigger Ml Health Check to process Object process left reflective memory. HEALTH R SEMA Semaphore Set by Ml Sync to trigger Ml Health Check to process Object right reflective memory. TABLE 4: Reflective Memory Data Structures Data Item Data Format Description Module Synopsis for Ml SYNC MAIN ABSTRACT Synchronizes receipt of in-incoming DMA buffers MODULE TYPE Process mainline EVENTS/ MI_RMBMS(*). The four (left/right DSS/SDSS) completion SEMAPHORES EVENT events signaled by the IFQ DMA Driver process on receipt of a new reflective memory buffer. Indices to the MI_RMBMS array are MI_RM_L_DSS, MI_RM_R_DSS, MI_RM_L_SDSS and Ml RM R SDSS. MI_RMBMS(*). The four (left right DSS/SDSS) DMA enable ENABLE events. These are signaled by Ml ENABLE EVENT STROBES to notify Ml Sync of changes in the receipt of SDSS and DSS DMA updates. MI_RMBMS(*). The four (left/right DSS/SDSS) DMA disable events. DISABLE_ These are signaled by MI_DISABLE_STROBES EVENT to notify Ml Sync of changes in the receipt of SDSS and DSS DMA updates. MI_RM_AUX Signaled to tell Ml MOD Health to process left HEALTH__L_ health bits. SEMA MI_RM_AUX Signaled to tell Ml MOD Health to process HEALTH_R_ right health bits. SEMA MI_TM_AUX Signaled to tell Ml System Messages to process SYSMSG_L_ left system messages. SEMA MI_TM_AUX Signaled to tell Ml MOD Health to process SYSMSG_R_ right system messages. SEMA OTHER INPUTS MI_RMBMS(*). Asyncronous Data Status Blocks for each of the ADSB four DMA completion events. DSS data buffer Accessed at offset MI_TASK_STATE_L or MI_TASK_STATE_R to determine FOX/DOG status. OTHER OUTPUTS Ml RM DATA Structure containing current reflective memory pointers. MI_RM_AUX. Set to 1 to indicate receipt of data. WD FLAG CALLED KERSWAIT_ANY ROUTINES KERSCLEAR_EVENT KERSLOCK_MUTEX KERSUNLOCK_MUTEX CONDITION MIF_NORMAL CODES MIF_IFQ_ERROR MIF APP ERROR MI_SYNC_MAIN Pseudo-code PROGRAM MI_SYNC_MAIN waiting for first DMA = true REPEAT /* Issue the wait any for the four DMA completion events, the an enable or disable of strobes, or time changes: */ CALL KER$WAIT_ANY with MI_RMBMS[0].DMA_EVENT, MI_RMBMS[1].DMA_EVENT, MI_RMBMS[2].DMA_EVENT, MI_RMBSM[3].DMA_EVENT, MI_RMBSM[0].ENABLE_EVENT, MI_RMBMS[1 ].ENABLE_EVENT, MI_RMBMS[2].ENABLE_EVENT, MI_RMBMS[3].ENABLE_EVENT, MI_RMBMS[0].DISENABLE_EVENT, MI_RMBMS[1 ].DISENABLE_EVENT,MI_RMBMS[2] .DISENABLE_EVENT,MI_RMBMS[3].DISENABLE_E VENT, MI_RM_AUX.TIME_CHANGE, and wait result RMBMS_ιdx = (waιt_result - 1 ) MOD 4 case idx = wait result DIV 4 [0] Call DMA_Completιon [1 ] Call DMA_Enable [2] Call DMA_Dιsable [3] Call Tιme_Change ENDCASE REPEAT for i = 0 to 3 still waiting = MI-RMBMS(ι) RMB_STS_V_EXPECTED is set and RMB_STS_V_RECEIVED is clear UNTIL (still waiting or final iteration) IF " stιll_waιtιng THEN We have a complete set of buffers; Check MOD TASK values for valid combination CALL update_poιnter (MIF_NORMAL) waiting for first DMA = true ENDIF UNTIL MIF shutdown required EXIT SUBROUTINE DMA_Completιon CALL KER$CLEAR_EVENT MI_RMBMS[RMBMS_ιdx] DMA_EVENT MI_RM_AUX.WD_FLAG = 1 current time = Current system time IF waiting for first DMA first dma time = current time waiting for first DMA = false ELSE If current time - first dma tιme >MI Syπc TOLERANCE Log Error "Out of sync-- Did not receive required DMA" Check for excessive failures: FOR i = 0 to 3 IF MI-RMBMS[i].RMS_STS__V_EXPECTED is set and RMB_STS_V_RECEIVED is clear MI_RMBMS[i].PEND_BUFF_PTR = null Log Error " Failed to receive DMA for [DMA type]" MI_RMBMS[i].RMB_CONS_ERRORS = RMB_CONS_ERRORS + 1 IF MI_RMBMS[i].RMB_CONS_ERRORS > tolerance then Log Error " No longer expecting [DMA type]-- too many consecutive failures" (broadcast error message) Clear MI_RMBMS[i].RMB_STS.V_EXPECTED END IF ENDIF ENDFOR Update pointers with available data: CALL update_poιnters (MIF_NO_SYNC) first dma time = current time /* Fall through to use this buffer as the first buffer in the next set... */ ENDIF ENDIF If buffer type is SDSS and DSS and corresponding DSS received, then CALL update pointers ENDIF WITH Ml RMBMS(RMBMS idx) If *.RMB_STS_V_RECEIVED is set Log Error ("Out of Sync- DMA collision") CALL update_poιnters (MIF_DMA_COLL) first dma time = current time /* Fall through to use this buffer as the first ENDIF IF *.RMB_STS_V_EXPECTED is not set Log Error (" Unexpected DMA completion") ENDIF If *.RMB_STS_V_DISABLED is set Log Error ("Received complete for disabled strobe") Return ENDIF Check DMA completion status in ADSB IF error *.CONS_ERR_COUNT = *.CONS_ERR_COUNT + 1 IF *.CONS_ERR_COU NT < 5 Then Log Error ("DMA failure on channel") ELSE IF *.CONS_ERR_COUNT MOD 300 = 1 Log Error ("DMA still failing") ENDIF ENDIF ELSE *.CONS_ERR_COUNT = 0 ENDIF rm_buffer_ptr = *.BUFFER_PTR[*.ADSB.buffer_number - 1] *.RECEIVED_DATE_TIME = current_time *.PEND_BUFF_PTR = rm_buffer_ptr *.RMB_STS_V_EXPECTED = true Set *. RMB STS V RECEIVED IF *.RMB_STS__V_DSS_BUFF is set get mod state using rm buffer ptr offset by *.RM TASK OFFSET * .MOD_TASK = mod_state IF RMBMS-IDX = MI_RM_L_DSS MI_RM_AUX.LEFT_RM_PTR = rm_buffer_ptr Signal MI_RM_AUX.HEALTH_L_EVENT Signal MI_RM_AUX.SYSMSG_L_EVENT ELSE MI_RM_AUX.RIGHT_RM_PTR = rrπ_buffer_ptr Signal MI_RM_AUX.HEALTH_R_EVENT Signal MI_RM_AUX.SYSMSG_R_EVENT ENDIF ENDIF ENDWITH RETURN END SUBROUTINE SUBROUTINE DMA_ENABLE Clear MI_RMBMS[RMBMS_idx].DMA_ENABLE (KER$CLEAR_EVENT) MI_RMBMS [RMBMS_idx].RMB_STS_V_DISABLED = false MI_RMBSM [RMBMS_idx].RMB_STS_V_EXPECTED = true RETURN END SUBROUTINE SUBROUTINE DMA_DISABLE Clear MI_RMBMS [RMBMS_idx].DMA_DISABLE (KER$CLEAR_EVENT) MI_RMBMS [RMBMS_idx].RMB_STS_V_DISABLE = true MI_RMBMS [RMBMS_idx].RMB_STS_V_EXPECTED = false Ml RMBMS [RMBMS idx].PEND BUFF PTR = Null RETURN END SUBROUTINE SUBROUTINE TIME_CHANGE CALL KERSCLEAR_EVENT with MI_Rm_AUX.TIME_CHANGE current time = Current system time first dma time = current time RETURN END SUBROUTINE SUBROUTINE update pointers (state) Lock Ml RM GLOBALS mutex Ml RM DATA.RM STATUS = state Copy the LEFT/SIDE SDSS/DSS pointers: • MI_RM_DATA.LEFT_SDSS_PTR = MI_RMBMS (MI_SDSS_L_IDX).PEND_BU FF_PTR MI_RM_DATA.RIGHT_SDSS_PTR = MI_RMBMS (MI_SDSS_R_IDX).PEND_BU FF_PTR MI_RM_DATA.LEFT_DSS_PTR = MI_RMBMS (MI_DSS_L_IDX).PEND_BUFF_PTR MI_RM_DATA.RIGHT_DSS_PTR = MI-RMBMS (MI_DSS_R_IDX).PEND_BUFF_PTR Clear FOX/DOG pointers: MI_RM_DATA.FOX_DSS_PTR = null MI_RM_DATA.DOG_DSS_PTR = null MI_RM_DATA.FOX_MAP_PTR = null MI_RM_DATA.DOG_MAP_PTR = null Mark the info byte as " not prime" until proven otherwise: Clear MI_RM_DATA.RIGHT_INFO-BYTE prime bit /* Bit 0 */ Clear MI_RM_DATA.LEFT_INFO-BYTE prime Pit Set Fox side and dog side to "unknown" (1): MI_RM_DATA.FOX_SIDE = -1 MI_RM_DATA.DOG_SIDE = -1 Determine new FOX/DOG information: IF MI_RMBMS (MI-DSS-L-IDX). MOD_STATUS = fox status or eagle status MI_RM_DATA.FOX_DSS_PTR = MI_RMBMS(MI_DSS_L_IDX).PEND_BUFF_PTR MI_RM_DATA.FOX_MAP_PTR = Addr (MEMORY_MAP_L_TABLE) Set MI_RM_DATA.FOX_INFO_BYTE left/right bit /* bit 0 */ Set MI_RM_DATA.LEFT_INFO__BYTE prime bit /* bit 2 */ MI_RM_DATA.FOX_SIDE = 0 /* Left */ IFMI_RMBMS(MI_DSS_R_IDX).MOD_STATUS = dog_statusor "task B" MI_RM_DATA.DOG_DSS_PTR = MI_RMBMS (MI_DSS_R_IDX). PEND_BUFF_PTR MI_RM_DATA.DOG_MAP_PTR = Addr (MEMORY_MAP_L_TABLE) Clear MI_RM_DATA.DOG_INFO_BYTE left/right bit MI_RM_DATA.DOG_SIDE = 1 /* Right*/ ENDIF ELSE IFMI_RMBMS(MI_DSS_R_IDX).MOD_STATUS = fox status or eagle status MI_RM_DATA.FOX_DSS_PTR = MI_RMBMS(MI_DSS_R_IDX).PEND_BUFF_PTR MI_RM_DATA.FOX_MAP_PTR = Addr (MEMORY_MAP_R_TABLE) Clear MI_RM_DATA.FOX_INFO_BYTE left/right bit Set MI_RM_DATA.RIGHT_INFO_BYTE prime bit MI_RM_DATA.FOX_SIDE = 1 /* Right */ IF RMBMS (MI_DSS_L_IDX).MOD_STATUS = dog_status or "task B" MI_RM_DATA.DOG_DSS_PTR = MI_RMBMS(MI_DSS_L_IDX).PEND_BUFF_PTR - MI_RM_DATA.DOG_MAP_PTR = Addr (MEMORY_MAP_L_TABLE) Set MI_RM_DATA.DOG_INFO-BYTE left/right bit Ml RM DATA.DOG SIDE = 0 /* Left */ ENDIF ENDIF ENDIF Release Ml RM GLOBALS mutex Clear context: FOR i = 0 to 3 MI_RMBMS (i).PEND_BUFF-PTR = null Clear MI_RMBMS (i).RMB_STS__V_RECEIVED ENDFOR END SUBROUTINE END PROGRAM Referring to Figure 5, a diagrammatic illustration is shown of the relationship between the reflective memory buffers 314 in the front end computer 18a, the transfer map 37 in the IFS circuit 28 and the dual-ported data memory 22 in the process control computers 12a- 12b. For purposes of illustration, the data memory 22 is shown to include only two segments. The transfer map 37 indicates that data memory addresses 2000 to 2002 (hex) in the first segment, and data memory addresses 4100 to 4105 (hex)in the second segment are to be transferred to the reflective memory buffer 46a. More specifically, it should be observed that the transfer map 37 creates a block of contiguous data elements from memory locations in the data memory 22 which are not necessarily contiguous. Referring to Figure 6, a block diagram of the IFS circuit 28 is shown. In this block diagram, the individual transmitters and receivers (for example, transmitter 38a and receiver 40a) are shown in a single block 400 which also includes the AT&T ODL200 series light converters. The IFS circuit 28 also includes control blocks 402-404 whicn govern the transfer of αata/address signals to ano rom the transmitter/receiver block 400 In this regard, the IFS circuit 28 includes both an address buffer 406 and a data buffer 408 to facilitate these signal 5 transfers. An address latch 410 is also provided for sending a data memory address to the stealth port Similarly, a transceiver 412 is provided to enable the IFS circuit 28 to send or receive data information via the data bus of the stealth interface circuit 16 The IFS circuit 28 also includes a stealth timing and control circuit 414 The stealth timing and control circuit 414 includes one or more Programmable Array Logic circuits to 10 implement a state machine for processing specific signals to or from the stealth interface circuit 16. For example, when the SDSS signal is received, it provides an indication to the the IFS circuit 28 that a valid window exists for reading from the data memory 22. Assuming that the arbitration circuit on the stealth interface circuit 16 also grants access to the data memory 22, then the stealth timing and control circuit 414 will appropriately set the control status register 15 416. The data out control circuit 404 will respond by causing a DMA counter circuit 418 to start counting down to zero from a pre-set value. The DMA counter 418 will decrement with each data word read from the data memory 22. The DMA counter 418 in turn controls a DMA word count circuit 420 which generates an address in the transfer map 37. In other words, the DMA word count circuit 420 points to an address in the transfer map 37, which in turn points to an 20 address in the data memory 22 Through this form of indirection, the IFS circuit 28 will read each of the locations of the data memory 22 that are specified in the transfer map 37 for the particular window permitted by the process control computer 12 through the stealth interface circuit 16. Referring to Figure 7, a block diagram of the IFQ circuit 30 is shown. The IFQ 25 circuit 30 includes the Intel 80186 microprocessor, as discussed above, and the program forthis microprocessor is stored in EPROM 420. Additionally, an address latch 422 is coupled to the address bus 424 of the microprocessor 42. Similarly, a data buffer 426 is connected to the data bus 428 of the microprocessor 42. A 64Kb RAM circuit 430 is also coupled to both the address bus 424 and the data bus 428. The RAM circuit 430 is used to store system data, such as one or 30 more stacks and other operational data structures for the microprocessor 42. The IFQ circuit 30 also includes a fiber interface "daughter" board 432, which contains the circuits directly responsible for transmitting and receiving signals over the fiber optic cables 32. In this regard, block 434 includes the two channels of light converters and receiver circuits, and block 436 includes the two channels of light converters and 35 transmitter/receiver circuits, as discussed above. With the Gazelle serial transmitter/receiver pairs, each of the fiber optic links to the IFS circuits 28a-28b is capable of transmitting 2.5 million, 40 bit frames per second. Block 44 represents the two 128Kb data buffers used for initially storing SDSS and DSS data which is asynchronously received from the process control computers 12a-12b, as discussed in connection with Figure 1 These 'link" data buffers are preferably implemented using two independent memories in a dual-port configuration, one -or each fiber optic channel, in order to provide real-time uninterrupted gathering of process αata and messages from the IFS circuits The block 438 represents the provision of at least one word register (for each fiber optic channel) used to hold serial data to be transmitted to one of :ne or p cess control computers 12a- 12b The block 440 represent the logic circuits for controlling the storing of .nTormation into the data buffers 44 and the word register 438 The logic circuits 440 includes one or more Programmable Array Logic (" PAL") circuits for implementing a state machine for o handling these data write operations For example, when a forty bit data frame is received from one of the process control computers 12a- 12b, the logic circuits 440 will decode the address and control bit in order to steer the data bits to the appropriate memory location in the data buffers 44 The fiber interface daughter board 432 also includes an interrupt circuit block 442 which contains the interrupt logic for helping the microprocessor 42 understand the state 5 of the data write activities In this regard, at least two separate interrupt lines are used to interconnect the interrupt circuit block 442 with the microprocessor 42 (one per fiber optic cnannel) Both the IFS circuit 28 and the fiber interface daughter board 432 of the IFQ circuit 30 also include a PAL state machine whicn examines incoming frames for errors (for example, parity errors and 4B/5B link errors) In one embodiment of the front end communication 0 system 10, all of the state machines on the IFQ circuit 30 operate from a 20MHz dock signal which is derived from the 10MHz clock signal of the microprocessor 42. The microprocessor 42 is programmed to provide at least two DMA engines for moving data For example, the microprocessor 42 will respond to appropriate interrupt signals from the interrupt circuit block 442 by moving data from the data buffers 44 to a dual-ported 5 64Kb RAM circuit 444, which acts to provide a bucket brigade storage medium Then, once sufficient data is stored in the dual-ported RAM circuit 444 (for example, 8Kb), the DMA state machine in the first in, first out ("FIFO") DMA control block 446 will move this data over the Q- ous 302 of the front end computer 18 Memory cycles are preferably interleaved between both the microprocessor 42 system bus and the Q-bus, with the system bus of the microprocessor 42 0 given top priority A status register circuit 448 and a CSR circuit 450 are provided to transfer status and control information Additionally, as shown in Figure 7, an address buffer 452 and a DMA/FIFO counter 454 are also coupled to the address lines of the dual-ported RAM circuit 444 Similarly, a DMA FIFO data buffer 456 for the Q-bus 302 and a data buffer for the microprocessor 42 are also coupled to the data lines of the dual-ported RAM circuit 444 5 The present invention has been described in an illustrative manner In this regard, it is evident that those skilled in the art once given the benefit of the foregoing disclosure, may now make modifications to the specific embodiments described herein without departing from the spirit of the present invention. Such modifications are to be considered within the scope of the present invention which is limited solely by the scope and spirit of the appended claims.

Claims: WHAT IS CLAIMED IS: 1 An intelligent front end communication system for a plurality of computers, cnaractenzed in that: 5 said comDuters comprise a plurality of actively redundant process computers wnich are used to control the operation of a physical process; and said intelligent front end communication system also includes network means for enabling communication between a plurality of computer entities, and front end interface means, connected to each of said redundant process control ι o computers and said network means, for enabling communication between said redundant process computers and said networκ means, said front end interface means having shadow memory means for storing sequential sets of dynamic data which are asynchronously received from each of said redundant process computers, for time aligning corresponding dynamic data sets from each of said redundant process control computers and for enabling at least a portion 15 of said time aligned data sets to be transferred to said network means 2. The intelligent front end communication system according to Claim 1 , wherein said front end interface means includes a plurality of front end computers, with each of said front end computers being connected to each of said redundant process control computers, 20 and each of said front end computers being connected to said network means. 3. The intelligent front end communication system according to Claim 1 , wherein --_ said shadow memory means includes corresponding memory areas for each of said redundant process control computers, so that sequential dynamic data sets received from each of said 25 redundant process control computers may be individually stored and time aligned by said shadow memory means 4. The intelligent front end communication system according to Claim 3, wherein each of said corresponding memory areas includes first buffer means for storing a set of said 30 dynamic data which is asynchronously received from one of said redundant process control computers, second buffer means for providing a current time aligned set of dynamic data from said asynchronous set of dynamic data, and third buffer means for enabling a query to be completed on a transferable set of dynamic data from a previous time aligned set of dynamic data. 35 5. The intelligent front end communication system according to Claim 4, wherein said shadow memory means is contained in a front end computer which includes synchronization means for copying the pointers from each of said first buffer means to provide the pointers for said second buffer means in response to a time alignment event. 6. The intelligent front end communication system according to Claim 5, wherein said time alignment event occurs when said first buffer means in each of said corresponding memory areas has completely stored their respective dynamic data sets. 7. The intelligent front end communication system according to Claim 4, wherein each of said corresponding memory areas includes correlation buffer means for storing related o portions of at least two of said dynamic data sets from each of said redundant process control computers. 8. The intelligent front end computer system according to Claim 7, wherein said related portions include input data from one dynamic data set and output data from a 5 following dynamic data set. 9. The intelligent front end computer system according to Claim 1 , wherein said front end interface means is comprised of: a front end computer which includes said shadow memory means; 0 a irst interface circuit connected to each of said redundant process control computers; a second interface circuit connected to said front end computer; and transmission means for enabling bi-directional communication between said second interface circuit and both of said first interface circuits. 5 10. The intelligent front end computer system according to Claim 9, wherein each of said first interface circuits include transfer map means for determining the variables which compose said dynamic data set. 0 1 1 - The intelligent front end computer system according to Claim 9, wherein each of said first interface circuits and second interface circuit include corresponding transmitter and receiver circuits to enable simultaneous bi-directional signal communication through said transmission means. 5 12. The intelligent front end computer system according to Claim 1 1 , wherein said transmission means includes a plurality of optical fibers. 13. The intelligent front end computer system according to Claim 9, wherein said second interface circuit includes processor means for controlling signal communications between said second interface circuit and each of said first interface circuits. 14. The intelligent front eno computer system according to Claim 13, wherein said second interface circuit includes initial memory means for separately storing dynamic data sets which are asynchronously received from each of said first interface circuits. 15. The intelligent front end computer system according to Claim 14, wherein said processor means including means for causing direct memory access transfers of dynamic data from said initial memory means to said interim memory means in each of said corresponding memory areas. 16. A method of transferring dynamic data from a plurality of actively redundant process control computers to at least one computer entity residing on a computer network, comprising the steps of: transmitting sequential dynamic data sets from each of said redundant process control computers to at least one front end computer in accordance with the availability of dynamic data from said redundant process control computers; asynchronously storing the dynamic data sets received from each of said redundant process computer at said front end computer; time aligning corresponding dynamic data sets from each of said redundant process control computers in a shadow memory of said front end computer; and transferring at least a portion of said time aligned dynamic data sets from said front end computer to said computer entity on said computer network. 17. The method according to Claim 16, wherein said dynamic data sets from each of said redundant process control computers are first stored in an initial data memory associated with said front end computer, and then after a predetermined quantity of data from any one of said redundant process control computers has been stored in said initial data memory, said predetermined quantity of data is transferred to said shadow memory by a direct memory access operation while said dynamic data sets continue to be stored in said initial data memory. 18. The method according to Claim 16, wherein said shadow memory includes a corresponding first buffer section, a corresponding second buffer section and a corresponding third buffer section for each of said redundant process control computers, and said predetermined quantities of data are stored in said first, second and third buffer sections in a round robin manner. 19 The method according to Claim 18, wherein the pointers to each of said corresponαing first buffer sections are copied to provide pointers for said corresponding second buffer sections in response to a time alignment event. 20 The method according to Claim 19, wherein said time alignment event occurs when all of said first buffer sections have completely stored a corresponding dynamic data set 21 The method according to Claim 18, wherein said shadow memory includes a correlation buffer section for each of said redundant process control computers, and related portions of at least two of said dynamic data sets from each of said redundant process control computers are stored in said correlation buffer sections 22. The method according to Claim 21 , wherein said related portions include input data from one dynamic data set and output data from a following dynamic data set.

Inventors: ALLBERY JAMES D JR, BUTLER RICHARD L, CULLEN JAMES H, ELLISON JOSEPH, FERREIRA JAMES P, JOHNSON SUSAN J, PATEL CHIMAN L, SCHULTZ DALE H, TROISI PETER A, UBAN JAMES E, ALLBERY, JAMES, D., JR., BUTLER, RICHARD, L., CULLEN, JAMES, H., ELLISON, JOSEPH, FERREIRA, JAMES, P., JOHNSON, SUSAN, J., PATEL, CHIMAN, L., SCHULTZ, DALE, H., TROISI, PETER, A., UBAN, JAMES, E.
Applicants: DOW CHEMICAL CO, THE DOW CHEMICAL COMPANY
Application year: 1993
Main classification: G06F11
IPC codes: G05B9, G06F11, G06F13