Scribd
Upload
18 views

Multiprocessing

Parallel processing involves using multiple processors simultaneously to reduce the time needed to complete tasks. Multiprocessors can execute multiple programs or operations at once. There are two main types of parallel processing architectures: shared memory and distributed memory. Shared memory architectures connect all processors to a central memory, while distributed memory architectures give each processor its own local memory and tasks must communicate by passing messages.

Uploaded by

Surbhi Yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views

Multiprocessing

Parallel processing involves using multiple processors simultaneously to reduce the time needed to complete tasks. Multiprocessors can execute multiple programs or operations at once. There are two main types of parallel processing architectures: shared memory and distributed memory. Shared memory architectures connect all processors to a central memory, while distributed memory architectures give each processor its own local memory and tasks must communicate by passing messages.

Uploaded by

Surbhi Yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Parallel processing in

multiprocessor

Abhishek Ahlawat
MCA/25017/22
What is parallel processing
and multiprocessor?
Parallel processing is a method in computing of running two or more processors (CPUs)
to handle separate parts of an overall task. Breaking up different parts of a task among
multiple processors will help reduce the amount of time to run a program.
The primary purpose of parallel processing is to enhance the computer processing
capability and increase its throughput, i.e. the amount of processing that can be
accomplished during a given interval of time.
Multiprocessor is a data processing system that can execute more than one program or
more than one arithmetic operation simultaneously.
Types of parallel processors
Multiple instruction multiple
data (MIMD)
• multiple instruction, multiple data (MIMD) is a technique employed to achieve
parallelism.
• Each processor must include its own control unit that will assign to the processors
parts of a task or a separate task.
• It has two sub classes :
1. Shared memory
2. Distributed memory
Shared memory
• In shared memory model the processors are all connected to a
"globally available" memory, via either software or hardware means.
• The operating system usually maintains its memory coherence.
• Shared memory machines may be of the bus-based, extended,
or hierarchical type.
Bus based
MIMD machines with shared memory have processors which share a common,
central memory. In the simplest form, all processors are attached to a bus
which connects them to memory. This means that every machine with shared
memory shares a specific CM, common bus system for all the clients.

For example, if we consider a bus with clients A, B, C connected on one side


and P, Q, R connected on the opposite side, any one of the clients will
communicate with the other by means of the bus interface between them.
Hierarchical based
MIMD machines with hierarchical shared memory use a hierarchy of buses to
give processors access to each other's memory. Processors on different boards
may communicate through inter-nodal buses. Buses support communication
between boards. With this type of architecture, the machine may support over
nine thousand processors.
Distributed memory
• In distributed memory MIMD( multiple instruction, multiple data) machines,
each processor has its own individual memory location.
• Each processor has no direct knowledge about other processor's memory.
•  For data to be shared, it must be passed from one processor to another as a
message. 
• This type of design can be inefficient because of the added time required to
pass a message from one processor to another along the message path.
• It is not economically feasible to connect a large number of processors
directly to each other.
• Distributed memory machines may have hypercube or mesh interconnection
schemes.
Hypercube interconnection network
In an MIMD distributed memory machine with a hypercube system
interconnection network containing four processors, a processor and a
memory module are placed at each vertex of a square. The diameter of
the system is the minimum number of steps it takes for one processor
to send a message to the processor that is the farthest away.
For example, the diameter of a 2-cube is 2. In a hypercube system with
eight processors . and each processor and memory module being placed
in the vertex of a cube, the diameter is 3.
In general, a system that contains 2n processors with each processor
directly connected to N other processors.
Mesh interconnection network
• In an MIMD distributed memory machine with a mesh interconnection network,
processors are placed in a two-dimensional grid.
• Each processor is connected to its four immediate neighbors.
• Wrap around connections may be provided at the edges of the mesh. 
• One advantage of the mesh interconnection network over the hypercube is that
the mesh system need not be configured in powers of two. 
• A disadvantage is that the diameter of the mesh network is greater than the
hypercube for systems with more than four processors.

You might also like