CC-NUMA stands for Cache-coherent non-uniform memory access machines. A CC-NUMA machine includes several processing nodes linked through a high-bandwidth low-latency interconnection network. Each processing node includes a high-implementation processor, the related cache, and an allocation of the global shared memory.Cache coherence is preserved by a directory-based, write-invalidate cache coherence protocol. ... Read More

Cray T3D is the most recent NUMA machine that was designed to provide a highly scalable parallel supercomputer that can incorporate both the shared memory and the message-passing programming paradigms. As in other NUMA machines, the shared memory is distributed among the processing elements to avoid the memory access bottleneck ... Read More

Hector is a hierarchical NUMA machine consisting of stations connected by a hierarchy of ring networks. Stations are symmetric multiprocessors where the processing modules are linked by an individual bus. Nodes comprise three main units − a processor/cache unit, a memory unit, and the station bus interface which connects the ... Read More

NUMA represents Non-uniform Memory Access. NUMA is a multiprocessor model in which each processor is connected with the dedicated memory. Non-uniform memory access (NUMA) machines were intended to prevent the memory access bottleneck of UMA machines. The logically shared memory is physically assigned among the processing nodes of NUMA machines, ... Read More

UMA represents Uniform memory access. It is a shared memory architecture used in parallel computers. All the processors in the UMA model share the physical memory uniformly. In UMA architecture, access time to a memory location is autonomous of which processor creates the request or which memory chip includes the ... Read More

In adaptive routing, intermediate nodes can take the actual network conditions, including the presence of deterioration or bottlenecks, into account and decide accordingly which neighbor the message should be transmitted. Adaptive routing scheme can be either profitable or misrouting according to the selection of the output channel. In profitable routing, ... Read More

In deterministic routing, the path is fully determined by the source and destination nodes. Intermediate nodes are unable to direct messages even in the case of network congestion.Deterministic routing can be further classified according to the node position where the deterministic path is selected. In source routing, it is the ... Read More

Switching is the actual mechanism by which a message is removed from the input buffer and placed in the output buffer. The switching technique applied has an over-whelming effect on message latency and hence the choice of switching method is crucial in designing any distributed memory computer. The design space ... Read More

In a static network, the connection between input and output nodes is fixed and cannot be modified. Static interconnection network cannot be reconfigured. Examples of this network are linear array, ring, chordal ring, tree, star, fat tree, mesh, tours, systolic arrays, and hypercube. The design space for static interconnection topologies ... Read More

Direct Interconnection networks are used to connect different processing elements or different process memory. Interconnection networks are also known as multi-stage interconnection networks (or MINs), are high-speed computer networks.Characteristics of Direct Interconnection NetworkTopology − It denotes how the nodes of a network are organized.Network Diameter − It is the minimum ... Read More