Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Klaftenegger, D., Sagonas, K., Winblad, K.: Queue delegation locking. In: IEEE Transactions on Parallel and Distributed Systems, vol. 29, no. 3 (2018)
Anderson, T.E.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1(1), 6–16 (1990)
Mellor-Crummey, J.M., Scott, M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9(1), 21–65 (1991)
Craig, T.S.: Building FIFO and priority-queuing spin locks from atomic swap. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.7889
Dice, D., Marathe, V.J., Shavit, N.: Flat-combining NUMA locks. In: Proceeding 23rd ACM symposium Parallelism Algorithms Architecture (2011)
Lozi, J.-P., David, S., Thomas, G., Lawall, J., Muller, G.: Fast and portable locking for multicore architectures. ACM Trans. Comput. Syst. 33(4), 13:1–13:62 (2016)
Oyama, Y., Taura, K., Yonezawa, A.: Executing parallel programs with synchronization bottlenecks efficiently. In: Proceedings of the International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications, pp. 182–201 (1991)
Suleman, M.A., Mutlu, O., Qureshi, M.K., Patt, Y.N.: Accelerating critical section execution with asymmetric multicore architectures. In: Proceedings of the 14th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 253–264 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Paul, S., Abraham, J.P. (2020). An Efficient File Locking Algorithm for Multi-processor Systems Using Round Robin Delegation Method. In: Singh, P., Panigrahi, B., Suryadevara, N., Sharma, S., Singh, A. (eds) Proceedings of ICETIT 2019. Lecture Notes in Electrical Engineering, vol 605. Springer, Cham. https://doi.org/10.1007/978-3-030-30577-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-30577-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30576-5
Online ISBN: 978-3-030-30577-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)