{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T20:21:28Z","timestamp":1682454088626},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,4,7]],"date-time":"2005-04-07T00:00:00Z","timestamp":1112832000000},"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":[[2005,7]]},"DOI":"10.1007\/s00446-005-0123-x","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T06:53:35Z","timestamp":1113029615000},"page":"73-84","source":"Crossref","is-referenced-by-count":22,"title":["Active Disk Paxos with infinitely many processes"],"prefix":"10.1007","volume":"18","author":[{"given":"Gregory","family":"Chockler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,4,7]]},"reference":[{"issue":"6","key":"123_CR1","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1145\/227683.227688","volume":"42","author":"Y Afek","year":"1995","unstructured":"Afek, Y., Greenberg, D.S., Merritt, M., Taubenfeld, G.: Computing with faulty shared objects. J. ACM 42(6), 1231-1274 (1995)","journal-title":"J. ACM"},{"key":"123_CR2","doi-asserted-by":"crossref","unstructured":"Acharya, A., Uysal, M., Saltz, J.: Active Disks: programming model, algorithms and evaluation. In: Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII) (1998)","DOI":"10.1145\/291069.291026"},{"key":"123_CR3","doi-asserted-by":"crossref","unstructured":"Amiri, K., Gibson, G.A., Golding, R.: Highly concurrent shared storage. In: Proceedings of the International Conference on Distributed Computing Systems (ICDCS'2000) (2000)","DOI":"10.1109\/ICDCS.2000.840942"},{"issue":"1","key":"123_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/225535.225537","volume":"14","author":"T Anderson","year":"1996","unstructured":"Anderson, T., Dahlin, M., Neefe, J., Patterson, D., Roselli, D., Wang, R.: Serverless network file systems. ACM Trans. Comput. Syst. 14(1), 41-79 (1996)","journal-title":"ACM Trans. Comput. Syst."},{"key":"123_CR5","doi-asserted-by":"crossref","unstructured":"Birman, I.K., Joseph, T.: Exploiting virtual synchrony in distributed systems. In: Proceedings of the 11th Annual Symposium on Operating Systems Principles, pp. 123-138 (1987)","DOI":"10.21236\/ADA177091"},{"key":"123_CR6","first-page":"200106","volume":"ID","author":"Boichat","year":"2001","unstructured":"Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Deconstructing Paxos. Technical Report DSC ID:200106, Communication Systems Department (DSC), \u00c9cole Polytechnic F\u00e9d\u00e9rale de Lausanne (EPFL) (2001). Available at http:\/\/dscwww.epfl.ch\/EN\/publications\/documents\/tr01\\006.pdf","journal-title":"Technical Report DSC"},{"issue":"1","key":"123_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/637437.637447","volume":"34","author":"R Boichat","year":"2003","unstructured":"Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Deconstructing paxos. ACM SIGACT News Distrib. Comput. Column. 34(1), 47-67 (2003)","journal-title":"ACM SIGACT News Distrib. Comput. Column."},{"key":"123_CR8","volume-title":"Data management in a distributed file system for Storage Area Networks","author":"R Burns","year":"2000","unstructured":"Burns, R.: Data management in a distributed file system for Storage Area Networks. PhD Thesis, Department of Computer Science, University of California, Santa Cruz (2000)"},{"issue":"2","key":"123_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J Burns","year":"1993","unstructured":"Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Inform. Comput. 107(2), 171-184 (1993)","journal-title":"Inform. Comput."},{"issue":"4","key":"123_CR10","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685-722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"123_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225-267 (1996)","journal-title":"J. ACM"},{"issue":"4","key":"123_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/503112.503113","volume":"33","author":"G.V. Chockler","year":"2001","unstructured":"Chockler, G.V., Keidar, I., Vitenberg, R.: Group communication specifications: a comprehensive study. ACM Comput. Surv. 33(4), 1-43 (2001)","journal-title":"ACM Comput. Surv."},{"key":"123_CR13","unstructured":"Chockler, G.V., Keidar, I., Malkhi, D.: Computing with Byzantine storage. In: Preparation."},{"key":"123_CR14","volume-title":"Proceedings of the International Workshop on Future Directions in Distributed Computing (FuDiCo)","author":"G Chockler","year":"2002","unstructured":"Chockler, G., Malkhi, D., Dolev, D.: State-machine replication with infinitely many processes: a position paper. In: Proceedings of the International Workshop on Future Directions in Distributed Computing (FuDiCo), Bertinoro, Italy (2002)"},{"key":"123_CR15","doi-asserted-by":"crossref","unstructured":"Chockler, G., Malkhi, D., Reiter, M.K.: Backoff protocols for distributed mutual exclusion and ordering. In: Proceedings of the 21st International Conference on Distributed Computing Systems, pp. 11-20 (2001)","DOI":"10.1109\/ICDSC.2001.918928"},{"key":"123_CR16","unstructured":"Chor, B., Dwork, C.: Randomization in Byzantine agreement. In: Micali, S. (ed.). Advances in Computing Research, Randomness in Computation, vol. 5, pp. 443-497. JAI Press (1989)"},{"key":"123_CR17","doi-asserted-by":"crossref","unstructured":"Cristian, F., Fetzer, C.: The timed asynchronous distributed system model. In: Proceedings of the 28th Annual International Symposium on Fault-Tolerant Computing (1998)","DOI":"10.1109\/FTCS.1998.689463"},{"key":"123_CR18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0304-3975(00)00042-6","volume":"243","author":"R DePrisco","year":"2000","unstructured":"DePrisco, R., Lampson, B., Lynch, N.: Fundamental study: revisiting the Paxos algorithm. Theoret. Comput. Sci. 243, 35-91 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"123_CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. J. ACM 34(1), 77-97 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"123_CR20","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288-323 (1988)","journal-title":"J. ACM"},{"issue":"2","key":"123_CR21","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.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374-382 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"123_CR22","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/377769.377776","volume":"19","author":"A Fekete","year":"2001","unstructured":"Fekete, A., Lynch, N., Shvartsman, A.: Specifying and using a partitionable group communication service. ACM Trans. Comput. Syst. 19(2), 171-216 (2001)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"123_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00446-002-0070-8","volume":"16","author":"E Gafni","year":"2003","unstructured":"Gafni, E., Lamport, L.: Disk Paxos. Distribut. Comput. 16(1), 1-20 (2003)","journal-title":"Distribut. Comput."},{"key":"123_CR24","doi-asserted-by":"crossref","unstructured":"Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC 2001) (2001)","DOI":"10.1145\/383962.384008"},{"key":"123_CR25","doi-asserted-by":"crossref","unstructured":"Gibson, G.A., Nagle, D.F., Amiri, K., Butler, J., Chang, F.W., Gobioff, H., Hardin, C., Riedel, E., Rochberg, D., Zelenka, J.: A cost-effective high-bandwidth storage architecture. In: Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (1998)","DOI":"10.1145\/291069.291029"},{"key":"123_CR26","unstructured":"Gibson, G.A., Nagle, D.F., Amiri, K., Chang, F.W., Gobioff, H., Riedel, E., Rochberg, D., Zelenka, J.: Filesystems for network-attached secure disks. Technical Report CMU-CS-97-118 (1997)"},{"key":"123_CR27","unstructured":"Gobioff, H., Gibson, G.A., Tygar, D.: Security for network attached storage devices. Technical Report CMU-CS-97-185 (1997)"},{"key":"123_CR28","unstructured":"Hotz, S.,Van Meter, R., Finn, G.: Internet protocols for network-attached peripherals. In: Proceedings of the Sixth NASA Goddard Conference on Mass Storage Systems and Technologies in conjunction with 15th IEEE Symposium on Mass Storage Systems (1998)"},{"key":"123_CR29","doi-asserted-by":"crossref","unstructured":"Hartman, J.H., Murdock, I., Spalink, T.: The Swarm scalable storage system. In: Proceedings of the 19th IEEE International Conference on Distributed Computing Systems (ICDCS'99) (1999)","DOI":"10.1109\/ICDCS.1999.776508"},{"issue":"1","key":"123_CR30","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Languag. Syst. 11(1), 124-149 (1991)","journal-title":"ACM Trans. Program. Languag. Syst."},{"issue":"3","key":"123_CR31","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/278298.278305","volume":"45","author":"P Jayanti","year":"1998","unstructured":"Jayanti, P., Chandra, T., Toueg, S.: Fault-tolerant wait-free shared objects. J. ACM 45(3), 451-500 (1998)","journal-title":"J. ACM"},{"key":"123_CR32","doi-asserted-by":"crossref","unstructured":"Keidar, I., Dolev, D.: Totally ordered broadcast in the face of network partitions: exploiting group communication for replication in partitionable networks. In: Avresky, D. (ed.). Dependable Network Computing, Chap. 3. Kluwer Academic Publications (2000)","DOI":"10.1007\/978-1-4615-4549-1_3"},{"issue":"7","key":"123_CR33","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 distributed systems. Communi. ACM 21(7), 558-565 (1978)","journal-title":"Communi. ACM"},{"issue":"2","key":"123_CR34","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133-169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"4","key":"123_CR35","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/568425.568433","volume":"32","author":"L Lamport","year":"2001","unstructured":"Lamport, L.: Paxos made simple. Distribut. Comput. Column. SIGACT News 32(4), 34-58 (2001)","journal-title":"Distribut. Comput. Column. SIGACT News"},{"issue":"3","key":"123_CR36","doi-asserted-by":"crossref","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 Trans. Program. Languag. Syst. 4(3), 382-401 (1982)","journal-title":"ACM Trans. Program. Languag. Syst."},{"key":"123_CR37","volume-title":"Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG), LNCS 1151","author":"B.W. Lampson","year":"1996","unstructured":"Lampson, B.W.: How to build a highly available system using consensus. In: Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG), LNCS 1151. Springer-Verlag, Berlin (1996)"},{"key":"123_CR38","doi-asserted-by":"crossref","unstructured":"Lee, E.K., Thekkath, C.: Petal: distributed virtual disks. In: Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VII), pp. 84-92 (1996)","DOI":"10.1145\/237090.237157"},{"key":"123_CR39","first-page":"280","volume-title":"Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), LNCS 857","author":"W.K. Lo","year":"1994","unstructured":"Lo, W.K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems. In: Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), LNCS 857, pp. 280-295. Springer-Verlag, Berlin (1994)"},{"key":"123_CR40","first-page":"163","volume-title":"Parallel and Distributed Computing: vol. 4 of Advances in Computing Research","author":"M.C. Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes, In: Franco, P.P. (ed.). Parallel and Distributed Computing: vol. 4 of Advances in Computing Research, pp. 163-183. JAI Press, Greenwich, Conn. (1987)"},{"key":"123_CR41","unstructured":"Malkhi, D.: From Byzantine agreement to practical survivability. In: The International Workshop on Self-Repairing and Self-Configurable Distributed Systems (RCDS'2002) Osaka, Japan (2002)"},{"issue":"2","key":"123_CR42","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/69.842262","volume":"12","author":"D Malkhi","year":"2000","unstructured":"Malkhi, D., Reiter, M.K.: An architecture for survivable coordination in large-scale systems. IEEE Transact. Knowledge Data Eng. 12(2), 187-202 (2000)","journal-title":"IEEE Transact. Knowledge Data Eng."},{"key":"123_CR43","doi-asserted-by":"crossref","unstructured":"Merritt, M., Taubenfeld, G.: Computing with infinitely many processes. In: Proceedings of 14th International Symposium on Distributed Computing (DISC'2000), pp. 164-178 (2000)","DOI":"10.1007\/3-540-40026-5_11"},{"issue":"1","key":"123_CR44","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/S0129626401000452","volume":"11","author":"A. Most\u00e9faoui","year":"2001","unstructured":"Most\u00e9faoui, A., Raynal, M.: Leader-based consensus. Parallel Process. Lett. 11(1), 95-107 (2001)","journal-title":"Parallel Process. Lett."},{"key":"123_CR45","unstructured":"National Storage Industry Consortium. http:\/\/www.nsic.org\/nasd"},{"key":"123_CR46","doi-asserted-by":"crossref","unstructured":"Powell, D. (ed.): Group communication. Commun. ACM 39(4), 50-97 (1996)","DOI":"10.1145\/227210.227225"},{"key":"123_CR47","doi-asserted-by":"crossref","unstructured":"Riedel, E., Faloutsos, C., Gibson, G.A., Nagle, D.: Active disks for large-scale data processing. IEEE Comput. 68-74 (2001)","DOI":"10.1109\/2.928624"},{"key":"123_CR48","doi-asserted-by":"crossref","unstructured":"Skeen, M.D.: Nonblocking commit protocols. In: SIGMOD International Conference Management of Data (1981)","DOI":"10.1145\/582318.582339"},{"key":"123_CR49","unstructured":"Skeen, M.D.: Crash recovery in a distributed database system. PhD Thesis, UC Berkeley (1982)"},{"issue":"4","key":"123_CR50","doi-asserted-by":"crossref","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 Comput. Surv. 22(4), 299-319 (1990)","journal-title":"ACM Comput. Surv."},{"key":"123_CR51","doi-asserted-by":"crossref","unstructured":"Thekkath, C., Mann, T., Lee, E.K.: Frangipani: a scalable distributed file system. In: Proceedings of the 16th ACM Symposium on Operating Systems Principles, pp. 224-237 (1997)","DOI":"10.1145\/268998.266694"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0123-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-005-0123-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0123-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T18:41:06Z","timestamp":1586198466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-005-0123-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4,7]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["123"],"URL":"https:\/\/doi.org\/10.1007\/s00446-005-0123-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4,7]]}}}