{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:14Z","timestamp":1750307594459,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,1,27]],"date-time":"2010-01-27T00:00:00Z","timestamp":1264550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2010,1,27]]},"abstract":"<jats:p>Code-Partitioning Gossip (CPG) is a novel technique to facilitate implementation and analysis of gossip protocols. A gossip exchange is a pair-wise transaction between two nodes; a gossip system executes an endless sequence of exchanges between nodes chosen by a randomized procedure. Using CPG, the effects of a gossip exchange are succinctly defined by a single function that atomically updates a pair of node states based on their previous values. This function is automatically partitioned via program slicing into executable code for the roles of gossip-initiator and gossip-recipient, and networking code is added automatically. CPG may have concrete benefits for protocol analysis and authoring composite gossip protocols.<\/jats:p>","DOI":"10.1145\/1713254.1713264","type":"journal-article","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T13:33:51Z","timestamp":1265117631000},"page":"40-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Code-partitioning gossip"],"prefix":"10.1145","volume":"43","author":[{"given":"Lonnie","family":"Princehouse","sequence":"first","affiliation":[{"name":"Cornell University"}]},{"given":"Ken","family":"Birman","sequence":"additional","affiliation":[{"name":"Cornell University"}]}],"member":"320","published-online":{"date-parts":[[2010,1,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/312203.312207"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294265"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_2_1_4_1","volume-title":"The MIT Press","author":"Dolev. Self-Stabilization S.","year":"2000","unstructured":"S. Dolev. Self-Stabilization . The MIT Press , 2000 . S. Dolev. Self-Stabilization. The MIT Press, 2000."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400820"},{"key":"e_1_2_1_6_1","volume-title":"IPTPS 2008: Proceedings of the 7th International Workshop on Peer-to-Peer Systems","author":"Haridasan M.","year":"2008","unstructured":"M. Haridasan and R. van Renesse . Gossip-based distribution estimation in peer-to-peer networks . In IPTPS 2008: Proceedings of the 7th International Workshop on Peer-to-Peer Systems , 2008 . M. Haridasan and R. van Renesse. Gossip-based distribution estimation in peer-to-peer networks. In IPTPS 2008: Proceedings of the 7th International Workshop on Peer-to-Peer Systems, 2008."},{"key":"e_1_2_1_7_1","volume-title":"T-man: Fast gossip-based constructions of large-scale overlay topologies. Technical report","author":"Jelasity M.","year":"2004","unstructured":"M. Jelasity and O. Babaoglu . T-man: Fast gossip-based constructions of large-scale overlay topologies. Technical report , 2004 . M. Jelasity and O. Babaoglu. T-man: Fast gossip-based constructions of large-scale overlay topologies. Technical report, 2004."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082469.1082470"},{"key":"e_1_2_1_9_1","first-page":"163","volume-title":"Spatial gossip and resource location protocols","author":"Kempe D.","year":"2001","unstructured":"D. Kempe , J. Kleinberg , and A. Demers . Spatial gossip and resource location protocols . pages 163 -- 172 . ACM Press , 2001 . D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. pages 163--172. ACM Press, 2001."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789074.1789100"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146402"},{"key":"e_1_2_1_12_1","volume-title":"Macedon: Methodology for automatically creating, evaluating, and designing overlay networks. Technical report","author":"Rodriguez A.","year":"2003","unstructured":"A. Rodriguez , S. Bhat , C. Killian , D. Dostic , and A. Vahdat . Macedon: Methodology for automatically creating, evaluating, and designing overlay networks. Technical report , Duke University , July 2003 . A. Rodriguez, S. Bhat, C. Killian, D. Dostic, and A. Vahdat. Macedon: Methodology for automatically creating, evaluating, and designing overlay networks. Technical report, Duke University, July 2003."},{"key":"e_1_2_1_13_1","volume-title":"Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems","author":"Rowstron A.","year":"2001","unstructured":"A. Rowstron and P. Druschel . Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems , 2001 . A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, 2001."},{"key":"e_1_2_1_14_1","first-page":"149","volume-title":"Chord: A scalable peer-to-peer lookup service for internet applications","author":"Stoica I.","year":"2001","unstructured":"I. Stoica , R. Morris , D. Karger , M.F. Kaashoek , and H. Balakrishnan . Chord: A scalable peer-to-peer lookup service for internet applications . pages 149 -- 160 , 2001 . I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. pages 149--160, 2001."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/762483.762485"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/800078.802557"},{"key":"e_1_2_1_17_1","volume-title":"Untrusted hosts and confidentiality: Secure program partitioning","author":"Zdancewic S.","year":"2001","unstructured":"S. Zdancewic , L. Zheng , N. Nystrom , and A.C. Myers . Untrusted hosts and confidentiality: Secure program partitioning , 2001 . S. Zdancewic, L. Zheng, N. Nystrom, and A.C. Myers. Untrusted hosts and confidentiality: Secure program partitioning, 2001."}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1713254.1713264","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1713254.1713264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:35Z","timestamp":1750250495000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1713254.1713264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,27]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,1,27]]}},"alternative-id":["10.1145\/1713254.1713264"],"URL":"https:\/\/doi.org\/10.1145\/1713254.1713264","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2010,1,27]]},"assertion":[{"value":"2010-01-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}