Fractal　video　compression　is　a　relatively　new　video　compression　method.　Its　attraction　is　due　to　the　high　compression　ratio　and　the　simple　decompression　algorithm.　But　its　computational　complexity　is　high　and　as　a　result　parallel　algorithms　on　high　performance　machines　become　one　way　out.　In　this　study　we　partition　the　matching　search,　which　occupies　the　majority　of　the　work　in　a　fractal　video　compression　process,　into　small　tasks　and　implement　them　in　two　distributed　computing　environments,　one　using　DCOM　and　the　other　using　.NET　Remoting　technology,　based　on　a　local　area　network　consists　of　loosely　coupled　PCs.　Experimental　results　show　that　the　parallel　algorithm　is　able　to　achieve　a　high　speedup　in　these　distributed　environments.　©　2005　Elsevier　Inc.　All　rights　reserved.