Abstract: Control of the transfer of data objects over a communications link is achieved by obtaining a representative data object having an object size and a transfer time over the communications link. The object size of the representative data object is determined. The transfer time of the representative data object is determined. An effective transfer rate for the communications link is determined using the transfer time and object size. The effective transfer rate is compared to a predetermined value. A number of transfers to perform concurrently is determined based upon the comparison.

Abstract: Disclosed is a apparatus and method for reducing resource location traffic in a compute network. The reduction in location traffic is obtained by a method and apparatus such that a node which has initiated a search for a resource which cannot be found starts a timing cycle interval during which subsequent initiating requests at the node are automatically failed without performing the network search. This reduces network traffic for searches that are likely to fail. Also disclosed is a threshold counter that alleviates possible difficulties that this may cause for high demand resources. The threshold counter is incremented each time a search for a specific resource is automatically failed. A network search is performed when either the interval expires or the threshold counter exceeds a threshold count.

Abstract: A network analysis method is applied to traffic data collected in respect of a network of the type comprising a plurality of logical segments each with a plurality of nodes. The method involves processing the traffic data by preferentially removing traffic associated with nodes identified as acting as global servers, and using the remaining traffic to identify nodes acting as local servers. Upon the local servers being identified, the network analysis method carries out further processing to make suggestions as to whether any of these local servers should be moved to another logical segment and as to whether it would be worthwhile splitting a segment between two associated local servers.

Abstract: In an Open System Interconnection (OSI) environment, an agent Common Management Information Protocol (CMIP) platform maintains an up to date tree of all of the Managed Object Instances (MOIs), in order to perform scoping functions. The agent platform receives a message from an OSI manager which includes a base MOI and levels below the base MOI to receive the message. The agent platform recurses through the tree below the base MOI to determine which MOIs should receive the message. If the message is delete, the children of MOIs to be deleted are also deleted. The children of undeletable MOIs are not deleted. A current, accurate tree is maintained by the agent platform, which can register a new MOI in the tree when a valid request is received from the MOI or the manager. The agent platform can also deregister an MOI upon valid request from the agent associated with the platform.

Abstract: A device for an isochronous data communication system between a first data terminal having a first clock and a remote communication unit having a second clock. A clock multiplex circuit receives the first and second clock signals. A logic means selects either the first or second clock signal as a data timing signal. The data timing signal will correspond with the second clock signal if present, if no second clock signal is present then the data timing signal will correspond with the first clock signal. A communication control device receives the data timing signal for controlling the timing of the communication.

Abstract: A UART protocol which takes advantage of an SDO line space state to optimize communication between computers. A delay is provided by sending a byte of actual data followed by a dummy byte. The dummy byte is produced by placing the SDO line in the mark state, thus freeing up CPU time.

Abstract: In a parallel processor, a plurality of data processing nodes are intercoupled through an array of message routing circuits. Each message routing circuit has multiple input channels on which messages are received and multiple output channels on which messages are sent. A message on an input channel of any one particular message routing circuit contains a header followed by data with the header consisting of a sequence of control characters which route the data. Depending on the control character sequence that is received on an input channel, the data is sent to one, two, or three output channels and each such data transmission is preceded by a respective modified header which is generated from the header on the input channel. By sequentially performing this message processing in a series of message routing circuits, the data is delivered to multiple nodes along a tree-shaped path.

Abstract: In a network of computers having different operating systems with different message transport mechanisms, an interprocess communication layer (IPC) is interposed between applications hosted on the computers and the operating systems thereof. IPC presents a consistent interface to the application processes for message transport therebetween while linking to the intracomputer and intercomputer message transport mechanisms of the operating systems and the network. A process desiring to send or receive messages registers through a REGISTER function passing its system name and process identification (PID) assigned by the operating system to the process. To send a message, a process calls a SEND function passing the system name and system address of the recipient process. IPC attaches the recipient process PID to a message to be delivered.