two major factors used to categorize such systems

Question 1

two major factors
used to categorize such systems

Answer 1

processing units
interconnection networks

Question 2

is performed
by writing to and reading from the global memory

Answer 2

Communication in shared memory systems

Question 3

plays a major role in determining the communication
speed.

Answer 3

interconnection network

Question 4

Two schemes are introduced,

Answer 4

static and dynamic interconnection networks

Question 5

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

Answer 5

Static networks

Question 6

messages must be routed along established links

Answer 6

Static networks

Question 7

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

Answer 7

Dynamic interconnection

Question 8

static networks

Answer 8

hypercube
mesh
k-ary n-cube topologies

Question 9

dynamic interconnection networks

Answer 9

bus, crossbar, and multistage interconnection
topologies

Question 10

An interconnection network could be either static or dynamic

Answer 10

true

Question 11

Connections
in a static network are

Answer 11

fixed links

Question 12

connections in a dynamic network

Answer 12

established on the fly as needed

Question 13

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

Answer 13

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

Question 14

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

Answer 14

bus-based versus switch-based.

Question 15

can further be classified as single bus or multiple buses.

Answer 15

Bus-based networks

Question 16

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

Answer 16

Switch-based dynamic networks

Question 17

is considered the simplest way to connect multiprocessor systems.

Answer 17

single bus

Question 18

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

Answer 18

true

Question 19

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

Answer 19

multiple bus multiprocessor system

Question 20

bus can be classified

Answer 20

synchronous or asynchronous

Question 21

Asynchronous
bus

Answer 21

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

Question 22

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

Answer 22

true

Question 23

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

Answer 23

handshaking

Question 24

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

Answer 24

bus
request and bus grant

Question 25

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

Answer 25

bus
request and bus grant

Question 26

Three basic interconnection topologies

Answer 26

crossbar,
single-stage,
and multistage.

Question 27

represents the other extreme to the limited single bus network

Answer 27

crossbar network

Question 28

a single stage of switching elements (SEs) exists between the inputs and the outputs of the network.

Question 29

introduced as a means to improve
some of the limitations of the single bus system while keeping the cost within an
affordable limit.

Answer 29

Multistage interconnection networks (MINs)

Question 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.

Answer 30

Blocking networks

Question 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.

Answer 31

Rearrangeable networks

Question 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.

Answer 32

Nonblocking networks

Question 33

Static (fixed) interconnection networks

Answer 33

characterized by having fixed paths, unidirectional
or bidirectional, between processors.

Question 34

Two types of static networks can be
identified

Answer 34

completely connected networks (CCNs) and limited connection
networks (LCNs)

Question 35

each node is connected to all other nodes
in the network.

Answer 35

completely connected network (CCN)

Question 36

guarantee fast delivery of messages
from any source node to any destination node (only one link has to be traversed)

Answer 36

completely connected network (CCN)

Question 37

expensive in terms of the number of links needed
for their construction.

Answer 37

completely connected network (CCN)

Question 38

do not provide a direct link from every node to
every other node in the network.

Answer 38

Limited connection networks (LCNs)

Question 39

A number of regular interconnection patterns have evolved over the years for
LCNs These patterns includ

Answer 39

. linear arrays;
. ring (loop) networks;
. two-dimensional arrays (nearest-neighbor mesh);
. tree networks; and
. cube networks.

Question 40

each node is connected to its two immediate neighboring nodes.

Answer 40

linear array

Question 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.

Answer 41

tree network

Question 42

are patterned after the n-cube structure

Answer 42

Cube-connected networks

Question 43

each node has a degree n. The degree of a node is defined as the
number of links incident on the node

Answer 43

n-cube

Question 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.

Answer 44

n-dimensional mesh

Question 45

is a radix k cube with n dimensions.

Answer 45

k-ary n-cube network

Question 46

The cost of the crossbar system can be measured in terms of the
number of switching elements (cross points) required inside the crossbar.

Question 47

each node is connected to all other nodes in the network.

Answer 47

Completely Connected Networks (CCNs)

Question 48

each node is connected to
its two immediate neighboring nodes.

Answer 48

Linear Array Networks

Question 49

a given node is connected to both
its parent node and to its children nodes.

Answer 49

Tree Networks

Question 50

has 2n nodes where two nodes
are connected if the binary representation of their addresses differs by one and only
one bit.

Answer 50

Cube-Connected Networks

Question 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)

Answer 51

Mesh-Connected Networks

Question 52

is a radix k cube
with n dimensions. The number of nodes in a k-ary n-cube is N ¼ kn.

Answer 52

The k-ary n-Cube Networks