{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:45:51Z","timestamp":1648993551609},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2006,10,24]],"date-time":"2006-10-24T00:00:00Z","timestamp":1161648000000},"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":[[2007,3,23]]},"DOI":"10.1007\/s00446-006-0013-x","type":"journal-article","created":{"date-parts":[[2006,10,23]],"date-time":"2006-10-23T07:59:48Z","timestamp":1161590388000},"page":"419-431","source":"Crossref","is-referenced-by-count":7,"title":["The Doomsday distributed termination detection protocol"],"prefix":"10.1007","volume":"19","author":[{"given":"M. J.","family":"Livesey","sequence":"first","affiliation":[]},{"given":"R.","family":"Morrison","sequence":"additional","affiliation":[]},{"given":"D. S.","family":"Munro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,10,24]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1145\/128738.128742","volume":"9","author":"K.P. Birman","year":"1991","unstructured":"Birman K.P., Schiper A., Stephenson P. (1991) Lightweigt causal and atomic group multicast. ACM Trans. Comput. Syst. 9(3): 272\u2013314","journal-title":"ACM Trans. Comput. Syst."},{"issue":"4","key":"13_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01660033","volume":"1","author":"D.L. Black","year":"1986","unstructured":"Black D.L. (1986) On the existence of delay-insensitive fair arbiters: Trace theory and its limitations. Distrib. Comput. 1(4): 205\u2013225","journal-title":"Distrib. Comput."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., Moss, J.E.B., Hudson, R.L., Morrison, R., Munro, D.S., Zigman, J.N.: Starting with termination: A methodology for building distributed garbage collection algorithms. In: 24th Australasian Computer Science Conference (ACSC 2001), 29 January\u20131 February 2001, Gold Coast, Queensland, Australia, pp. 20\u201328. IEEE Computer Society (2001)","DOI":"10.1109\/ACSC.2001.906619"},{"issue":"1","key":"13_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K.M. Chandy","year":"1985","unstructured":"Chandy K.M., Lamport L. (1985) Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1): 63\u201375","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"13_CR5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/357360.357365","volume":"1","author":"K.M. Chandy","year":"1983","unstructured":"Chandy K.M., Misra J., Haas L.M. (1983) Distributed deadlock detection. ACM Trans. Comput. Syst. 1(2): 144\u2013156","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"13_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E.W. Dijkstra","year":"1980","unstructured":"Dijkstra E.W., Scholten C.S. (1980) Termination detection for diffusing computations. Inf. Process. Lett. 11(1): 1\u20134","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"13_CR7","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer M.J., Lynch N.A., Paterson M. (1985) Impossibility of distributed consensus with one faulty process. J. ACM 32(2): 374\u2013382","journal-title":"J. ACM"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Hudson, R.L., Morrison, R., Moss, J.E.B., Munro, D.S.: Garbage collecting the world: One car at a time. In: ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA \u201997), Atlanta, Georgia, pp.162\u2013175 (1997)","DOI":"10.1145\/263698.264353"},{"key":"13_CR9","unstructured":"Hudson, R.L., Morrison, R., Moss, J.E.B., Munro, D.S.: Where have all the pointers gone? In: 21st Australasian Computer Science Conference, Perth, Western Australia, pp. 107\u2013119 (1998)"},{"key":"13_CR10","unstructured":"Jones, R.: Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons (1996). With a chapter on Distributed Garbage Collection by Rafael Lins. Reprinted 1997 (twice), 1999, 2000."},{"issue":"1","key":"13_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/71.363410","volume":"6","author":"T.H. Lai","year":"1995","unstructured":"Lai T.H., Wu L.F. (1995) An (n-1)-resilient algorithm for distributed termination detection. IEEE Trans. Parallel Distrib. Syst. 6(1):63\u201378","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Lamport, L.: \u201csometime\u201d is sometimes \u201cnot never\u201d - on the temporal logic of programs. In: 7th ACM Symposium on the Principles of Programming Languages, (PoPL7), Las Vegas, Nevada, pp. 174\u2013185 (1980)","DOI":"10.1145\/567446.567463"},{"issue":"2","key":"13_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02280840","volume":"7","author":"M.J. Livesey","year":"1993","unstructured":"Livesey M.J. (1993) A note on consistency in asynchronous multicaches. Distrib. Comput. 7(2): 111\u2013114","journal-title":"Distrib. Comput."},{"issue":"3","key":"13_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0164-1212(98)10034-1","volume":"43","author":"J. Matocha","year":"1998","unstructured":"Matocha J., Camp T. (1998) A taxonomy of distributed termination detection algorithms. J. Syst. Softw. 43(3): 207\u2013221","journal-title":"J. Syst. Softw."},{"issue":"4","key":"13_CR15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(89)90212-3","volume":"30","author":"F. Mattern","year":"1989","unstructured":"Mattern F. (1989) Global quiescence detection based on credit distribution and recovery. Inf. Process. Lett. 30(4):195\u2013200","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"13_CR16","first-page":"107","volume":"37","author":"S. Norcross","year":"2005","unstructured":"Norcross S., Morrison R., Munro D.S., Detmold H., Falkner K.E. (2005) Implementing a family of distributed garbage collectors. J. Res. Pract. Inf. Technol. 37(1): 107\u2013126","journal-title":"J. Res. Pract. Inf. Technol."},{"issue":"3","key":"13_CR17","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/65000.65001","volume":"7","author":"L.L. Peterson","year":"1989","unstructured":"Peterson L.L., Buchholz N.C., Schlichting R.D. (1989) Preserving and using context information in interprocess communication. ACM Trans. Comput. Syst. 7(3): 217\u2013246","journal-title":"ACM Trans. Comput. Syst."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Plainfoss\u00e9, D., Shapiro, M.: A survey of distributed garbage collection techniques. In: Baker H.G. (ed.) IWMM, Lecture Notes in Computer Science, vol. 986, pp. 211\u2013249. Springer, Berlin Heidelberg New York (1995)","DOI":"10.1007\/3-540-60368-9_26"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Tel, G.: Introduction to distributed algorithms. Cambridge University Press, New York, NY, USA (1994)","DOI":"10.1007\/BFb0020419"},{"issue":"1","key":"13_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/151646.151647","volume":"15","author":"G. Tel","year":"1993","unstructured":"Tel G., Mattern F. (1993) The derivation of distributed termination detection algorithms from garbage collection schemes. ACM Trans. Program. Lang. Syst. 15(1): 1\u201335","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR21","unstructured":"Wu, L.F., Lai, T.H., Tseng, Y.C.: Consensus and termination detection in the presence of faulty processes. In: 1st International Conference on Parallel and Distributed Systems, Taiwan, pp. 267\u2013274 (1992)"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Ye, X., Keane, J.A.: Detecting distributed termination in the presence of node failure. In: ACSC \u201995: Proceedings of the 1995 Asian Computing Science Conference on Algorithms, Concurrency and Knowledge, pp. 195\u2013209. Springer, Berlin Heidelberg New York (1995)","DOI":"10.1007\/3-540-60688-2_45"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0013-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-006-0013-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0013-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:36Z","timestamp":1559136396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-006-0013-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,24]]},"references-count":22,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2007,3,23]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0013-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,24]]}}}