Abstract: The mapping of loop algorithms into systolic arrays is discussed. The mapping procedure is based on the mathematical transformations of index sets and data dependence vectors. Necessary and sufficient conditions for the existence of valid transformations are given for algorithms with constant data dependences. The mapping procedure of calculating all pair shortest paths is given.