Professional Documents
Culture Documents
Pemrosesan Parale2l
Pemrosesan Parale2l
Kudang B. Seminar
Peramalan cuaca
Aerodinamik
Kercerdasan buatan: robotik
Rekayasa genetik
Performance: Weather
Prediction
Computational requirement: 1015
Serial supercomputer: 109 instr/sec
Total serial time: 106 sec = 280 hours
Not too good for 48 hour weather
prediction
More workstations:
finer grid
better accuracy
Other Challenging
Applications
Satellite data acquisition: billions of bits / sec
Satellite data processing
Pollution levels, Remote sensing of materials
Image recognition
Material modeling
Nuclear weapons modeling (ASCI)
Airplane/Satellite/Vehicle design
Application Specific
Architectures
Mapping an algorithm directly onto hardware
ASICS cont
How much faster than General purpose?
Example: 1D 1024 FFT
General purpose machine (G4): 25 micro secs
ASIC device (MIT Lincoln Labs): 32 nano secs
ASIC device uses 20 milliwatts (100 * less power)
Future designs:
Contoh Nyata
Peramalan cuaca 24 jam di UK melibatkan sekitar 1012
SOLUSI: mendayagunakan
paralelisme
Motivation of Parallel
Computing
Parallel Computing is cost effective
Sequential vs Parallel
Algorithms
Efficient Parallel Algorithms
Maximize parallelism
Minimize synchronization, remote accesses
Efficiency is Architecture Dependent
Speedup
Ideal: n processors n fold speed up
Parallel Programming
Parallel Programming Paradigms
Super compilers
20 years of parallelizing compilers and what do we get?
..not much: we understand loops (a bit)
Multithreading
Pthreads, Solaris threads, not much difference
Message Passing
MPI rules, ..well, there is PVM (parallel virtual machine)
Data parallel programming
Niche work, but important
3 x lebih
cepat
dari
Klasifikasi Mesin
Models of Computation ( Flynn
Paralel
1966 )
1. Single Instruction Stream, Single Data Stream : SISD.
2. Multiple Instruction Stream, Single Data Stream : MISD.
3. Single Instruction Stream, Multiple Data Stream : SIMD.
4. Multiple Instruction Stream, Multiple Data Stream :
MIMD.
5. Single Program Multiple Data: SPMD.
SISD Computers
Untuk operasi a1 + a2 + a3 + + an
memerlukan sebanyak n akses ke
memori oleh prosesor dan sebanyak n-1
operasi penjumlahan. Jadi kompleksitas
waktu operasi adalah O(n).
MISD Computers
N prosesor yang memiliki unit kontrol pribadi, berbagi guna
memori bersama (shared memori).
SIMD Computers
MIMD Computers
SPMD Computers