Process migration has been advocated as a means of improving the load balancing and reliability of distributed systems. This paper reviews the major design issues for process migration algorithms, such as the amount of state information to be transferred and times at which information should be transferred. This examination demonstrates the existence of a process migration algorithm which has not previously been documented. After describing existing algorithms, the new algorithm is given and compared to the other algorithms. The new algorithm promises better load balancing results while avoiding residual dependencies