The paper presents an overview of our recent research of parallel algorithm mapping. We consider the mapping of irregularly structured algorithms in VLSI processor arrays. Although architectural improvements may contribute to the mapping efficiency, the area of mapping techniques is a more likely source for improvements. Therefore, we discussed the following topics: optimization of mappings with simulated annealing, introduction of problem-specific knowledge into optimization, parallelization of the optimization technique, and fault tolerant mapping.