Block-cyclic distribution of arrays is highly relevant to parallel computing, as it allows for good load balancing coupled with a significant reduction in inter-process communication. In order to make optimal use of parallelism, redistributing between block-cyclic distributions is of great importance. This thesis presents several algorithms from the related literature for efficiently performing such redistributions. In doing so, we consider the optimization of both the computation of the message contents and the scheduling of communication between processors. Methods for handling multi-dimensional arrays as well as different source and target processor sets are also discussed. Furthermore, the results of the papers are used to compare the performance of the algorithms. We conclude that some algorithms can result in a several fold reduction in redistribution time.