Abstract: A method of displaying on a computer screen a two dimensional representation without any false crossings of a three dimensional interconnection network, where the three dimensional interconnection network consists of vertices defined by a series of perpendicular quadrilaterals; where the vertices of the quadrilaterals are mapped onto a two dimensional hyperbolic plane using geometric functions based on the vertex chosen as a point of origin and where the vertices in the two dimensional display are labelled along with any performance data.

Abstract: A local area network employs a shared control channel over which control messages between frequency agile modems for each of the user nodes of a distributed architecture-configured network are exchanged. In addition to the shared control channel, a plurality of data channel pairs is available for effecting full duplex communications between any two nodes of the network. Because all data channel assignments depend upon successful use of the control channel, a prescribed control channel contention access scheme is employed to optimize use of the control channel by all users of the network irrespective of the demand for its use. Pursuant to this scheme, each requesting node must first compare an accumulated activity measure with a traffic density threshold that is continuously optimized for the current level of control channel activity.

Abstract: In multiprocessor systems, and especially in multiprocessor emulation systems, time alignment between the individual processors is accomplished by using a time window established in a Local Pseudo-Time Accumulator (LPA) at each processor and a time reference hereinafter referred to as Master Pseudo Time (MPT). During the run time, any processor which is within the time frame of the window may continue execution. Any processor which falls behind the window must halt the advance of the Master Pseudo Time untl the processor can execute long enough to move back into the window. Any processor which moves ahead of the window must enter an idle state until the Master Pseudo Time advances enough for the processing element to move back into the window.