{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:55:59Z","timestamp":1725641759963},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258725"},{"type":"electronic","value":"9783642258732"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25873-2_19","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T15:16:34Z","timestamp":1323357394000},"page":"266-282","source":"Crossref","is-referenced-by-count":1,"title":["Fused State Machines for Fault Tolerance in Distributed Systems"],"prefix":"10.1007","author":[{"given":"Bharath","family":"Balasubramanian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay K.","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM\u00a051(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"19_CR2","unstructured":"Balasubramanian, B., Garg, V.K.: A fusion-based approach for handling multiple faults in data structures. Technical Report ECE-PDS-2009-001, Parallel and Distributed Systems Laboratory, ECE Dept. University of Texas at Austin (2009)"},{"key":"19_CR3","unstructured":"Balasubramanian, B., Garg, V.K.: Fsm backup library (implemented in java 1.6). In: Parallel and Distributed Systems Laboratory (2011), http:\/\/maple.ece.utexas.edu"},{"key":"19_CR4","unstructured":"Balasubramanian, B., Garg, V.K.: A report on fused state machines for fault tolerance in distributed systems. Technical Report TR-PDS-2011-002 Parallel and Distributed Systems Laboratory, The University of Texas at Austin (2011), http:\/\/pdsl.ece.utexas.edu\/TechReports\/2011\/TR-PDS-2011-002.pdf"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/176979.176981","volume":"26","author":"P.M. Chen","year":"1994","unstructured":"Chen, P.M., Lee, E.K., Gibson, G.A., Katz, R.H., Patterson, D.A.: Raid: high-performance, reliable secondary storage. ACM Comput. Surv.\u00a026(2), 145\u2013185 (1994)","journal-title":"ACM Comput. Surv."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM\u00a051, 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2) (April 1985)","DOI":"10.1145\/3149.214121"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-15763-9_44","volume-title":"Distributed Computing","author":"V.K. Garg","year":"2010","unstructured":"Garg, V.K.: Implementing Fault-Tolerant Services Using State Machines: Beyond Replication. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 450\u2013464. Springer, Heidelberg (2010)"},{"key":"19_CR9","first-page":"518","volume-title":"VLDB 1999: Proceedings of the 25th International Conference on Very Large Data Bases","author":"A. Gionis","year":"1999","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB 1999: Proceedings of the 25th International Conference on Very Large Data Bases, pp. 518\u2013529. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R. Hamming","year":"1950","unstructured":"Hamming, R.: Error-detecting and error-correcting codes. Bell System Technical Journal\u00a029(2), 147\u2013160 (1950)","journal-title":"Bell System Technical Journal"},{"key":"19_CR11","series-title":"Prentice-Hall international series in applied mathematics","volume-title":"Algebraic structure theory of sequential machines","author":"J. Hartmanis","year":"1966","unstructured":"Hartmanis, J., Stearns, R.E.: Algebraic structure theory of sequential machines. Prentice-Hall international series in applied mathematics. Prentice-Hall, Inc., Upper Saddle River (1966)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Technical report, Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: The synthesis of sequential switching circuits. Technical report, Massachusetts, USA (1954)","DOI":"10.1016\/0016-0032(54)90618-3"},{"key":"19_CR14","first-page":"95","volume":"22","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: The implementation of reliable distributed multiprocess systems. Computer Networks\u00a022, 95\u2013114 (1978)","journal-title":"Computer Networks"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04, 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/12.980009","volume":"51","author":"D. Lee","year":"2002","unstructured":"Lee, D., Yannakakis, M.: Closed partition lattice and machine decomposition. IEEE Trans. Comput.\u00a051(2), 216\u2013228 (2002)","journal-title":"IEEE Trans. Comput."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Mishchenko, A., Chatterjee, S., Brayton, R.: Dag-aware aig rewriting: A fresh look at combinational logic synthesis. In: DAC 2006: Proceedings of the 43rd Annual Conference on Design Automation, pp. 532\u2013536. ACM Press (2006)","DOI":"10.1145\/1146909.1147048"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Ogale, V., Balasubramanian, B., Garg, V.K.: A fusion-based approach for tolerating faults in finite state machines. In: International Parallel and Distributed Processing Symposium, pp. 1\u201311 (2009)","DOI":"10.1109\/IPDPS.2009.5161018"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/50202.50214","volume-title":"SIGMOD 1988: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data","author":"D.A. Patterson","year":"1988","unstructured":"Patterson, D.A., Gibson, G., Katz, R.H.: A case for redundant arrays of inexpensive disks (raid). In: SIGMOD 1988: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, pp. 109\u2013116. ACM Press, New York (1988)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027, 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/190.357399","volume":"2","author":"F.B. Schneider","year":"1984","unstructured":"Schneider, F.B.: Byzantine generals in action: implementing fail-stop processors. ACM Trans. Comput. Syst.\u00a02(2), 145\u2013154 (1984)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"4","key":"19_CR22","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F.B. Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys\u00a022(4), 299\u2013319 (1990)","journal-title":"ACM Computing Surveys"},{"issue":"10","key":"19_CR23","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.sysarc.2003.12.003","volume":"50","author":"F. Tenzakhti","year":"2004","unstructured":"Tenzakhti, F., Day, K., Ould-Khaoua, M.: Replication algorithms for the world-wide web. J. Syst. Archit.\u00a050(10), 591\u2013605 (2004)","journal-title":"J. Syst. Archit."},{"key":"19_CR24","unstructured":"Yang, S.: Logic synthesis and optimization benchmarks user guide version 3.0 (1991)"},{"issue":"1","key":"19_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/(SICI)1520-684X(199801)29:1<53::AID-SCJ6>3.0.CO;2-Q","volume":"29","author":"H. Youra","year":"1998","unstructured":"Youra, H., Inoue, T., Masuzawa, T., Fujiwara, H.: On the synthesis of synchronizable finite state machines with partial scan. Systems and Computers in Japan\u00a029(1), 53\u201362 (1998)","journal-title":"Systems and Computers in Japan"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T15:53:18Z","timestamp":1561045998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}