Title: Parallel Image Processing
1???? ?????? ??????
2???? ??????
- ????? ????? ??????
- Parallel Image Processing
3???????? ???
- ?? ????? ???? ??????!!!
- ?????? ????? ?? ??????? ??? ?????!!!
4???? ??????????
- ?????? 1-10
- ????? ??' 12, ??? ?', 7/12/2001
- ?????? 11-20
- ????? ??' 13, ??? ?', 14/1/2002
- ?????? 11-?????
- ????? ??' 14, ??? ?', 21/1/2002
5???? ??????????
- ???? Power-Point ?? 10 ????
- ?? ???? ????? ?????? ?????
- ?? ???? ????? ?????? (???????) ?? ????? ?? ?????
????????????? ????? - ??????? ???????? ?? ?????? (speedup, efficiency,
comp/comm, etc)
6??? ????
- ?? ?????? ????
- ???? ????? Email
- ???? ????? ??? ???? ?'
- ?????? ?????? ?????? ????? ???? ?' ??? ????
?????? ???? ???-??. ????? ??? ?? ????? ?????
????? (???? ????? ?? ?????? ????).
7?????? ????? ??? ??' 3
- ?? ????? ?? ??? ??? ??? (?????)
- ??? ????? ?? ?????? ???? FORTRAN ??? ???? C.
8????? ????? ??????
- ???? ????? PDF
- ??? 10 ????? ?? WilkinsonAllen
9????? ????
- Basic Low Level Preprocessing
- Threshold
- Contrast Stretching
- Histograms
- Smoothing
- Sharpening
- Noise Reduction
10????? ????
- Edge Detection Using Masks
- Sobel
- Laplace
- Hough Transform
- Discrete Fourier Transform and
- Fast Fourier Transform
11FFTW
- FFT in the West www.fftw.org
12MOSIX
www.mosix.org
13MOSIX
MOSIX is an extension of the Linux kernel to
support scalable cluster computing. The extended
kernel allows any size cluster of Pentium/AMD
based workstations and servers to work
cooperatively as if part of a single system.
14MOSIX
To run in a MOSIX cluster, there is no need to
modify or to link applications with any library,
or even to assign processes to different nodes.
MOSIX does it automatically - just "fork and
forget", like in an SMP. For example, you can
create many processes in your (login) node and
let MOSIX assign these processes to other nodes.
If you type "ps", then you will see all your
processes, as if they run in your node.
15MOSIX
The core of MOSIX are adaptive management
algorithms that monitor and respond to uneven
resource distribution among the nodes. These
algorithms use preemptive process migration to
assign and reassign processes among the nodes, to
continuously take advantage of the best available
resources. The MOSIX algorithms are geared for
maximal overall performance, overhead-free
scalability and ease-of-use.
16???????? ?????
- ????? ??? 2 ?????? ?????-??? 3 ?????? ?????
???????? - ????? ?????? ???? ??????? ?????
- Shared Memory, Searching and Optimization, How to
Build a Beowulf, Grid Computing. - Course Summary