In the anatomy of Process Management[1], which is the fundamental functionality of operating system, for the execution of any process some resources are to be required to accomplished the task. Now the resources shared and unshared in nature. For unshared resources there will be no overhead, processes must wait for that resource, if it will allocate to some other process and when some other process released that resource, then it will be allocate to this one. But when if the resources will come under the category of shared resource , now here we faced some overhead , each processes have similar right to accomplish that resource in similar manner , here many processes conflicts , now a one main challenges comes into existence , and we required to synchronize that processes with respect to these resources.So we have already some code for process synchronization [1] which ensures the two main fundamental objectivity of process synchronization [1] are preserves, that is Mutual Exclusion and Progress, but all code, which would developed previously that were write for two processes for process synchronization, which called “The two process code method for Process Synchronization” and it’s also applied on any two processes at a time but not homogeneous manner. A two separate code would write for any two processes at a time which ensure Mutual Exclusion and Progress, but here we do this by using only one code, which guarantee to synchronize any processes and also preserves or ensures the two main fundamental objectivity of Process Synchronization[1] which is Mutual Exclusion and Progress.

Process Synchronization Process Synchronization code Process Synchronization using one Process code Process Synchronization mechanism in Operating System Improvised code for Process Synchronization.