Scribd
Upload
9 views12 pages

Unit VI

Uploaded by

magdumaastha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views12 pages

Unit VI

Uploaded by

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

Unit VI

Introduction to Computational Model – PRAM

By – Prof. Amrapali Babar


Introduction
 What is PRAM:-
• Theoretical model for parallel computing.
• Framework for analyzing parallel algorithms.
• Focuses on shared memory and simultaneous execution.
 Parallel Algorithm : A parallel algorithm is an algorithm that can
execute several instructions simultaneously on different processing
devices and then combine all the individual outputs to produce the
final result.
 Parallel computing refers to the process of breaking down larger
problems into smaller, independent, often similar parts that can be
executed simultaneously by multiple processors communicating via
shared memory, the results of which are combined upon completion
as part of an overall algorithm.
 Parallel Random Access Machines (PRAM) is a model, which is
considered for most of the parallel algorithms.
PRAM Model :-
A PRAM model contains −
• A set of similar type of processors.
• All the processors share a common memory unit. Processors can
communicate among themselves through the shared memory only.
• A memory access unit (MAU) connects the processors with the single
shared memory.
Problem - n number of processors can perform independent
operations on n number of data in a particular unit of time. This may
result in simultaneous access of same memory location by different
processors.
Models of PRAM
• EREW: also called Exclusive Read is a constraint that doesn’t allow two
processors to read or write from the same memory location at the same
instance.
• CREW: also called Concurrent Read Exclusive Write is a constraint that
allows all the processors to read from the same memory location but are
not allowed to write into the same memory location at the same time.
• ERCW: also called Exclusive Read Concurrent Write is a constraint that
allows all the processors to write to the same memory location but are
now allowed to read the same memory location at the same time.
• CRCW: also called Concurrent Read Concurrent Write is a constraint that
allows all the processors to read from and write to the same memory
location parallelly.
Key Features of PRAM

• Parallelism:
• Multiple processors operate simultaneously.
• Shared Memory:
• All processors access a common memory space.
• Random Access:
• Constant time access to any memory location.
Fundamental Techniques and Algorithms
MESH
• Basics of mesh Algorithm
• Definition – The Mesh Algorithm is a computational method used in
network topology analysis to determine the shortest path between
nodes.
• Applications – It finds it applications in computer networks,
transportation systems and circuit designs.
• Advantages – The mesh algorithm offers efficient path finding, fault
tolerance and scalability.
• Fault tolerance is the ability of a system to keep operating when one
or more of its components fail.
path between two desired nodes inthe ne
Steps of Mesh Algorithm
• Step 1: Create a Mesh Network
Establish a network of interconnected nodes representing the
system under analysis.

• Step 2: Assign Weights to the Connections


Assign weights to the connections between the nodes based on
the characteristics of the system.

• Step 3 : Determine the shortest path


Apply the mesh algorithm to find the shortest path between two
desired nodes in network.
Advancements in Mesh Algorithm
• Dynamic Mesh Algorithm –
This approach allows for real-time updates in the network,
adapting to changing conditions.
• Parallelized Mesh Algorithm-
Utilizing concurrent processing, this variant improves the
algorithm's performance on large-scale networks.
• Hybrid Mesh Algorithm-
A combination of different algorithmic techniques to achieve
optimized routing for complex systems.
Benefits of Mesh Algorithm
• Increased Network Reliability
The Mesh Algorithm enhances network resilience by providing multiple
alternative routes.

• Efficient Resource Utilization


By optimizing the path selection, the Mesh Algorithm minimizes latency
and maximizes throughput.

• Scalability and Flexibility


The algorithm can easily adapt to network expansions and changes
without compromising performance.
Limitations of Mesh Algorithm
• Complexity
The Mesh Algorithm involves intricate calculations and can have
high computational requirements.
• Increased Overhead
With a larger number of nodes and connections ,maintaining a
mesh network may introduce additional overhead.
• Resource consumption
In certain cases , the mesh algorithm may consume significant
computational resources , limiting to its feasibility.
Real-world Examples
• Internet of things ( IoT) – Mesh algorithm plays a vital role in enabling
communication and data exchange between IoT devices.
• Transportation Systems –
• The mesh algorithm assists in optimizing traffic routes and ensures
efficient transportation management.
• Wireless communication – Mesh networks are used to create reliable
and adaptable wireless communication infrastructures.

You might also like