two major factors used to categorize such systems Flashcards

1
Q

two major factors
used to categorize such systems

A

processing units
interconnection networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

is performed
by writing to and reading from the global memory

A

Communication in shared memory systems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

plays a major role in determining the communication
speed.

A

interconnection network

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Two schemes are introduced,

A

static and dynamic interconnection networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

when the system is designed rather than when the connection is needed

A

Static networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

messages must be routed along established links

A

Static networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

networks establish connections between two or more nodes on the fly as messages
are routed along the links.

A

Dynamic interconnection

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

static networks

A

hypercube
mesh
k-ary n-cube topologies

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

dynamic interconnection networks

A

bus, crossbar, and multistage interconnection
topologies

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

An interconnection network could be either static or dynamic

A

true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Connections
in a static network are

A

fixed links

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

connections in a dynamic network

A

established on the fly as needed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Static networks can be further classified according
to their interconnection pattern as

A

one-dimension (1D), two-dimension (2D), or
hypercube (HC).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Dynamic networks, on the other hand, can be classified based on
interconnection scheme

A

bus-based versus switch-based.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

can further be classified as single bus or multiple buses.

A

Bus-based networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

can be classified according to the structure of the interconnection network as
single-stage (SS), multistage (MS), or crossbar networks

A

Switch-based dynamic networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

is considered the simplest way to connect multiprocessor systems.

A

single bus

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

The use of multiple buses to connect multiple processors is a natural extension to the
single shared bus system.

A

true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

uses several parallel
buses to interconnect multiple processors and multiple memory modules.

A

multiple bus multiprocessor system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

bus can be classified

A

synchronous or asynchronous

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Asynchronous
bus

A

depends on the availability of data and the readiness of
devices to initiate bus transactions.

22
Q

The time for any transaction
over a synchronous bus is known in advance

23
Q

The process of passing bus mastership from one processor
to another is called

A

handshaking

24
Q

The process of passing bus mastership from one processor
to another is called handshaking and requires the use of two control signals

A

bus
request and bus grant

25
The process of passing bus mastership from one processor to another is called handshaking and requires the use of two control signals
bus request and bus grant
26
Three basic interconnection topologies
crossbar, single-stage, and multistage.
27
represents the other extreme to the limited single bus network
crossbar network
28
a single stage of switching elements (SEs) exists between the inputs and the outputs of the network.
29
introduced as a means to improve some of the limitations of the single bus system while keeping the cost within an affordable limit.
Multistage interconnection networks (MINs)
30
possess the property that in the presence of a currently established interconnection between a pair of input/output, the arrival of a request for a new interconnection between two arbitrary unused input and output may or may not be possible.
Blocking networks
31
characterized by the property that it is always possible to rearrange already established connections in order to make allowance for other connections to be established simultaneously.
Rearrangeable networks
32
characterized by the property that in the presence of a currently established connection between any pair of input/output, it will always be possible to establish a connection between any arbitrary unused pair of input/output.
Nonblocking networks
33
Static (fixed) interconnection networks
characterized by having fixed paths, unidirectional or bidirectional, between processors.
34
Two types of static networks can be identified
completely connected networks (CCNs) and limited connection networks (LCNs)
35
each node is connected to all other nodes in the network.
completely connected network (CCN)
36
guarantee fast delivery of messages from any source node to any destination node (only one link has to be traversed)
completely connected network (CCN)
37
expensive in terms of the number of links needed for their construction.
completely connected network (CCN)
38
do not provide a direct link from every node to every other node in the network.
Limited connection networks (LCNs)
39
A number of regular interconnection patterns have evolved over the years for LCNs These patterns includ
. linear arrays; . ring (loop) networks; . two-dimensional arrays (nearest-neighbor mesh); . tree networks; and . cube networks.
40
each node is connected to its two immediate neighboring nodes.
linear array
41
of which the binary tree (shown in Fig. 2.16d) is a special case, if a node at level i (assuming that the root node is at level 0) needs to communicate with a node at level j, where i . j and the destination node belongs to the same root’s (a) (b) (c) (d) (e) Figure 2.16 Examples of static limited connected networks (a) a linear array network; (b) a ring network; (c) a two-dimensional array (mesh) network; (d) a tree network; and (e) a three-cube network. 36 MULTIPROCESSORS INTERCONNECTION NETWORKS TEAM LinG - Live, Informative, Non-cost and Genuine ! child subtree, then it will have to send its message up the tree traversing nodes at levels i  1, i  2, . . . , j þ 1 until it reaches the destination node.
tree network
42
are patterned after the n-cube structure
Cube-connected networks
43
each node has a degree n. The degree of a node is defined as the number of links incident on the node
n-cube
44
can be defined as an interconnection structure that has K0  K1   Kn1 nodes where n is the number of dimensions of the network and Ki is the radix of dimension i. Figure 2.18 shows an example of a 3  3  2 mesh network.
n-dimensional mesh
45
is a radix k cube with n dimensions.
k-ary n-cube network
46
The cost of the crossbar system can be measured in terms of the number of switching elements (cross points) required inside the crossbar.
47
each node is connected to all other nodes in the network.
Completely Connected Networks (CCNs)
48
each node is connected to its two immediate neighboring nodes.
Linear Array Networks
49
a given node is connected to both its parent node and to its children nodes.
Tree Networks
50
has 2n nodes where two nodes are connected if the binary representation of their addresses differs by one and only one bit.
Cube-Connected Networks
51
connects n  n nodes in a 2D manner such that a node whose position is (i, j) is connected to its neighbors at positions (i+1, j+1)
Mesh-Connected Networks
52
is a radix k cube with n dimensions. The number of nodes in a k-ary n-cube is N ¼ kn.
The k-ary n-Cube Networks