0% found this document useful (0 votes)
11 views

Final Unit5 CO Notes

Uploaded by

Mohd Ismail Gour
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views

Final Unit5 CO Notes

Uploaded by

Mohd Ismail Gour
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Unit-V

Multiprocessor Systems
Characteristics of multiprocessors
➢ A multiprocessor system is an interconnection of two or more CPUs with memory
➢ and input-output equipment. The term “processor” in multiprocessor can mean either a
central processing unit (CPU) or an input-output processor (IOP).
➢ Multiprocessors are classified as multiple instruction stream, multiple data stream
➢ (MIMD) systems The similarity and distinction between multiprocessor and
multicomputer are Similarity Both support concurrent operations Distinction
➢ The network consists of several autonomous computers that may or may not
communicate with each other.
➢ A multiprocessor system is controlled by one operating system that provides interaction
between processors and all the components of the system cooperate in the solution of a
problem.
➢ Multiprocessing improves the reliability of the system.
➢ The benefit derived from a multiprocessor organization is an improved system
performance.
➢ Multiple independent jobs can be made to operate in parallel.
➢ A single job can be partitioned into multiple parallel tasks.
➢ Multiprocessing can improve performance by decomposing a program into parallel
executable tasks.
➢ The user can explicitly declare that certain tasks of the program be executed in parallel.
➢ This must be done prior to loading the program by specifying the parallel executable
segments.
➢ The other is to provide a compiler with multiprocessor software that can automatically
detect parallelism in a user’s program.
➢ Multiprocessor are classified by the way their memory is organized.
➢ A multiprocessor system with common shared memory is classified as a shared-memory
or tightly coupled multiprocessor.
➢ Tolerate a higher degree of interaction between tasks.
➢ Each processor element with its own private local memory is classified as a distributed-
memory or loosely coupled system.
➢ Are most efficient when the interaction between tasks is minimal

1
Interconnection Structures

The components that form a multiprocessor system are CPUs, IOPs connected to input and
output devices, and a memory unit. The interconnection between the components can have
different physical configurations, depending on the number of transfer paths that are available
between the processors and memory in a shared memory system, among the processing
elements in a loosely coupled system. There are several physical forms available for
establishing an interconnection network.

➢ Time-shared common bus


➢ Multiport memory
➢ Crossbar switch
➢ Multistage switching network
➢ Hypercube system Time Shared Common Bus

A common-bus multiprocessor system consists of a number of processors connected through a


common path to a memory unit.

Disadvantages:

Only one processor can communicate with the memory or another processor at any given
time. As a consequence, the total overall transfer rate within the system is limited by the
speed of the single path A more economical implementation of a dual bus structure is
depicted in Fig. below Part of the local memory may be designed as a cache memory
attached to the CPU.

2
Multiport Memory

• A multiport memory system employs separate buses between each memory module and
each CPU.
• The module must have internal control logic to determine which port will have access to
memory at any given time.
• Memory access conflicts are resolved by assigning fixed priorities to each memory port.
• Adv.:
• The high transfer rate can be achieved because of the multiple paths.
• Disadv.:
• It requires expensive memory control logic and a large number of cables and
connections

Crossbar Switch

• Consists of a number of crosspoints that are placed at intersections between processor


buses and memory module paths.
• The small square in each crosspoint is a switch that determines the path from a processor
to a memory module.
3
• Adv.:
• Supports simultaneous transfers from all memory modules
• Disadv.:
• The hardware required to implement the switch can become quite large and
complex.
• Below fig. shows the functional design of a crossbar switch connected to one memory
module.

Multistage Switching Network

• The basic component of a multistage network is a two-input, two-output interchange


switch as shown in Fig. below.

4
• Using the 2x2 switch as a building block, it is possible to build a multistage network to
control the communication between a number of sources and destinations.
• To see how this is done, consider the binary tree shown in Fig. below.
• Certain request patterns cannot be satisfied simultaneously. i.e., if P1 → 000~011,
then P2 → 100~111

• Some request patterns cannot be connected simultaneously. i.e., any two sources cannot
be connected simultaneously to destination 000 and 001
• In a tightly coupled multiprocessor system, the source is a processor and the destination
is a memory module.
• Set up the path → transfer the address into memory à transfer the data
• In a loosely coupled multiprocessor system, both the source and destination are
processing elements.

FLYNN'S CLASSIFICATION

In 1966, Michael Flynn proposed a classification for computer architectures based on the
number of instruction steams and data streams (Flynn’s Taxonomy).
➢ Flynn uses the stream concept for describing a machine's structure.
➢ A stream simply means a sequence of items (data or instructions).
➢ The classification of computer architectures based on the number of instruction
steams and data streams (Flynn’s Taxonomy).

5
Flynn’s Taxonomy

➢ SISD: Single instruction single data


o Classical von Neumann architecture
➢ SIMD: Single instruction multiple data
➢ MISD: Multiple instructions single data
o Non existent, just listed for completeness
➢ MIMD: Multiple instructions multiple data
Most common and general parallel machine
SISD

➢ SISD (Singe-Instruction stream, Singe-Data stream)


➢ SISD corresponds to the traditional mono-processor ( von Neumann computer). A single
data stream is being processed by one instruction stream
A single-processor computer (uni-processor) in which a single stream of instructions is generated
from the program.

SIMD

➢ SIMD (Single-Instruction stream, Multiple-Data streams)


➢ Each instruction is executed on a different set of data by different processors i.e multiple
processing units of the same type process on multiple-data streams.
➢ This group is dedicated to array processing machines.
➢ Sometimes, vector processors can also be seen as a part of this group.

MISD

➢ MISD (Multiple-Instruction streams, Singe-Data stream)


➢ Each processor executes a different sequence of instructions.
➢ In case of MISD computers, multiple processing units operate on one single-data stream .
➢ In practice, this kind of organization has never been used

MIMD

➢ MIMD (Multiple-Instruction streams, Multiple-Data streams)

6
➢ Each processor has a separate program.
➢ An instruction stream is generated from each program.
➢ Each instruction operates on different data.
This last machine type builds the group for the traditional multi-processors. Several processing
units operate on multiple-data streams

You might also like