{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T15:40:23Z","timestamp":1736091623236,"version":"3.32.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf02242735","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T07:37:35Z","timestamp":1132040255000},"page":"171-180","source":"Crossref","is-referenced-by-count":2,"title":["A class of high performance Maekawa-type algorithms for distributed systems under heavy demand"],"prefix":"10.1007","volume":"8","author":[{"given":"Roberto","family":"Baldoni","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Ciciani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"BF02242735_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/103727.103728","volume":"9","author":"D Agrawal","year":"1991","unstructured":"Agrawal D, Abbadi AE: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans Comput Syst 9(1): 1\u201320 (1991)","journal-title":"ACM Trans Comput Syst"},{"key":"BF02242735_CR2","doi-asserted-by":"crossref","unstructured":"Baldoni R: AnO(N M\/(M+1) distributed algorithm for thek-out of-M resources allocation problem. In: Proc of 14-th Int Conf on Distributed Computing Systems. IEEE Press 1994, pp 81\u201387","DOI":"10.1109\/ICDCS.1994.302396"},{"key":"BF02242735_CR3","volume-title":"Mutual exclusion in distributed systems","author":"R Baldoni","year":"1994","unstructured":"Baldoni R: Mutual exclusion in distributed systems. Ph.D dissertation, Dipartimento di Informatica e Sistemistica, University of Rome \u201cLa Sapienza\u201d, Italy, 1994"},{"issue":"3","key":"BF02242735_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0020-0190(94)00025-5","volume":"50","author":"R Baldoni","year":"1994","unstructured":"Baldoni R, Ciciani B: Distributed algorithms for multiple entries to a critical section with priority. Inf Process Lett 50(3): 165\u2013172 (1994)","journal-title":"Inf Process Lett"},{"issue":"1","key":"BF02242735_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/32.44366","volume":"16","author":"RC Vries De","year":"1990","unstructured":"De Vries RC: Reducing NULL messages in Misra's distributed discrete event simulation method. IEEE Trans Soft Eng 16(1): 97\u2013107 (1990)","journal-title":"IEEE Trans Soft Eng"},{"issue":"8","key":"BF02242735_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/2.84874","volume":"24","author":"CJ Fidge","year":"1991","unstructured":"Fidge CJ: Logical time in distributed computing systems. IEEE Comput 24(8) 28\u201333 (1991)","journal-title":"IEEE Comput"},{"key":"BF02242735_CR7","unstructured":"Kleinrock L: Queuing systems volume II: computer applications. Wiley 1976"},{"issue":"7","key":"BF02242735_CR8","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport L: Time, clocks and the ordering of events in a distributed system. Commun ACM 21(7): 558\u2013565 (1978)","journal-title":"Commun ACM"},{"key":"BF02242735_CR9","volume-title":"Computer performance modeling handbook","author":"SS Lavenberg","year":"1983","unstructured":"Lavenberg SS: Computer performance modeling handbook, Academic Press, New York 1983"},{"issue":"2","key":"BF02242735_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M Maekawa","year":"1985","unstructured":"Maekawa M: A N algorithm for mutual exclusion in decentralized system. ACM Trans Comput Syst 3(2): 145\u2013159 (1985)","journal-title":"ACM Trans Comput Syst"},{"key":"BF02242735_CR11","doi-asserted-by":"crossref","unstructured":"Mostefaoui A, Raynal M: Causal multicast in overlapping groups: towards a low cost approach. In: Proc of Int Conf on Future Trends of distributed Systems. IEEE Press 1993, pp 136\u2013142","DOI":"10.1109\/FTDCS.1993.344165"},{"issue":"1","key":"BF02242735_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/122120.122123","volume":"25","author":"M Raynal","year":"1991","unstructured":"Raynal M: A simple taxonomy for distributed mutual exclusion algorithms. ACM Operat Syst Review 25(1): 47\u201351 (1991)","journal-title":"ACM Operat Syst Review"},{"issue":"1","key":"BF02242735_CR13","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G Ricart","year":"1981","unstructured":"Ricart G, Agrawala AK: An optimal algorithm for mutual exclusion in computer networks. Commun ACM 24(1): 9\u201317 (1981)","journal-title":"Commun ACM"},{"issue":"3","key":"BF02242735_CR14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/24068.28052","volume":"5","author":"BA Sanders","year":"1987","unstructured":"Sanders BA: The information structure of distributed mutual exclusion algorithms. ACM Trans Comput Syst 5(3): 284\u2013299 (1987)","journal-title":"ACM Trans Comput Syst"},{"issue":"2","key":"BF02242735_CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/357162.357163","volume":"4","author":"FB Schneider","year":"1982","unstructured":"Schneider FB: Synchronization in distributed programs. ACM Trans Prog Lang Syst 4(2): 179\u2013195 (1982)","journal-title":"ACM Trans Prog Lang Syst"},{"key":"BF02242735_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01798960","volume":"4","author":"M Singhal","year":"1991","unstructured":"Singhal M: A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems. Distrib Comput Syst 4: 131\u2013138 (1991)","journal-title":"Distrib Comput Syst"},{"key":"BF02242735_CR17","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/jpdc.1993.1048","volume":"18","author":"M Singhal","year":"1993","unstructured":"Singhal M: A taxonomy of distributed mutual exclusion. J Paralel Distrib. Comput 18: 94\u2013101 (1993)","journal-title":"J Paralel Distrib. Comput"},{"key":"BF02242735_CR18","unstructured":"Takagi H: Queueing analysis volume 1: vacation and priority systems. North-Holland 1991"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242735.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02242735\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T15:13:30Z","timestamp":1736090010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02242735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF02242735"],"URL":"https:\/\/doi.org\/10.1007\/bf02242735","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}