In this paper parallel algorithms for fractal image compression on MIMD architectures are introduced, classified, and discussed. The crucial point for the choice of a suitable parallelization strategy is the memory capacity of a processor element of the target architecture, therefore the classification follows the memory demand of the algorithms. We present experimental results of all main-representatives of the different algorithm classes. The results show a decreasing speedup for increasing memory demand for most of the proposed algorithms.