{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T03:07:41Z","timestamp":1780456061415,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031998713","type":"print"},{"value":"9783031998720","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-99872-0_3","type":"book-chapter","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T11:08:55Z","timestamp":1755774535000},"page":"33-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Byzantine-Tolerant Consensus in\u00a0GPU-Inspired Shared Memory"],"prefix":"10.1007","author":[{"given":"Chryssis","family":"Georgiou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manaswini","family":"Piduguralla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"3_CR1","unstructured":"Alon, N., Merritt, M., Reingold, O., Taubenfeld, G., Wright, R.N.: Tight bounds for shared memory systems accessed by Byzantine processes. Distrib. Comput"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0020-0190(01)00334-9","volume":"83","author":"P Attie","year":"2002","unstructured":"Attie, P.: Wait-free Byzantine consensus. Inf. Process. Lett. 83(4), 221\u2013227 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1109\/TPDS.2008.96","volume":"20","author":"AN Bessani","year":"2009","unstructured":"Bessani, A.N., Correia, M., da Silva Fraga, J., Cheuk Lung, L.: Sharing memory between byzantine processes using policy-enforced tuple spaces. IEEE Trans. Parallel Distrib. Syst. 20(3), 419\u2013432 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Cini, N., Yalcin, G.: A methodology for comparing the reliability of GPU-based and CPU-based HPCs. ACM Comput. Surv. 53(1) (2020)","DOI":"10.1145\/3372790"},{"key":"3_CR5","unstructured":"Cohen, S., Keidar, I.: Tame the wild with byzantine linearizability: reliable broadcast, snapshots, and asset transfer. In: DISC 2021, pp. 18:1\u201318:18 (2021)"},{"key":"3_CR6","unstructured":"Corporation, N.: CUDA C++ programming guide (2024), https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/, Accessed 12 Mar 2025"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Piduguralla, M., Peri, S.: Byzantine-tolerant consensus in GPU-inspired shared memory (2025), https:\/\/arxiv.org\/abs\/2503.12788","DOI":"10.1007\/978-3-031-99872-0_3"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: 26th SOSP, pp. 51\u201368 (2017)","DOI":"10.1145\/3132747.3132757"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991). https:\/\/doi.org\/10.1145\/114005.102808","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR10","unstructured":"Hu, X., Toueg, S.: On implementing SWMR registers from SWSR registers in systems with byzantine failures. CoRR abs\/2207.01470 (2022)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Huang, Y., Guo, S., Di, S., Li, G., Cappello, F.: Mitigating silent data corruptions in HPC applications across multiple program inputs. In: SC22, pp. 1\u201314 (2022)","DOI":"10.1109\/SC41404.2022.00022"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Jeon, H.: GPU Architecture, pp. 531\u2013559. Springer Nature Singapore (2025)","DOI":"10.1007\/978-981-97-9314-3_66"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Kirk, D.B., mei W.\u00a0Hwu, W.: Chapter 4 - memory and data locality. In: Programming Massively Parallel Processors (Third Edition), pp. 71\u2013101 (2017)","DOI":"10.1016\/B978-0-12-811986-0.00004-2"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Kolesnichenko, A., Poskitt, C.M., Nanz, S.: SafeGPU: contract- and library-based GPGPU for object-oriented languages. Comput. Lang. Syst. Struct. 48 (2017), special Issue on the 14th International Conference on GPCE","DOI":"10.1016\/j.cl.2016.08.002"},{"key":"3_CR15","unstructured":"Kowalski, V., Most\u00e9faoui, A., Perrin, M.: Atomic register abstractions for byzantine-prone distributed systems. In: OPODIS 2023 (2023)"},{"key":"3_CR16","unstructured":"Kshemkalyani, A.D., Singhal, M.: Distributed Computing: Principles, Algorithms, and Systems. 1st edn. Cambridge University Press (2011)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","DOI":"10.1145\/357172.357176"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Liu, J., Li, W., Karame, G.O., Asokan, N.: Scalable byzantine consensus via hardware-assisted secret sharing. IEEE Trans. Comput. 68(1) (2019)","DOI":"10.1109\/TC.2018.2860009"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Maitre, O.: Understanding nvidia gpgpu hardware. In: Massively Parallel Evolutionary Computation on GPGPUs, pp. 15\u201334 (2013)","DOI":"10.1007\/978-3-642-37959-8_2"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Merritt, M., Reiter, M.K., Taubenfeld, G.: Objects shared by byzantine processes. Distrib. Comput. 16(1), 37\u201348 (2003)","DOI":"10.1007\/s00446-002-0075-3"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Olmedo, I.S., Capodieci, N., Martinez, J.L., Marongiu, A., Bertogna, M.: Dissecting the cuda scheduling hierarchy: a performance and predictability perspective. In: IEEE RTAS 2020, pp. 213\u2013225 (2020)","DOI":"10.1109\/RTAS48715.2020.000-5"},{"issue":"184","key":"3_CR23","first-page":"4","volume":"2009","author":"CS Pabla","year":"2009","unstructured":"Pabla, C.S.: Completely fair scheduler. Linux J. 2009(184), 4 (2009)","journal-title":"Linux J."},{"key":"3_CR24","unstructured":"Sheldon, R.: Worm (write once, read many) (2022), https:\/\/www.techtarget.com\/searchstorage\/definition\/WORM-write-once-read-many"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Weaver, A., et al.: Granularity- and interference-aware gpu sharing with mps. In: SC24-W: Workshops of SC24, pp. 1630\u20131637 (2024)","DOI":"10.1109\/SCW63240.2024.00203"},{"issue":"5","key":"3_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1400097.1400102","volume":"42","author":"CS Wong","year":"2008","unstructured":"Wong, C.S., Tan, I., Kumari, R.D., Wey, F.: Towards achieving fairness in the Linux scheduler. ACM SIGOPS Operat. Syst. Rev. 42(5), 34\u201343 (2008)","journal-title":"ACM SIGOPS Operat. Syst. Rev."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2025: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99872-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:26:23Z","timestamp":1780406783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99872-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"ISBN":["9783031998713","9783031998720"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99872-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"22 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}