A Novel Approach to Allow Process into Critical Section with no delay-time

This paper proposes a new idea which makes the processes not
to wait for a long time to enter into a critical section to access
a data structure which is already assigned to the other process
and that process enters into critical section. Till date so many
approaches and algorithms are proposed to reduce the delay
time between the successive executions of the critical section,
but no one proposed how to assign the data structure to all
the process who are requesting for the data structure. In this
paper the idea we are proposing is to create an instance of the
data structure before assigning to the process and allow each
and every process into critical section to avoid the delay time
permanently. The proposed algorithm every time creates an
instance of the data structure before assigning to the requested
process and simultaneously it checks for the instance released
by the process already assigned instanced data structure. If
when a new process is requesting for the data structure and at
the same time already assigned process releases the instance
then the coordinator will do both creation and deletion of the
instance.