Changes between Initial Version and Version 1 of Workshops/IntroToHpc2015/Programming/SpeedupScaling

Oct 12, 2015 4:01:15 PM (6 years ago)


  • Workshops/IntroToHpc2015/Programming/SpeedupScaling

    v1 v1  
     2= Parallel Computing =
     3==  Moore's law ==
     4[[Image(Moores_law_(1970-2011).png, 25%)]]
     6* 2X transistors/Chip Every 1.5 years Called “Moore’s Law”
     7* Microprocessors have become smaller, denser, and more powerful.
     9-- Gordon Moore (co-founder of Intel) predicted in 1965 that the transistor density of semiconductor chips would double roughly every 18 months. --
     12== Multi-tasks ==
     13* In computing, multitasking is a method where multiple tasks, also known as processes, are performed during the same period of time.
     14* The tasks share common processing resources, such as a CPU and main memory.
     15* In the case of a computer with a single CPU, only one task runs at any point in time.
     16* Multitasking solves the problem by scheduling which task may run at any given time, and when another waiting task gets a turn.
     17* When task switches occur frequently enough the illusion of parallelism is achieved.
     19== Multi-core ==
     20Now all computer has multi-core
     24A multi-core processor is a single computing component with two or more independent actual central processing units (called "cores"), which are the units that read and execute program instructions.
     25The multiple cores can run multiple instructions at the same time, increasing overall speed for programs amenable to parallel computing.
     28== Co-Processors ==
     29A coprocessor is a computer processor used to supplement the functions of the primary processor (the CPU). Operations performed by the coprocessor may be floating point arithmetic, graphics, signal processing, string processing, encryption or I/O Interfacing with peripheral devices. By offloading processor-intensive tasks from the main processor, coprocessors can accelerate system performance.
     33=== GPU ===
     34A graphics processing unit (GPU), also occasionally called visual processing unit (VPU), is a specialized electronic circuit designed to rapidly manipulate and alter memory to accelerate the creation of images in a frame buffer intended for output to a display. GPUs are used in embedded systems, mobile phones, personal computers, workstations, and game consoles. Modern GPUs are very efficient at manipulating computer graphics, and their highly parallel structure makes them more effective than general-purpose CPUs for algorithms where processing of large blocks of data is done in parallel. In a personal computer, a GPU can be present on a video card, or it can be on the motherboard.
     36[[Image(gpu-computing-feature.jpg, 25%)]]
     38==== GPU computing ====
     39GPU-accelerated computing is the use of a graphics processing unit (GPU) together with a CPU to accelerate scientific, engineering, and enterprise applications.
     42===  Intel Xeon Phi ===
     43Intel Many Integrated Core Architecture or Intel MIC is a coprocessor computer architecture developed by Intel, the Teraflops Research Chip multicore chip research project, and the Intel Single-chip Cloud Computer multicore microprocessor.
     45[[Image(6-18-201intelxeonphipciecard.jpg, 25%)]]
     49== Speedup Factor ==
     53* Suppose you have a code that takes Ts seconds to run on one processor.
     54* You find there are parallelizable sections in the code. But for the other sections, it still needs to run on a single processor. (For OpenMP)
     55* For MPI codes, the processes run in parallel from the beginning, but there must be some parts where all processes do same things.
     56   * Those parts are considered as serial sections.
     57* The time ratio of the serial section to the total is F, so time for the serial section is F Ts and the parallelizable section is (1-f) Ts.
     58* If you use N processors, the time for the parallelizable section can be reduced to (1-f) Ts/N.
     59* Here the Speedup factor is defined as
     61S(N)=(computing time on a single processor)/(computing time on multiple processors) = Ts/[F Ts+(1-f)Ts/N] = N/(1+(N-1)F)
     64This is the Amdahl's Law.
     68== Overhead time ==
     69* Since some extra procedures are required for parallelization, there are overheads of each parallel process.
     70* For MPI codes, the communication between processes is a major overhead.
     71   * We can reduce this negative impact by overlapping communication with computations.
     72* For OpenMP, there are overhead time at the fork and join threads.