{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:20:09Z","timestamp":1752985209289,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"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":[],"published-print":{"date-parts":[[2019,10,22]]},"DOI":"10.1145\/3358499.3361224","type":"proceedings-article","created":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T15:16:45Z","timestamp":1570807005000},"page":"41-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Run, actor, run: towards cross-actor language benchmarking"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Blessing","sequence":"first","affiliation":[{"name":"Imperial College London, UK"}]},{"given":"Kiko","family":"Fernandez-Reyes","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}]},{"given":"Albert Mingkun","family":"Yang","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}]},{"given":"Sophia","family":"Drossopoulou","sequence":"additional","affiliation":[{"name":"Imperial College London, UK"}]},{"given":"Tobias","family":"Wrigstad","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2019,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2019. CAF C++ Actor Framework version 0.17. http:\/\/www.actorframework.org\/pdf\/manual.pdf  2019. CAF C++ Actor Framework version 0.17. http:\/\/www.actorframework.org\/pdf\/manual.pdf"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/7929"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Beatrice \u00c5kerblom Elias Castegren and Tobias Wrigstad. 2020. Reference Capabilities for Safe Parallel Array Programming. The Art Science and Engineering of Programming (2020). To appear.  Beatrice \u00c5kerblom Elias Castegren and Tobias Wrigstad. 2020. Reference Capabilities for Safe Parallel Array Programming. The Art Science and Engineering of Programming (2020). To appear.","DOI":"10.22152\/programming-journal.org\/2020\/4\/1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2712386.2712404"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.06.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1238844.1238850"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364489.2364495"},{"key":"e_1_3_2_1_8_1","unstructured":"Sebastian Blessing. 2013. A String of Ponies. Transparent Distributed Programming with Actors. Master\u2019s thesis. Imperial College of Science. https:\/\/www.doc.ic.ac.uk\/~scb12\/publications\/s.blessing.pdf  Sebastian Blessing. 2013. A String of Ponies. Transparent Distributed Programming with Actors. Master\u2019s thesis. Imperial College of Science. https:\/\/www.doc.ic.ac.uk\/~scb12\/publications\/s.blessing.pdf"},{"key":"e_1_3_2_1_9_1","unstructured":"Sebastian Blessing. 2019. GitHub - Pony Savina. https:\/\/github.com\/ sblessing\/pony-savina . (2019). Accessed: 2019-08-13.  Sebastian Blessing. 2019. GitHub - Pony Savina. https:\/\/github.com\/ sblessing\/pony-savina . (2019). Accessed: 2019-08-13."},{"key":"e_1_3_2_1_10_1","unstructured":"Sebastian Blessing. 2019. Savina Results - Medium Machine. https: \/\/www.doc.ic.ac.uk\/~scb12\/pony.html . (2019). Accessed: 2019-08-13.  Sebastian Blessing. 2019. Savina Results - Medium Machine. https: \/\/www.doc.ic.ac.uk\/~scb12\/pony.html . (2019). Accessed: 2019-08-13."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18941-3_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Denis Caromel Christian Delbe Alexandre Di Costanzo and Mario Leyton. 2006. ProActive: an integrated platform for programming and running applications on grids and P2P systems. Computational Methods in Science and Technology 12 (2006) issue 1. https:\/\/hal.archivesouvertes.fr\/hal-00125034  Denis Caromel Christian Delbe Alexandre Di Costanzo and Mario Leyton. 2006. ProActive: an integrated platform for programming and running applications on grids and P2P systems. Computational Methods in Science and Technology 12 (2006) issue 1. https:\/\/hal.archivesouvertes.fr\/hal-00125034","DOI":"10.12921\/cmst.2006.12.01.69-77"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2687357.2687363"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cl.2016.01.002"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509557"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2824815.2824816"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133896"},{"key":"e_1_3_2_1_18_1","unstructured":"The TPC consortium. 2019. TPC-C - An On-Line Transaction Processing Benchmark. http:\/\/www.tpc.org\/tpcc\/default.asp . (2019). Accessed: 2019-08-13.  The TPC consortium. 2019. TPC-C - An On-Line Transaction Processing Benchmark. http:\/\/www.tpc.org\/tpcc\/default.asp . (2019). Accessed: 2019-08-13."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11785477_16"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029873.1029879"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Edsger W. Dijkstra. 2002. The Origin of Concurrent Programming. Springer-Verlag New York Inc. New York NY USA Chapter Cooperating Sequential Processes 65\u2013138. http:\/\/dl.acm.org\/citation.cfm?id= 762971.762974  Edsger W. Dijkstra. 2002. The Origin of Concurrent Programming. Springer-Verlag New York Inc. New York NY USA Chapter Cooperating Sequential Processes 65\u2013138. http:\/\/dl.acm.org\/citation.cfm?id= 762971.762974","DOI":"10.1007\/978-1-4757-3472-0_2"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89884-1_31"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094091.2094096"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.019"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Peter E. Hart Nils J. Nilsson and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2) (1968) 100\u2013 107.  Peter E. Hart Nils J. Nilsson and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2) (1968) 100\u2013 107.","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1624775.1624804"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/355620.361161"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359585"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Samuel Horsley. 1772. The Sieve of Eratosthenes. Being an Account of His Method of Finding All the Prime Numbers by the Rev. Samuel Horsley F. R. S. Philosophical Transactions (1683-1775) 62 (1772) 327\u2013 347.  Samuel Horsley. 1772. The Sieve of Eratosthenes. Being an Account of His Method of Finding All the Prime Numbers by the Rev. Samuel Horsley F. R. S. Philosophical Transactions (1683-1775) 62 (1772) 327\u2013 347.","DOI":"10.1098\/rstl.1772.0023"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2687357.2687368"},{"key":"e_1_3_2_1_31_1","unstructured":"Shams M. Imam and Vivek Sarkar. 2019. GitHub - Savina. https: \/\/github.com\/shamsimam\/savina . (2019). Accessed: 2019-08-13.  Shams M. Imam and Vivek Sarkar. 2019. GitHub - Savina. https: \/\/github.com\/shamsimam\/savina . (2019). Accessed: 2019-08-13."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25271-6_8"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384641"},{"key":"e_1_3_2_1_34_1","unstructured":"Suhas S. Patil. 1971. Limitations and capabilities of dijkstra\u2019s semaphore primitives for coordination among processes.  Suhas S. Patil. 1971. Limitations and capabilities of dijkstra\u2019s semaphore primitives for coordination among processes."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Tasharofi Samira Dinges Peter and Johnson Ralph. 2012. Why Do Scala Developers Mix the Actor Modelwith Other Concurrency Models?. In ECOOP.  Tasharofi Samira Dinges Peter and Johnson Ralph. 2012. Why Do Scala Developers Mix the Actor Modelwith Other Concurrency Models?. In ECOOP.","DOI":"10.1007\/978-3-642-39038-8_13"},{"key":"e_1_3_2_1_36_1","unstructured":"Dave Thomas. 2018. Programming Elixir \u2265 1.6: Functional |> Concurrent |> Pragmatic |> Fun. Pragmatic Bookshelf.  Dave Thomas. 2018. Programming Elixir \u2265 1.6: Functional |> Concurrent |> Pragmatic |> Fun. Pragmatic Bookshelf."},{"key":"e_1_3_2_1_37_1","unstructured":"Sebastian Woelke. 2019. GitHub - CAF Fork Savina. https:\/\/github. com\/woelke\/savina . (2019). Accessed: 2019-08-13.  Sebastian Woelke. 2019. GitHub - CAF Fork Savina. https:\/\/github. com\/woelke\/savina . (2019). Accessed: 2019-08-13."},{"key":"e_1_3_2_1_38_1","unstructured":"Derek Wyatt. 2013. Akka Concurrency. Artima.  Derek Wyatt. 2013. Akka Concurrency. Artima."}],"event":{"name":"SPLASH '19: 2019 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Athens Greece","acronym":"SPLASH '19"},"container-title":["Proceedings of the 9th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3358499.3361224","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3358499.3361224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:12Z","timestamp":1750202592000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3358499.3361224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,22]]},"references-count":38,"alternative-id":["10.1145\/3358499.3361224","10.1145\/3358499"],"URL":"https:\/\/doi.org\/10.1145\/3358499.3361224","relation":{},"subject":[],"published":{"date-parts":[[2019,10,22]]},"assertion":[{"value":"2019-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}