Fractal　image　compression　algorithm　has　some　problems,　such　as　high　computational　complexity　and　long　time　consumption.　In　this　paper　the　parallel　implementation　of　fractal　image　compression　algorithm　in　Web　service　environment　is　discussed.　The　experiments　show　this　algorithm　can　greatly　reduce　the　compression　time　and　achieve　a　high　speedup　at　the　same　quality　of　decompressed　image.　The　proposed　algorithm　can　achieve　the　speedup　of　about　500　times　with　a　little　loss　of　lenna　image＇s　PSNR　and　two　node　computers　against　fractal　full　search　algorithm.　©　2011　IEEE.