{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:21Z","timestamp":1725559161616},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540273240"},{"type":"electronic","value":"9783540315841"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11516798_31","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T04:29:05Z","timestamp":1279081745000},"page":"431-442","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load"],"prefix":"10.1007","author":[{"given":"D.","family":"Carvalho","sequence":"first","affiliation":[]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[]},{"given":"Massimo","family":"De Gregorio","sequence":"additional","affiliation":[]},{"given":"Felipe M. G.","family":"Fran\u00e7a","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,8,23]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Agrawala, D., El Abbadi, A.: An efficient solution to the distributed mutual exclusion problem. In: Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pp. 193\u2013200 (August 1989)","DOI":"10.1145\/72981.72994"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0020-0190(90)90194-3","volume":"33","author":"D. Agrawala","year":"1990","unstructured":"Agrawala, D., El Abbadi, A.: Exploiting logical structures in replicated databases. Inf. Proc. Letters\u00a033, 255\u2013260 (1990)","journal-title":"Inf. Proc. Letters"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1996.0041","volume":"34","author":"A. Arnold","year":"1996","unstructured":"Arnold, A., Naimi, M., Tr\u00e9hel, M.: A logn distributed mutual exclusion algorithm based on the path reversal. Journal of Parallel and Distributed Computing\u00a034, 1\u201313 (1996)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"V. Barbosa","year":"1989","unstructured":"Barbosa, V., Gafni, E.: Concurrency in heavily loaded neighborhood-constrained systems. ACM Transactions on Programming Languages and Systems\u00a011(4), 562\u2013584 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"31_CR5","unstructured":"Barbosa, V.C.: Concurrency in Systems with Neighborhood Constraints. Ph.D. thesis, UCLA Computer Science Department, Los Angeles (1986)"},{"key":"31_CR6","unstructured":"Carvalho, D., Fran\u00e7a, F.M.G., Protti, F.: Pseudo-code of Scheduling by Edge Reversal with Hibernation (2004), \n\nhttp:\/\/www.if.ufrj.br\/~carvalho\/serh.html"},{"issue":"2","key":"31_CR7","first-page":"145","volume":"26","author":"O.S.F. Carvalho","year":"1983","unstructured":"Carvalho, O.S.F., Roucariol, G.: On mutual exclusion in computer networks. Communications of ACM\u00a026(2), 145\u2013147 (1983)","journal-title":"Communications of ACM"},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The drinking philosopher\u2019s problem. ACM Transactions on Programming Languages and Systems\u00a06(4), 632\u2013646 (1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E.W. Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequencial processes. Acta Informatica\u00a01(2), 115\u2013138 (1971)","journal-title":"Acta Informatica"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TCOM.1981.1094876","volume":"29","author":"E.M. Gafni","year":"1981","unstructured":"Gafni, E.M., Bertsekas, D.P.: Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications\u00a029(1), 11\u201318 (1981)","journal-title":"IEEE Transactions on Communications"},{"key":"31_CR11","unstructured":"Gifford, K.D.: Weighted voting for replicated data. In: Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pp. 150\u2013159 (1989)"},{"key":"31_CR12","unstructured":"Goldman, K., Hoffert, J.: A modification to the chandy-misra dining philosophers algorithm to suport dynamic resource conflict graphs. submetido para Information Processing Letters"},{"issue":"4","key":"31_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1093\/comjnl\/31.4.289","volume":"31","author":"N. Plouzeau","year":"1988","unstructured":"Plouzeau, N., Helary, J.M., Raynal, M.: A distributed algorithm for mutual exclusion in an arbritary network. The Computer Journal\u00a031(4), 289\u2013295 (1988)","journal-title":"The Computer Journal"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/277697.277706","volume-title":"Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC 1998)","author":"Y.-J. Joung","year":"1998","unstructured":"Joung, Y.-J.: Asynchronous group mutual exclusion. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC 1998), pp. 51\u201360. Association for Computing Machinery, New York (1998)"},{"issue":"11","key":"31_CR15","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/32.60317","volume":"16","author":"J. Kramer","year":"1990","unstructured":"Kramer, J., Magee, J.: The Evolving Philosophers Problem: Dynamic Change Management. IEEE Transactions on Software Engineering\u00a016(11), 1293\u20131306 (1990)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"31_CR16","first-page":"155","volume-title":"IFIP Congress","author":"G. Lann Le","year":"1977","unstructured":"Le Lann, G.: Distributed systems: towards of formal approach. In: IFIP Congress, pp. 155\u2013160. North-Holland, Amsterdam (1977)"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of 7th ACM Symposium on Operating Systems Principles, pp. 137\u2013151 (1987)","DOI":"10.1145\/41840.41852"},{"issue":"2","key":"31_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M.A. Maekawa","year":"1985","unstructured":"Maekawa, M.A.: A \n\n\n\n$\\sqrt{n}$\n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems\u00a03(2), 145\u2013159 (1985)","journal-title":"ACM Transactions on Computer Systems"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0167-6423(85)90015-2","volume":"5","author":"J.A. Martin","year":"1985","unstructured":"Martin, J.A.: Distributed mutual exclusion on a ring of processors. Science of Computer Programming\u00a05, 256\u2013276 (1985)","journal-title":"Science of Computer Programming"},{"issue":"4","key":"31_CR20","first-page":"150","volume":"32","author":"H.G. Molina","year":"1985","unstructured":"Molina, H.G., Barbara, D.: How to assign votes in a distributed system. Jornal of the ACM\u00a032(4), 150\u2013159 (1985)","journal-title":"Jornal of the ACM"},{"issue":"1","key":"31_CR21","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems\u00a07(1), 61\u201377 (1989)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"1","key":"31_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(89)90187-7","volume":"33","author":"M. Raynal","year":"1989","unstructured":"Raynal, M.: Prime numbers as a tool to design distributed algorithms. Inf. Process. Lett.\u00a033(1), 53\u201358 (1989)","journal-title":"Inf. Process. Lett."},{"key":"31_CR23","doi-asserted-by":"publisher","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. Operation Systems Review\u00a025, 47\u201350 (1991)","journal-title":"Operation Systems Review"},{"key":"31_CR24","unstructured":"Rhee, I.: A fast distributed modular algorithm for resource allocation. In: Proceedings og the 15th International Conference on distributed Computer Systems (ICDCS 1995), pp. 161\u2013168 (1995)"},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0920-5489(02)00105-8","volume":"25","author":"P.C. Saxena","year":"2003","unstructured":"Saxena, P.C., Rai, J.: A survey of permission-based distributed mutual exclusion algorithms. Computer Standards and Interfaces\u00a025, 159\u2013181 (2003)","journal-title":"Computer Standards and Interfaces"},{"key":"31_CR26","unstructured":"Walter, J.E., Welch, J.L., Vaidya, N.H.: A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks: The Journal of Mobile Communication, Computation and Information\u00a07 (2001)"},{"key":"31_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02242711","volume":"6","author":"J.L. Welch","year":"1993","unstructured":"Welch, J.L., Lynch, N.A.: A modular drinking philosophers algorithm. Distributed Computing\u00a06, 233\u2013244 (1993)","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11516798_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T08:37:37Z","timestamp":1585903057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11516798_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540273240","9783540315841"],"references-count":27,"URL":"http:\/\/dx.doi.org\/10.1007\/11516798_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"23 August 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}
