Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Mesh Algorithms in Parallel Processing
Post: #1

Mesh Algorithms in Parallel Processing

¢ Parallel processing is processing a task with several processing units, or many processors

¢ Most powerful computers contain two or more processing units that share among themselves the jobs submitted for processing

¢ Several operations are performed simultaneously, so the time taken by a computation can be reduced.

¢ A problem to be solved is broken into a no.of subproblems. These subproblems are now solved simultaneously, each on different processors. The results are then combined to produce an answer to the original problem.

¢ To achieve speedup of processing

¢ speedup =ws/wp where ws=worst case running time of fastest known sequential algorithm for the problem and wp= worst case running time of the parallel algorithm for the same problem.

Pipelines have been extensively used in processors to increase the performance

¢ The stream of instruction tells the computer what to do at each step and are divided into four types:
Single Instruction stream, single Data stream (SISD)
Multiple Instruction stream, Single Data stream(MISD)
Single Instruction stream, Multiple Data stream(SIMD)
Multiple Instruction stream, Multiple Data stream(MIMD)
A mesh is an a x b grid in which there is a processor at each grid point.
Each processor of the mesh can be labeled with a tuple (i,j),where 1 £ i £ a and 1 £ j £ b.
Each processor of the mesh has a RAM with some local memory.
Each processor can perform any of the basic operations such as addition, subtraction, multiplication, comparison, and so on, in one unit of time.

Packet Routing

¢ A single step of interprocessor communication in a fixed connection network is called packet routing.

¢ Each processor in the network has a packet of information that has to be sent to some other processor

¢ The bandwidth of any communication channel is limited, it becomes necessary to impose the restriction that at most one packet pass through the channel at a time.

¢ A packet routing algorithm is judged by its run time, that is, the time taken by the last packet to reach its destination and the maximum number of packets any processor has to store during routing.

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Tagged Pages: seminar topic on mesh algorithm,
Popular Searches: algorithms, small mesh, algorithms by sanjoy dasgupta, seminar for compressive algorithms, trends towards parallel processing ppt, parallel processing indian contributions, seminar on heuristic algorithms,

Quick Reply
Type your reply to this message here.

Image Verification
Image Verification
(case insensitive)
Please enter the text within the image on the left in to the text box below. This process is used to prevent automated posts.

Possibly Related Threads...
Thread: Author Replies: Views: Last Post
  Wavelet Video Processing Technology computer science crazy 8 6,779 05-03-2015 02:30 PM
Last Post: Guest
  Space Time Adaptive Processing computer science crazy 4 4,243 04-03-2014 07:03 PM
Last Post: Guest
  Design of 2-D Filters using a Parallel Processor Architecture computer science crazy 3 2,995 18-02-2012 10:36 AM
Last Post: seminar paper
  effect of tower displacement of two parallel transmission lines on magnetic field seminarsense 0 969 01-12-2010 11:52 AM
Last Post: seminarsense
  Analysis of parallel operation of converters with interphase transformer Wifi 0 1,313 23-10-2010 10:26 AM
Last Post: Wifi
Last Post: seminar topics
  Adaptive Blind Noise Suppression in some Speech Processing Applications computer science crazy 0 1,731 21-09-2008 11:36 AM
Last Post: computer science crazy
  Digital Light Processing computer science crazy 0 1,681 21-09-2008 10:43 AM
Last Post: computer science crazy