Indexed by:
Abstract:
Fractal video compression attracts researchers' attention as it can achieve a high compression ratio and it has a simple decompression algorithm. Its computing complexity is very high and most researchers implement parallel algorithms in high performance machines. In our study, we partition the match search which takes on major work in fractal video compression into small tasks and implement them in two distributed computing environments, one based on DCOM and the other based on .NET Remoting. Experimental results show that the parallel algorithm can achieve a high speedup in these distributed environments.
Keyword:
Reprint 's Address:
Email:
Source :
DCABES and ICPACE Joint Conference on Distributed Algorithms for Science and Engineering
Year: 2005
Page: 147-150
Language: English
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 2
Affiliated Colleges: