Showing papers on "Wireless mesh network published in 1992"

The J-machine network

Abstract: The structure and implementation of J-Machine network, a 3-D mesh using wormhole routing and virtual channels to provide two network priorities, is described. Each network channel is 9-b wide and operates at 32 MHz. Each J-Machine node contains network routers that guide messages between the six bidirectional channels incident on each node, and a network interface that handles messages originating or terminating at the node. The router is fully synchronous, uses absolute addressing, and performs dimension-order routing. A novel pad design permits the bidirectional channels to reverse direction each cycle without danger of conduction overlap. The J-machine network provides low latency communication fabric for up to 64 k Message Driven Processor nodes. >

Self-timed mesh routing chip with data broadcasting

Abstract: A method and apparatus providing for data broadcasting in a two dimensional mesh of processor nodes is disclosed. In accordance with the present invention, a self-timed message routing chip is coupled to each processor node, thereby forming a two dimensional mesh of message routing chips. Broadcasting originates from a corner node, and data can broadcast through the mesh routing chips to a row, a column, or a matrix of nodes. The mesh routing chips, together, form a self-timed pipeline with each individual message routing chip having broadcasting hardware which provides for the forking of a message within that particular message routing chip. The self-timed forking of a message within individual message routing chips directly supports data broadcasting within the two dimensional mesh.

Supporting the information mesh

Abstract: A model for the role of the network in a distributed computing environment that will necessarily require abstractions in the operating system has been developed. This model is based on information that is long lived and widely distributed. It assumes that interesting information can be distributed around the world, and survives outside any particular application, application toolkit, or programming language runtime system. Within the information mesh, computations or activities will take place in one of three forms: one in which the focus of attention is changed, but the application remains the same; one in which the focus changes, and the application itself must also change; and a third that is less specific, more global, e.g., searching. In the cases of such global operations, one may need to limit the scope of terms of the mesh, since these are operations over regions of the mesh. It is important to include links and a native form of link shadow in each operating system, if the workstation running that operating system is to allow the user to collaborate in the information mesh. >