An Efficient File Locking Algorithm for Multi-processor Systems Using Round Robin Delegation Method

摘要

The adaptability of parallel processes is regularly limited by the execution of critical section. Effective management of locking algorithms shows significant changes in performance. Round robin delegation algorithm can be used to assign lock to boost performance. In this algorithm when more than one process requires a same file then each process is given a specific time for which it holds the lock on that file. All other threads delegate the work to the current working thread and continue its execution. The working thread after completing its execution, checks if it still has time to do the work delegated to it. If so the working thread will take the work and after execution it will send back the results to the other threads. Proceeding with execution instead of waiting for the critical sections leads to increased parallelism and better versatility. Delegation reduces the overhead of acquiring locks, releasing locks.