BibTex RIS Cite

Petri Net Model for Ricart and Agrawala’s Mutual Exclusion Algorithm

Year 2016, Volume: 6 Issue: 1, 16 - 21, 30.06.2016
https://doi.org/10.17678/beujst.89612

Abstract

Issues involved in mutual exclusion and background of mutual exclusion are discussed. A Ricart and Agrawala mutual exclusion algorithm is investigated. Simulation model of the system based on Petri Nets is described. Simulation results are presented and evaluated.

References

  • Baier, C.; Daum, M.; Engel, B.; Härtig, H.; Klein, J.; Klüppelholz, S.; ... & Völp, M. (2015). Locks: Picking key methods for a scalable quantitative analysis, Journal of Computer and System Sciences, Vol. 81, No. 1, 258-287.
  • Dijkstra, E. W. (1965). Solution of a problem in concurrent programming control, Communications of the ACM, Vol. 8, No. 9, 569.
  • Khanna, A.; Singh, A. K.; Swaroop, A. (2014). A leader-based k-local mutual exclusion algorithm using token for MANETs. Journal of Information Science And Engineering, Vol. 30, 1303-1319.
  • Knuth, D. E. (1966). Addition comments on a problem in concurrent programming control, Communications of the ACM, Vol. 9, No. 5, 321-322.
  • Kostin, A.; Ilushechkina, L. (2005). Winsim: a tool for performance evaluation of parallel and distributed systems, Proceedings of the International Conference on Advances in Information Systems, 312-321.
  • Lamport, L. (1974). A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, Vol. 17, No. 8, 453-455.
  • Lamport, L. (1977). Concurrent reading and writing, Communications of the ACM, Vol. 20, No. 11, 806-811.
  • Lamport, L. (1987). A fast mutual exclusion algorithm, ACM Transactions on Computer Systems, Vol. 5, No. 1, 1-11.
  • Mellor-Crummey, J. M.; Scott, M. L. (1991). Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Transactions on Computer Systems, Vol. 9, No. 1, 21-65.
  • Murata, T. (1989). Petri nets: Properties, analysis and applications. Proceedings of the IEEE, Vol. 77, No. 4, 541-580.
  • Peterson, G. L. (1981). Myths about the mutual exclusion problem, Information Processing Letters, Vol. 12, No. 3, 115-116.
  • Ricart, G., & Agrawala, A. K. (1981). An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, 24(1), 9-17.
  • Wang, J.; Wang, Z. (2014). Mutual Exclusion Algorithms in the Shared Queue Model, Proceedings of the International Conference on Distributed Computing and Networking, 29-43.
  • Wong, M., Ayguadé, E., Gottschlich, J., Luchangco, V., de Supinski, B. R., & Bihari, B. (2014). Towards Transactional Memory for OpenMP, Proceedings of the 10th International Workshop on OpenMP, 130-145.
Year 2016, Volume: 6 Issue: 1, 16 - 21, 30.06.2016
https://doi.org/10.17678/beujst.89612

Abstract

References

  • Baier, C.; Daum, M.; Engel, B.; Härtig, H.; Klein, J.; Klüppelholz, S.; ... & Völp, M. (2015). Locks: Picking key methods for a scalable quantitative analysis, Journal of Computer and System Sciences, Vol. 81, No. 1, 258-287.
  • Dijkstra, E. W. (1965). Solution of a problem in concurrent programming control, Communications of the ACM, Vol. 8, No. 9, 569.
  • Khanna, A.; Singh, A. K.; Swaroop, A. (2014). A leader-based k-local mutual exclusion algorithm using token for MANETs. Journal of Information Science And Engineering, Vol. 30, 1303-1319.
  • Knuth, D. E. (1966). Addition comments on a problem in concurrent programming control, Communications of the ACM, Vol. 9, No. 5, 321-322.
  • Kostin, A.; Ilushechkina, L. (2005). Winsim: a tool for performance evaluation of parallel and distributed systems, Proceedings of the International Conference on Advances in Information Systems, 312-321.
  • Lamport, L. (1974). A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, Vol. 17, No. 8, 453-455.
  • Lamport, L. (1977). Concurrent reading and writing, Communications of the ACM, Vol. 20, No. 11, 806-811.
  • Lamport, L. (1987). A fast mutual exclusion algorithm, ACM Transactions on Computer Systems, Vol. 5, No. 1, 1-11.
  • Mellor-Crummey, J. M.; Scott, M. L. (1991). Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Transactions on Computer Systems, Vol. 9, No. 1, 21-65.
  • Murata, T. (1989). Petri nets: Properties, analysis and applications. Proceedings of the IEEE, Vol. 77, No. 4, 541-580.
  • Peterson, G. L. (1981). Myths about the mutual exclusion problem, Information Processing Letters, Vol. 12, No. 3, 115-116.
  • Ricart, G., & Agrawala, A. K. (1981). An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, 24(1), 9-17.
  • Wang, J.; Wang, Z. (2014). Mutual Exclusion Algorithms in the Shared Queue Model, Proceedings of the International Conference on Distributed Computing and Networking, 29-43.
  • Wong, M., Ayguadé, E., Gottschlich, J., Luchangco, V., de Supinski, B. R., & Bihari, B. (2014). Towards Transactional Memory for OpenMP, Proceedings of the 10th International Workshop on OpenMP, 130-145.
There are 14 citations in total.

Details

Journal Section Articles
Authors

Vassilya Uzun This is me

Publication Date June 30, 2016
Submission Date January 27, 2016
Published in Issue Year 2016 Volume: 6 Issue: 1

Cite

IEEE V. Uzun, “Petri Net Model for Ricart and Agrawala’s Mutual Exclusion Algorithm”, Bitlis Eren University Journal of Science and Technology, vol. 6, no. 1, pp. 16–21, 2016, doi: 10.17678/beujst.89612.