An Adoption Synchronization Algorithm

This paper presents several issues for the integration of concurrency in an object-oriented language to support fin-grain parallel algorithms. An adoption synchronization algorithm is implemented based on synchronizing actions to avoid the starvation and deadlock problems. This added two fixed consistency points (one is used before starting and the other after finishing) to accomplish the run time intervals. A new synchronization mechanism was proposed having the ability to be applied in many synchronization problems, for instance, the dinning Philosophers problem.