Using preemptive access to the critical section in shared memory environment to minimize the execution time of the fork-join structure

Under a shared memory environment, processes in a parallel structure communicate with one another by shared variables. Since no two processes should access shared variables simultaneously, they should be placed in the critical section to guarantee mutually exclusive access. The problem is how to order processes competing to access the critical section with the aim of minimizing the time spent to execute these processes. Previously, a heuristic algorithm scheduled these processes without allowing preemption in accessing the critical section. We present another heuristic algorithm with the preemption approach to improve previous results