{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:01Z","timestamp":1740123541125,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T00:00:00Z","timestamp":1487721600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s11227-017-1985-y","type":"journal-article","created":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T11:23:18Z","timestamp":1487762598000},"page":"3861-3878","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A simple token-based algorithm for the mutual exclusion problem in distributed systems"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0216-9876","authenticated-orcid":false,"given":"Peyman","family":"Neamatollahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasser","family":"Sedaghat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud","family":"Naghibzadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,22]]},"reference":[{"issue":"7","key":"1985_CR1","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Commun ACM 21(7):558\u2013565","journal-title":"Commun ACM"},{"issue":"2","key":"1985_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0920-5489(02)00105-8","volume":"25","author":"PC Saxena","year":"2003","unstructured":"Saxena PC, Rai J (2003) A survey of permission-based distributed mutual exclusion algorithms. Comput Stand Interfaces 25(2):159\u2013181","journal-title":"Comput Stand Interfaces"},{"key":"1985_CR3","doi-asserted-by":"crossref","unstructured":"Thapliyal H, Arabnia HR, Srinivas MB (2009) Efficient reversible logic design of BCD subtractors. In: Gavrilova ML, Kenneth Tan CJ (eds) Transactions on computational science III. Springer, Berlin, pp 99\u2013121 (LNCS 5300)","DOI":"10.1007\/978-3-642-00212-0_6"},{"key":"1985_CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.jpdc.2015.04.002","volume":"83","author":"J Lejeune","year":"2015","unstructured":"Lejeune J, Arantes L, Sopena J, Sens P (2015) A fair starvation-free prioritized mutual exclusion algorithm for distributed systems. J Parallel Distrib Comput 83:13\u201329","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"1985_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1111\/j.1467-8659.1986.tb00296.x","volume":"5","author":"HR Arabnia","year":"1986","unstructured":"Arabnia HR, Oliver MA (1986) Fast operations on raster images with SIMD machine architectures. Comput Graph Forum 5(3):179\u2013188","journal-title":"Comput Graph Forum"},{"key":"1985_CR6","doi-asserted-by":"crossref","unstructured":"Thapliyal H, Jayashree HV, Nagamani AN, Arabnia HR (2013) Progress in reversible processor design: a novel methodology for reversible carry look-ahead adder. In: Gavrilova ML, Kenneth Tan CJ (eds) Transactions in Computational Science. Springer, pp 73\u201397 (LNCS 7420)","DOI":"10.1007\/978-3-642-35840-1_4"},{"key":"1985_CR7","unstructured":"Thapliyal H, Arabnia HR, Bajpai R, Sharma KK (2007) Combined integer and variable precision (CIVP) floating point multiplication architecture for FPGAs. In: Proceedings of 2007 International Conference on Parallel and Distributed Processing Techniques and Applications; PDPTA\u201907. pp 449\u2013450"},{"key":"1985_CR8","unstructured":"Thapliyal H, Arabnia HR (2006) reversible programmable logic array (RPLA) using Fredkin and Feynman gates for industrial electronics and applications. In: Proceedings of 2006 International Conference on Computer Design and Conference on Computing in Nanotechnology (CDES\u201906). pp 70\u201374"},{"key":"1985_CR9","unstructured":"Thapliyal H, Srinivas MB, Arabnia HR (2005) Reversible logic synthesis of half, full and parallel subtractors. In: Proceedings of 2005 International Conference on Embedded Systems and Applications, ESA\u201905. pp 165\u2013172"},{"issue":"4","key":"1985_CR10","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1515\/amcs-2015-0051","volume":"25","author":"MB Qureshi","year":"2015","unstructured":"Qureshi MB, Alrashed S, Min-Allah N et al (2015) Maintaining the feasibility of hard real-time systems with a reduced number of priority levels. Int J Appl Math Comput Sci 25(4):709\u2013722. doi:\n                        10.1515\/amcs-2015-0051","journal-title":"Int J Appl Math Comput Sci"},{"key":"1985_CR11","doi-asserted-by":"publisher","first-page":"4651","DOI":"10.1007\/s11227-016-1751-6","volume":"72","author":"S Alrashed","year":"2016","unstructured":"Alrashed S, Alhiyafi J, Shafi A, Min-Allah N (2016) An efficient schedulability condition for non-preemptive real-time systems at common scheduling points. J Supercomput 72:4651\u20134661. doi:\n                        10.1007\/s11227-016-1751-6","journal-title":"J Supercomput"},{"issue":"2","key":"1985_CR12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0026-2714(89)90567-2","volume":"29","author":"GS Hura","year":"1989","unstructured":"Hura GS (1989) The role of atomic actions in a distributed system. Microelectron Reliab 29(2):185\u2013193","journal-title":"Microelectron Reliab"},{"key":"1985_CR13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.is.2015.10.013","volume":"57","author":"CE Leiserson","year":"2016","unstructured":"Leiserson CE (2016) A simple deterministic algorithm for guaranteeing the forward progress of transactions. Inf Syst 57:69\u201374","journal-title":"Inf Syst"},{"key":"1985_CR14","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.pmcj.2011.08.002","volume":"8","author":"SA Tamhane","year":"2012","unstructured":"Tamhane SA, Kumar M (2012) A token based distributed algorithm for supporting mutual exclusion in opportunistic networks. Pervasive Mob Comput 8:795\u2013809","journal-title":"Pervasive Mob Comput"},{"key":"1985_CR15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.ipl.2011.01.008","volume":"111","author":"J-R Jiang","year":"2011","unstructured":"Jiang J-R (2011) Nondominated local coteries for resource allocation in grids and clouds. Inf Process Lett 111:379\u2013384","journal-title":"Inf Process Lett"},{"key":"1985_CR16","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1016\/j.jpdc.2013.03.010","volume":"73","author":"M Bertier","year":"2013","unstructured":"Bertier M, Obrovac M, Tedeschi C (2013) Adaptive atomic capture of multiple molecules. J Parallel Distrib Comput 73:1251\u20131266","journal-title":"J Parallel Distrib Comput"},{"key":"1985_CR17","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1016\/j.jpdc.2013.03.009","volume":"73","author":"AA Aravind","year":"2013","unstructured":"Aravind AA (2013) Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms. J Parallel Distrib Comput 73:1029\u20131038","journal-title":"J Parallel Distrib Comput"},{"key":"1985_CR18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/TPDS.2013.2297097","volume":"26","author":"W Wu","year":"2015","unstructured":"Wu W, Zhang J, Luo A, Cao J (2015) Distributed Mutual Exclusion Algorithms for Intersection Traffic Control. IEEE Trans Parallel Distrib Syst 26:65\u201374","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1985_CR19","doi-asserted-by":"publisher","unstructured":"Ni W, Wu W, Li K (2016) A message efficient intersection control algorithm for intelligent transportation in smart cities. Futur Gener Comput Syst. doi:\n                        10.1016\/j.future.2016.10.033","DOI":"10.1016\/j.future.2016.10.033"},{"key":"1985_CR20","doi-asserted-by":"crossref","unstructured":"Ciuffoletti A (2010) The wandering token: congestion avoidance of a shared resource. Future Gener Comput Syst 26(3):473\u2013478","DOI":"10.1016\/j.future.2009.05.002"},{"key":"1985_CR21","volume-title":"Distributed systems-principles and paradigms","author":"AS Tanenbaum","year":"2007","unstructured":"Tanenbaum AS, Van Steen M (2007) Distributed systems-principles and paradigms. Pearson Prentice Hall, Upper Saddle River"},{"key":"1985_CR22","doi-asserted-by":"crossref","unstructured":"Paydar S, Naghibzadeh M, Yavari A (2006) A hybrid distributed mutual exclusion algorithm. In: International Conference on Emerging Technologies 2006, ICET\u201906. IEEE, pp 263\u2013270","DOI":"10.1109\/ICET.2006.336002"},{"key":"1985_CR23","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"EW Dijkstra","year":"1965","unstructured":"Dijkstra EW (1965) Solution of a problem in concurrent programming control. Commun ACM 8:569","journal-title":"Commun ACM"},{"key":"1985_CR24","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TSMCC.2009.2037824","volume":"40","author":"Z Li","year":"2010","unstructured":"Li Z, Yan M, Zhou M (2010) Synthesis of structurally simple supervisors enforcing generalized mutual exclusion constraints in petri nets. IEEE Trans Syst Man Cybern C (Appl Rev) 40:330\u2013340","journal-title":"IEEE Trans Syst Man Cybern C (Appl Rev)"},{"issue":"2","key":"1985_CR25","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s00165-016-0364-4","volume":"28","author":"WH Hesselink","year":"2016","unstructured":"Hesselink WH (2016) Correctness and concurrent complexity of the Black-White Bakery Algorithm. Formal Asp Comput 28(2):325\u2013341","journal-title":"Formal Asp Comput"},{"issue":"5","key":"1985_CR26","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s00446-016-0265-z","volume":"29","author":"M Bienkowski","year":"2016","unstructured":"Bienkowski M, Klonowski M, Korzeniowski M, Kowalski DR (2016) Randomized mutual exclusion on a multiple access channel. Distrib Comput 29(5):341\u2013359","journal-title":"Distrib Comput"},{"issue":"3","key":"1985_CR27","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00446-014-0207-6","volume":"27","author":"G Taubenfeld","year":"2014","unstructured":"Taubenfeld G (2014) Tight space bounds for \n                        $$\\ell $$\n                        \n                            \n                                            \n                                \u2113\n                            \n                        \n                     -exclusion. Distrib Comput 27(3):165\u2013179","journal-title":"Distrib Comput"},{"issue":"2","key":"1985_CR28","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s11227-013-1012-x","volume":"67","author":"S-H Park","year":"2014","unstructured":"Park S-H, Lee S-H (2014) Quorum-based mutual exclusion in asynchronous distributed systems with unreliable failure detectors. J Supercomput 67(2):469\u2013484","journal-title":"J Supercomput"},{"key":"1985_CR29","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/j.ipl.2010.09.004","volume":"110","author":"AA Aravind","year":"2010","unstructured":"Aravind AA (2010) Highly-fair bakery algorithm using symmetric tokens. Inf Process Lett 110:1055\u20131060","journal-title":"Inf Process Lett"},{"key":"1985_CR30","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/j.ipl.2015.01.008","volume":"115","author":"H Kakugawa","year":"2015","unstructured":"Kakugawa H (2015) Self-stabilizing distributed algorithm for local mutual inclusion. Inf Process Lett 115:562\u2013569","journal-title":"Inf Process Lett"},{"issue":"2","key":"1985_CR31","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M Maekawa","year":"1985","unstructured":"Maekawa M (1985) An algorithm for mutual exclusion in decentralized systems. ACM Trans Comput Syst 3(2):145\u2013159","journal-title":"ACM Trans Comput Syst"},{"key":"1985_CR32","doi-asserted-by":"crossref","unstructured":"Razzaque MA, Hong CS (2008) Multi-token distributed mutual exclusion algorithm. In: 22nd International Conference on Advanced Information Networking and Applications, 2008, AINA. IEEE, pp 963\u2013970","DOI":"10.1109\/AINA.2008.38"},{"issue":"1","key":"1985_CR33","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G Ricart","year":"1981","unstructured":"Ricart G, Agrawala AK (1981) An optimal algorithm for mutual exclusion in computer networks. Commun ACM 24(1):9\u201317","journal-title":"Commun ACM"},{"issue":"4","key":"1985_CR34","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1145\/6110.214406","volume":"3","author":"I Suzuki","year":"1985","unstructured":"Suzuki I, Kasami T (1985) A distributed mutual exclusion algorithm. ACM Trans Comput Syst 3(4):344\u2013349","journal-title":"ACM Trans Comput Syst"},{"issue":"2","key":"1985_CR35","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/122120.122123","volume":"25","author":"M Raynal","year":"1991","unstructured":"Raynal M (1991) A simple taxonomy for distributed mutual exclusion algorithms. ACM SIGOPS Oper Syst Rev 25(2):47\u201350","journal-title":"ACM SIGOPS Oper Syst Rev"},{"issue":"1","key":"1985_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jpdc.1996.0041","volume":"34","author":"M Naimi","year":"1996","unstructured":"Naimi M, Trehel M, Arnold A (1996) A log (N) distributed mutual exclusion algorithm based on path reversal. J Parallel Distrib Comput 34(1):1\u201313","journal-title":"J Parallel Distrib Comput"},{"key":"1985_CR37","unstructured":"Le Lann G (1977) Distributed systems-towards a formal approach. In: IFIP Congress. Toronto, pp 155\u2013160"},{"issue":"5","key":"1985_CR38","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.jpdc.2012.01.005","volume":"72","author":"P Neamatollahi","year":"2012","unstructured":"Neamatollahi P, Taheri H, Naghibzadeh M (2012) Info-based approach in distributed mutual exclusion algorithms. J Parallel Distrib Comput 72(5):650\u2013665","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"1985_CR39","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K Raymond","year":"1989","unstructured":"Raymond K (1989) A tree-based algorithm for distributed mutual exclusion. ACM Trans Comput Syst 7(1):61\u201377","journal-title":"ACM Trans Comput Syst"},{"key":"1985_CR40","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.ipl.2011.05.021","volume":"111","author":"H Taheri","year":"2011","unstructured":"Taheri H, Neamatollahi P, Naghibzadeh M (2011) A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology. Inf Process Lett 111:841\u2013847","journal-title":"Inf Process Lett"},{"issue":"1","key":"1985_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/103727.103728","volume":"9","author":"D Agrawal","year":"1991","unstructured":"Agrawal D, El Abbadi A (1991) An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans Comput Syst 9(1):1\u201320","journal-title":"ACM Trans Comput Syst"},{"key":"1985_CR42","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jpdc.2015.01.003","volume":"77","author":"H Kakugawa","year":"2015","unstructured":"Kakugawa H (2015) Mutual inclusion in asynchronous message-passing distributed systems. J Parallel Distrib Comput 77:95\u2013104","journal-title":"J Parallel Distrib Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-1985-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-1985-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-1985-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T10:31:20Z","timestamp":1502793080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-1985-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,22]]},"references-count":42,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1985"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-1985-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2017,2,22]]}}}