Your SlideShare is downloading. ×
0
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Parallel computing
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Parallel computing

3,570

Published on

Parallel computing: Calculating simultaneously...

Parallel computing: Calculating simultaneously...

Published in: Education, Technology
0 Comments
6 Likes
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
3,570
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
0
Comments
0
Likes
6
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. PARALLEL COMPUTINGEr. Anupama Singh Pr esented By-Department of Vinay Kumar GuptaComputer Science & Engg. 0700410088, 8th sem. Computer Science & Engg. FET RBS COLLEGE, AGRA
  • 2. What is Parallel Computing ? Traditionally, software has been written for serial computation: 1. To be run on a single computer having a single Central Processing Unit (CPU); 2. A problem is broken into a discrete series of instructions. 3. Instructions are executed one after another. 4. Only one instruction may execute at any moment in time.
  • 3. SERIAL PROBLEM….
  • 4. Parallel computing… Parallel computing is a form of computation in which many calculations are carried out simultaneously. In the simplest sense, it is the simultaneous use of multiple compute resources to solve a computational problem: 1.To be run using multiple CPUs 2.A problem is broken into discrete parts that can be solved concurrently 3.Each part is further broken down to a series of instructions 4.Instructions from each part execute simultaneously on different CPUs
  • 5. PARALLEL PROBLEM….
  • 6. Why Use Parallel Computing? Main Reasons:  Save time and/or money;  Solve larger problems: e.g.- Web search engines/databases processing millions of transactions per second.  Provide concurrency;  Use of non-local resources:  Limits to serial computing: o Transmission speeds - the speed of a serial computer is directly dependent upon how fast data can move through hardware, transmission limit of copper wire (9 cm/nanosecond) o Limits to miniaturization o Economic limitations - it is increasingly expensive to make a single processor faster
  • 7. Why Use ParallelComputing ?... Current computer architectures are increasingly relying upon hardware level parallelism to improve performance:  Multiple execution units  Pipelined instructions  Multi-core
  • 8. Architecture Concepts… von Neumann Architecture Comprised of four main components: Memory Control Unit Arithmetic Logic Unit Input / Output
  • 9. Architecture Concepts (contd.)…• Memory is used to store both program instructions anddata •Program instructions are coded data which tell the computer to do something •Data is simply information to be used by the program•Control unit fetches instructions/data from memory,decodes the instructions and then sequentially coordinatesoperations to accomplish the programmed task.•Aritmetic Unit performs basic arithmetic operations•Input / Output is the interface to the human operator
  • 10. Concepts (contd.)… Flynns Classical Taxonomy
  • 11. Single Instruction, Single Data (SISD):  A serial (non-parallel) computer Single instruction:  only one instruction stream is being acted on by the CPU during any one clock cycle Single data:  only one data stream is being used as input during any one clock cycle  Deterministic execution
  • 12. Single Instruction, Multiple Data (SIMD): A type of parallel computer Single instruction: All processing units execute the same instruction at any given clock cycle Multiple data: Each processing unit can operate on a different data element Best suited for specialized problems characterized by a high degree of regularity, such as graphics/image processing. Two varieties: Processor Arrays and Vector Pipelines
  • 13. Multiple Instruction, Single Data (MISD): A single data stream is fed into multiple processing units. Each processing unit operates on the data independently via independent instruction streams. Some conceivable uses might be:  multiple frequency filters operating on a single signal stream  multiple cryptography algorithms attempting to crack a single coded message.
  • 14. Multiple Instruction, Multiple Data (MIMD): Multiple Instruction: every processor may be executing a different instruction stream Multiple Data: every processor may be working with a different data stream Execution can be synchronous or asynchronous, deterministic or non- deterministic
  • 15. Parallel Computer Memory Architectures: Shared Memory  Uniform Memory Access (UMA):  Non-Uniform Memory Access (NUMA): Distributed Memory Hybrid Distributed-Shared Memory
  • 16. Shared Memory : General Characteristics:  Shared memory parallel computers vary widely, but generally have in common the ability for all processors to access all memory as global address space.  Multiple processors can operate independently but share the same memory resources.  Changes in a memory location effected by one processor are visible to all other processors.  Shared memory machines can be divided into two main classes based upon memory access times: UMA and NUMA. Shared Memory (UMA)
  • 17. Shared Memory : UMA Uniform Memory Access (UMA):  Identical processors, Symmetric Multiprocessor (SMP)  Equal access and access times to memory  Sometimes called CC-UMA - Cache Coherent UMA. Cache coherent means if one processor updates a location in shared memory, all the other processors know about the update. Cache coherency is accomplished at the hardware level.
  • 18. Shared Memory : NUMA Non-Uniform Memory Access (NUMA):  Often made by physically linking two or more SMPs  One SMP can directly access memory of another SMP  Not all processors have equal access time to all memories  Memory access across link is slower  If cache coherency is maintained, then may also be called CC-NUMA - Cache Coherent NUMA
  • 19. Distributed Memory : General Characteristics:  Distributed memory systems require a communication network to connect inter-processor memory. Processors have their own local memory. Because each processor has its own local memory, it operates independently. Hence, the concept of cache coherency does not apply. When a processor needs access to data in another processor, it is usually the task of the programmer to explicitly define how and when data is communicated. Synchronization between tasks is likewise the programmers responsibility.
  • 20. Hybrid Distributed-Shared Memory: The largest and fastest computers in the world today employ both shared and distributed memory architectures. The shared memory component is usually a cache coherent SMP machine. Processors on a given SMP can address that machines memory as global. The distributed memory component is the networking of multiple SMPs. SMPs know only about their own memory - not the memory on another SMP. Therefore, network communications are required to move data from one SMP to another.
  • 21. QUERIES…??? 
  • 22. THANK YOU…!!! 

×