Patent GB-1529089-A (GB)
Title: In a data communication network apparatus for updating sets of data stored at nodal locations interconnected by a data communication link
IPC: G06F12/00
Filed: 1976-05-24
Abstract: 1529089 Data transmission; common channel systems INTERNATIONAL BUSINESS MACHINES CORP 24 May 1976 [30 June 1975] 21369/76 Heading H4P A data communication network comprises a plurality of discrete nodal locations, interconnected by a data link, each associated with one of a plurality of data computing units and having a memory for storing a plurality of data items, predetermined ones of the data items being stored in the memories of at least two of the data computing units, with provision at each of said nodal locations for storing indicia representing the nodal storage locations of each of the predetermined data items, means at each of the nodal locations responsive to a locally generated update signal for a given data item, and under control of stored indicia, for initiating and transmitting updating commands to all other units storing the given data item and means at each of the nodal locations repsonsive to updating commands addressed to it for updating the given data item in its associated memory. At each nodal location, indicia representative of updating priority of data items may be also stored together with a comparator responsive to occurrence of consecutive or simultaneous updating commands permitting response only to commands of higher priority. Similarly with conflict between local and external update commands, a local command has precedence and the external command is only excluded if it has a higher priority. Alternatively if an external nodal location has a higher priority than a local nodal location then commands from the external location have priority over local commands. Each node e.g. 1 comprises a computer 3B, an update unit 2B and an interface 1B which in the embodiment is connected into a closed loop link 4A, 4B comprising 4 wires through which messages are transmitted parallel by bit and serially by character. The link may be optical or by radio etc. Each node can abort or insert a message or pass it through, hence a message can circulate until a node is prepared to accept it. All messages are initiated within an update unit then inserted into an associated interface and hence into line when a blank message slot is located. Each data item = 16 bytes of 8 bits each plus 4 bytes for each mode to be addressed i.e. if A addresses B and C, 18 bytes would be transmitted from A to B and 2 returned from B to A and similarly from B to C making 40 bytes in all. Each interface has 7 x 4 bit registers through which successive characters are shifted. A local tuning generator synchronizes message shifts and provides control signals to the update unit to identify the location of each character as it progresses through successive registers. While a message is in the interface the destination is analysed for blank message (prefix 0000) any address, or not any address, hence can insert a message (if 0000) absorb the message and insert 0000 or take nil action respectively. One of several command characters follow plus 4 bits signifying the sender which is used for testing relative priorities. The data item number following identifies the data item in whole or part to be updated, and the last 8 bits signify the number of bytes preceding. The functions and gating arrangements of the update unit is described in detail in connection with Figs. 3A-3Z (not shown).