International Business Machines Corporation

Paul A Beaven

Barry Keith Aldred

Brian Phillip Ernest Fisk

Adrian John Hawes

Roger J Llewelyn

Dave A Canton

Davin Morris Coleman

Tom H Snagge

Michael A Jewson

Nick B Sargeant

In an asynchronous message queuing network, a data processing method of finding a lost message includes the steps of: sending a first message from an originating data processing unit to an intermediate data processing unit, the message including an indication that the message is traceable; sending a tracer message from an originating data processing unit to an intermediate data processing unit, the tracer message identifying the first message as a lost message which the originating data processing unit would like to find; at the intermediate data processing unit, upon receiving the tracer message, checking to determine whether the first message exists within the intermediate data processing unit, and sending a reply message back to the originating unit if the first message is found within the intermediate data processing unit; and at the intermediate data processing unit, if the first message is not found within the intermediate data processing unit, determining whether the first message has passed through the intermediate data processing unit, and if the first message has passed through the intermediate data processing unit, determining a neighboring data processing unit which received the first message from the intermediate data processing unit and forwarding the tracer message to the neighboring data processing unit.

Data processing technique for message tracing in an asynchronous messaging network

A data communications apparatus connected to a network through which datagrams flow from the data communications apparatus to at least one other data communications apparatus also connected to the network, the apparatus having: a means for receiving data which is to be transmitted over the network, such data being broken up into data records; and a means for packing the data records into datagrams for transmission over the network, including a means for assigning data records to datagrams; wherein the means for packing takes the data records out of sequential order when assigning data records to datagrams.

Data communications apparatus, method and computer program product implementing data communications protocol with efficient packing of datagrams

Provided is a method and a system for computer network monitoring, implemented in a network in which processes communicate using message queuing. Each node of the network has a network management program installed thereon which includes two independent components: a Point Of Control (POC) program for initiating network tests by injecting a test message into the network and for receiving responses from all the nodes of the network; and a Network Test Program (NTP) for sending a reply message to the single POC for a particular test when the NTP receives test messages within that test, and for propagating the test by forwarding a message to all of the current node's adjacent nodes. Test results are analyzed at the POC for display to the network administrator. Injected test messages propagate throughout the network in a self-exploring manner, exploiting the parallelism of the network. The individual nodes are not required to know the network topology other than to know their nearest neighbor nodes.

Performance and status monitoring in a computer network

A data processing system displays options for selection by a user as a hierarchical tree form diagram. When a user indicates his first selected option to the data processing system it calculates what further selections are and are not available as a result of the selected option. It then modifies the display to show the options which are available for selection and those which are not. A selection list is stored and updated by the data processing system and the options input by the user are executed when the selection list is complete.

Tree form menu display for a data processing system

A graphics display apparatus with a combined bit buffer and character graphics store includes a coded display buffer containing pointers to the store. The store is constituted by odd and even memories used to derive bit patterns for odd and even character cell columns on the display and is partitioned into a font area and a bit buffer area. In a first mode of operation, compatible with existing programmed symbol arrangements, pointers in the coded display buffer in conjunction with odd/even select signals and slice signals derive the bit patterns for each raster scan line of the display. In a second mode of operation, a graphic image to be displayed is stored as a bit map in the bit buffer area: the required bit pattern is derived using slice and odd/even select signals in conjunction with pointers stored in the coded display buffer.

Graphic display apparatus with combined bit buffer and character

A graphics display apparatus employing a raster scanned cathode ray tube uses a refresh buffer constituted by a coded alphanumeric buffer and an associated character generator for displaying alphanumeric characters and other symbols and an all-points-addressable buffer for displaying graphics. Serialized data from the two buffers are mixed in a mixer under control of at least one control bit (attribute) stored in the coded buffer to provide a composite pel-representing bit stream supplied to the cathode ray tube.

Display apparatus with mixed alphanumeric and graphic image

An interactive data retrieval apparatus in which a data base store is searched by content using search keys entered by an operator. Dedicated hardware includes a plurality of search modules and apparatus for clocking the byte-wide data stream read from the data store through successive search modules. In each module, the data is compared with an entered search key. When a match is found between the data stream and the search keys, the data record is displayed to the operator. The apparatus can detect near matches to allow for misspellings etc. In one embodiment of the search module, a plurality of comparison cells perform byte-equality operations on search key data stored in a search key register and the data stream. In a second embodiment, an associative store contains the n-character search key, the associative store being addressed by each character in the data stream as it is clocked past its data port. n shift registers are connected to the outputs of the associative store and are shifted in synchronism with the data stream.

Growing community of inventors

Romsey, United Kingdom

Paul A Beaven