{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T05:56:02Z","timestamp":1770962162247,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031856969","type":"print"},{"value":"9783031856976","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-85697-6_6","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T05:07:31Z","timestamp":1743570451000},"page":"85-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploring the\u00a0Design Space for\u00a0Message-Driven Systems for\u00a0Dynamic Graph Processing Using CCA"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8228-6273","authenticated-orcid":false,"given":"Bibrak Qamar","family":"Chandio","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7154-8642","authenticated-orcid":false,"given":"Maciej","family":"Brodowicz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3554-9931","authenticated-orcid":false,"given":"Thomas","family":"Sterling","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"6_CR1","unstructured":"Data Sets $$|$$ GraphChallenge \u2014 graphchallenge.mit.edu (2017). https:\/\/graphchallenge.mit.edu\/data-sets#PartitionDatasets. Accessed 14 Jan 2024"},{"key":"6_CR2","unstructured":"CCA-simulator: simulator for continuum computer architecture (CCA) class of designs (2024). https:\/\/github.com\/bibrakc\/CCA-Simulator\/tree\/main. Accessed 21 May 2024"},{"key":"6_CR3","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1086.001.0001","volume-title":"Actors: A Model of Concurrent Computation in Distributed Systems","author":"G Agha","year":"1986","unstructured":"Agha, G.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge, MA, USA (1986)"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Ahn, J., Hong, S., Yoo, S., Mutlu, O., Choi, K.: A scalable processing-in-memory accelerator for parallel graph processing. In: 2015 ACM\/IEEE 42nd Annual International Symposium on Computer Architecture (ISCA), pp. 105\u2013117 (2015). https:\/\/doi.org\/10.1145\/2749469.2750386","DOI":"10.1145\/2749469.2750386"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Arvind, Culler, D.E.: Dataflow architectures. Ann. Rev. Comput. Sci. 1(1), 225\u2013253 (1986). https:\/\/doi.org\/10.1146\/annurev.cs.01.060186.001301","DOI":"10.1146\/annurev.cs.01.060186.001301"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Backus, J.: Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Commun. ACM 21(8), 613\u2013641 (1978). https:\/\/doi.org\/10.1145\/359576.359579","DOI":"10.1145\/359576.359579"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Brodowicz, M., Sterling, T., Anderson, M.: Continuum computing - on a new performance trajectory beyond exascale. Supercomput. Front. Innov. 5(3), 5\u201324 (2018). https:\/\/doi.org\/10.14529\/jsfi180301. https:\/\/superfri.org\/index.php\/superfri\/article\/view\/188","DOI":"10.14529\/jsfi180301"},{"key":"6_CR8","unstructured":"Chandio, B.Q., Srivastava, P., Brodowicz, M., Swany, M., Sterling, T.: Rhizomes and diffusions for processing highly skewed graphs on fine-grain message-driven systems (2024). https:\/\/arxiv.org\/abs\/2402.06086"},{"key":"6_CR9","unstructured":"Cipar, J., et al.: Solving the straggler problem with bounded staleness. In: Proceedings of the 14th USENIX Conference on Hot Topics in Operating Systems, HotOS 2013, p.\u00a022. USENIX Association, USA (2013)"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Ditzel, D.R., Patterson, D.A.: Retrospective on high-level language computer architecture. In: Proceedings of the 7th Annual Symposium on Computer Architecture, ISCA 1980, pp. 97\u2013104. Association for Computing Machinery, New York, NY, USA (1980). https:\/\/doi.org\/10.1145\/800053.801914","DOI":"10.1145\/800053.801914"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"von Eicken, T., Culler, D.E., Goldstein, S.C., Schauser, K.E.: Active messages: a mechanism for integrated communication and computation. In: Proceedings of the 19th Annual International Symposium on Computer Architecture, ISCA 1992, pp. 256\u2013266. Association for Computing Machinery, New York, NY, USA (1992). https:\/\/doi.org\/10.1145\/139669.140382","DOI":"10.1145\/139669.140382"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11811220_11","volume-title":"Knowledge Science, Engineering and Management","author":"SE Fahlman","year":"2006","unstructured":"Fahlman, S.E.: Marker-passing inference in the scone knowledge-base system. In: Lang, J., Lin, F., Wang, J. (eds.) KSEM 2006. LNCS (LNAI), vol. 4092, pp. 114\u2013126. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11811220_11"},{"key":"6_CR13","unstructured":"Fahlman, S.E., Hinton, G.E., Sejnowski, T.J.: Massively parallel architectures for AI: Netl, Thistle, and Boltzmann machines. In: Proceedings of the Third AAAI Conference on Artificial Intelligence, AAAI 1983, pp. 109\u2013113. AAAI Press (1983)"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Feustel, E.A.: On the advantages of tagged architecture. IEEE Trans. Comput. 22(7), 644\u2013656 (1973). https:\/\/doi.org\/10.1109\/TC.1973.5009130","DOI":"10.1109\/TC.1973.5009130"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Gabriel, R.P.: Performance and Evaluation of LISP Systems. Massachusetts Institute of Technology, USA (1985)","DOI":"10.7551\/mitpress\/5298.001.0001"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Hewitt, C.: Actor model of computation: scalable robust information systems (2010). https:\/\/doi.org\/10.48550\/ARXIV.1008.1459. https:\/\/arxiv.org\/abs\/1008.1459","DOI":"10.48550\/ARXIV.1008.1459"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Jung, D.C., Davidson, S., Zhao, C., Richmond, D., Taylor, M.B.: Ruche networks: wire-maximal, no-fuss NoCs : special session paper. In: 2020 14th IEEE\/ACM International Symposium on Networks-on-Chip (NOCS), pp.\u00a01\u20138 (2020). https:\/\/doi.org\/10.1109\/NOCS50636.2020.9241586","DOI":"10.1109\/NOCS50636.2020.9241586"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Kao, E., et al.: Streaming graph challenge: stochastic block partition. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, September 2017. https:\/\/doi.org\/10.1109\/hpec.2017.8091040","DOI":"10.1109\/hpec.2017.8091040"},{"key":"6_CR19","unstructured":"Kao, E.K., et al.: Streaming graph challenge: stochastic block partition. CoRR abs\/1708.07883 (2017). http:\/\/arxiv.org\/abs\/1708.07883"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Lakhotia, K., et al.: PolarFly: a cost-effective and flexible low-diameter topology. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2022. IEEE Press (2022)","DOI":"10.1109\/SC41404.2022.00017"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Linial, N.: Distributive graph algorithms global solutions from local data. In: 28th Annual Symposium on Foundations of Computer Science (SFCS 1987), pp. 331\u2013335 (1987). https:\/\/doi.org\/10.1109\/SFCS.1987.20","DOI":"10.1109\/SFCS.1987.20"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Noakes, M.D., Wallach, D.A., Dally, W.J.: The J-machine multicomputer: an architectural evaluation. In: Proceedings of the 20th Annual International Symposium on Computer Architecture, ISCA 1993, pp. 224\u2013235. Association for Computing Machinery, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/165123.165158","DOI":"10.1145\/165123.165158"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Orenes-Vera, M., Tureci, E., Wentzlaff, D., Martonosi, M.: Dalorex: a data-local program execution and architecture for memory-bound applications. In: 2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp. 718\u2013730. IEEE Computer Society, Los Alamitos, CA, USA, March 2023. https:\/\/doi.org\/10.1109\/HPCA56546.2023.10071089. https:\/\/doi.ieeecomputersociety.org\/10.1109\/HPCA56546.2023.10071089","DOI":"10.1109\/HPCA56546.2023.10071089"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Pollack, F.J., Cox, G.W., Hammerstrom, D.W., Kahn, K.C., Lai, K.K., Rattner, J.R.: Supporting ADA memory management in the IAPX-432. SIGPLAN Not. 17(4), 117\u2013131 (1982). https:\/\/doi.org\/10.1145\/960120.801835","DOI":"10.1145\/960120.801835"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Sterling, T., Bergman, L.: A design analysis of a hybrid technology multithreaded architecture for petaflops scale computation3. In: Proceedings of the 13th International Conference on Supercomputing, ICS 1999, pp. 286\u2013293. Association for Computing Machinery, New York, NY, USA (1999). https:\/\/doi.org\/10.1145\/305138.305205","DOI":"10.1145\/305138.305205"},{"key":"6_CR26","unstructured":"Vortex, D.: HPCC random access benchmark excels on data vortex\u2122. In: White Paper, June 2016. https:\/\/www.datavortex.com\/wp-content\/uploads\/2017\/05\/HPCC-Random-Access-Benchmark-Excels-on-Data-Vortex.pdf"},{"key":"6_CR27","unstructured":"Wolfram, S.: Cellular automata as simple self-organizing systems (1982)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-85697-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T05:07:44Z","timestamp":1743570464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-85697-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031856969","9783031856976"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-85697-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ostrava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppam.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}