Mesh Algorithms in Parallel Processing
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
computer science crazy
Super Moderator

Posts: 3,048
Joined: Dec 2008
17-04-2009, 08:16 PM

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.
Use Search at wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion

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

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  vl7101 vlsi signal processing jaseelati 0 226 11-12-2014, 02:01 PM
Last Post: jaseelati
  Digital Media Processing Report seminar projects maker 0 528 28-09-2013, 02:30 PM
Last Post: seminar projects maker
  Signal Processing and Modulation pdf seminar projects maker 0 459 21-09-2013, 04:31 PM
Last Post: seminar projects maker
  Biomedical Signal Processing PPT study tips 0 537 30-08-2013, 03:37 PM
Last Post: study tips
  PARALLEL INVERTER study tips 0 290 20-08-2013, 03:38 PM
Last Post: study tips
  ppt on Digital Signal Processing study tips 0 554 03-08-2013, 04:00 PM
Last Post: study tips
  WAVELET VIDEO PROCESSING TECHNOLOGY PPT study tips 0 707 02-07-2013, 02:51 PM
Last Post: study tips
  Statistical Signal Processing pdf study tips 0 362 17-06-2013, 01:01 PM
Last Post: study tips
  Advance Digital Signal Processing pdf study tips 0 325 08-05-2013, 04:37 PM
Last Post: study tips
  A Fast Resolving BiNMOS Synchronizer for Parallel Processor Interconnect pdf study tips 0 429 22-03-2013, 03:24 PM
Last Post: study tips