Synchronization techniques are proposed f o r algorithms which spawn processes remotely o n loosely coupled processors based o n run-time characteristics. T h e performance of the proposed synchronization schemesare measured o n the iPSC/2 and S N A P -1 multiprocessors and their implementation cost is discussed. Results show that processes created dynamically throughout a distributed system can be synchronized at comparable overhead and cost to that required f o r fixedlocation process creation.