{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:55:33Z","timestamp":1770324933484,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,4,18]],"date-time":"2016-04-18T00:00:00Z","timestamp":1460937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Israel Science Foundation","award":["1138\/14"],"award-info":[{"award-number":["1138\/14"]}]},{"name":"Israeli Ministry of Science"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,4,18]]},"DOI":"10.1145\/2901318.2901343","type":"proceedings-article","created":{"date-parts":[[2016,4,12]],"date-time":"2016-04-12T12:23:12Z","timestamp":1460463792000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Optimizing distributed actor systems for dynamic interactive services"],"prefix":"10.1145","author":[{"given":"Andrew","family":"Newell","sequence":"first","affiliation":[{"name":"Purdue University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Kliot","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ishai","family":"Menache","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Gopalan","sequence":"additional","affiliation":[{"name":"Indian Institute of Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soramichi","family":"Akiyama","sequence":"additional","affiliation":[{"name":"University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Silberstein","sequence":"additional","affiliation":[{"name":"Technion"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,4,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"akka. http:\/\/akka.io\/.  akka. http:\/\/akka.io\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Event Tracing for Windows (ETW). https:\/\/msdn.microsoft.com\/en-us\/library\/windows\/desktop\/bb968803(v=vs.85).aspx.  Event Tracing for Windows (ETW). https:\/\/msdn.microsoft.com\/en-us\/library\/windows\/desktop\/bb968803(v=vs.85).aspx."},{"key":"e_1_3_2_1_3_1","unstructured":"Erlang. http:\/\/www.erlang.org\/.  Erlang. http:\/\/www.erlang.org\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Orleans. https:\/\/github.com\/dotnet\/orleans.  Orleans. https:\/\/github.com\/dotnet\/orleans."},{"key":"e_1_3_2_1_5_1","unstructured":"Who is using Orleans. http:\/\/dotnet.github.io\/orleans\/Who-Is-Using-Orleans.  Who is using Orleans. http:\/\/dotnet.github.io\/orleans\/Who-Is-Using-Orleans."},{"key":"e_1_3_2_1_6_1","unstructured":"Azure Reliable Actors. https:\/\/azure.microsoft.com\/en-us\/documentation\/articles\/service-fabric-reliable-actors-introduction\/.  Azure Reliable Actors. https:\/\/azure.microsoft.com\/en-us\/documentation\/articles\/service-fabric-reliable-actors-introduction\/."},{"key":"e_1_3_2_1_7_1","unstructured":"Apache Camel. https:\/\/projects.apache.org\/projects\/camel.html.  Apache Camel. https:\/\/projects.apache.org\/projects\/camel.html."},{"key":"e_1_3_2_1_8_1","unstructured":"Halo using Orleans. https:\/\/gigaom.com\/2014\/12\/15\/microsoft-open-sources-cloud-framework-that-powers-halo\/.  Halo using Orleans. https:\/\/gigaom.com\/2014\/12\/15\/microsoft-open-sources-cloud-framework-that-powers-halo\/."},{"key":"e_1_3_2_1_9_1","unstructured":"Orbit. https:\/\/github.com\/electronicarts\/orbit.  Orbit. https:\/\/github.com\/electronicarts\/orbit."},{"key":"e_1_3_2_1_10_1","unstructured":"SwiftMQ. http:\/\/www.swiftmq.com\/.  SwiftMQ. http:\/\/www.swiftmq.com\/."},{"key":"e_1_3_2_1_11_1","unstructured":"WhatsApp Scaling. http:\/\/www.erlang-factory.com\/upload\/presentations\/558\/efsf2012-whatsapp-scaling.pdf.  WhatsApp Scaling. http:\/\/www.erlang-factory.com\/upload\/presentations\/558\/efsf2012-whatsapp-scaling.pdf."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_1_14_1","volume-title":"Data networks","author":"Bertsekas D. P.","year":"1992","unstructured":"D. P. Bertsekas and R. G. Gallager . Data networks . Prentice-Hall International , 2 nd edition, 1992 . D. P. Bertsekas and R. G. Gallager. Data networks. Prentice-Hall International, 2nd edition, 1992.","edition":"2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294281"},{"key":"e_1_3_2_1_17_1","volume-title":"Distributed caching with memcached. Linux journal","author":"Fitzpatrick B.","year":"2004","unstructured":"B. Fitzpatrick . Distributed caching with memcached. Linux journal , 2004 (124):5, 2004. B. Fitzpatrick. Distributed caching with memcached. Linux journal, 2004(124):5, 2004."},{"key":"e_1_3_2_1_18_1","volume-title":"Stage scheduling for CPU-intensive servers","author":"Gordon M. E.","year":"2010","unstructured":"M. E. Gordon . Stage scheduling for CPU-intensive servers . University of Cambridge , Computer Laboratory , Technical Report, (UCAM-CL-TR-781), 2010 . M. E. Gordon. Stage scheduling for CPU-intensive servers. University of Cambridge, Computer Laboratory, Technical Report, (UCAM-CL-TR-781), 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"e_1_3_2_1_20_1","volume-title":"METIS: Unstructured graph partitioning and sparse matrix ordering system, version 2.0. Technical report","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar . METIS: Unstructured graph partitioning and sparse matrix ordering system, version 2.0. Technical report , University of Minnesota , 1995 . G. Karypis and V. Kumar. METIS: Unstructured graph partitioning and sparse matrix ordering system, version 2.0. Technical report, University of Minnesota, 1995."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496872"},{"key":"e_1_3_2_1_23_1","first-page":"31","volume-title":"Proc. of the Symposium on Operating Systems Design and Implementation (OSDI)","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . Graphchi: Large-scale graph computation on just a PC . In Proc. of the Symposium on Operating Systems Design and Implementation (OSDI) , pages 31 -- 46 , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a PC. In Proc. of the Symposium on Operating Systems Design and Implementation (OSDI), pages 31--46, 2012."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1169086.1169089"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2482626.2482663"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851227"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374415"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2013.13"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213957"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/502059.502057"}],"event":{"name":"EuroSys '16: Eleventh EuroSys Conference 2016","location":"London United Kingdom","acronym":"EuroSys '16"},"container-title":["Proceedings of the Eleventh European Conference on Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2901318.2901343","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2901318.2901343","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:43Z","timestamp":1750222483000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2901318.2901343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,18]]},"references-count":32,"alternative-id":["10.1145\/2901318.2901343","10.1145\/2901318"],"URL":"https:\/\/doi.org\/10.1145\/2901318.2901343","relation":{},"subject":[],"published":{"date-parts":[[2016,4,18]]},"assertion":[{"value":"2016-04-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}