{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:12:14Z","timestamp":1781017934551,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"National Science and Technology Council","award":["113-2221-E-A49-189-MY3"],"award-info":[{"award-number":["113-2221-E-A49-189-MY3"]}]},{"name":"National Science and Technology Council","award":["114-2221-E-A49-099-MY3"],"award-info":[{"award-number":["114-2221-E-A49-099-MY3"]}]},{"name":"National Science and Technology Council","award":["114-2221-E-007-056"],"award-info":[{"award-number":["114-2221-E-007-056"]}]},{"name":"National Science and Technology Council","award":["114-2221-E-007-062"],"award-info":[{"award-number":["114-2221-E-007-062"]}]},{"name":"German Academic Exchange Service (DAAD)","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,3,23]]},"DOI":"10.1145\/3748522.3779751","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:17:49Z","timestamp":1781014669000},"page":"342-348","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Sustaining B\u03b5-Tree Efficiency on Single-Access-Port Racetrack Memory in Cyber-Physical System"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1899-4370","authenticated-orcid":false,"given":"Yu-Shiang","family":"Tsai","sequence":"first","affiliation":[{"name":"National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5237-6441","authenticated-orcid":false,"given":"Max","family":"Geilert","sequence":"additional","affiliation":[{"name":"TU Dortmund University, Dortmund, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9992-9415","authenticated-orcid":false,"given":"Christian","family":"Hakert","sequence":"additional","affiliation":[{"name":"TU Dortmund University, Dortmund, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8114-9760","authenticated-orcid":false,"given":"Jian-Jia","family":"Chen","sequence":"additional","affiliation":[{"name":"TU Dortmund University, Dortmund, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1619-4335","authenticated-orcid":false,"given":"Shuo-Han","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6463\/aa7a98"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TED.2017.2769672"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1021\/acsnano.6b01337"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1145799"},{"key":"e_1_3_2_1_5_1","first-page":"185","article-title":"Tapecache: a high density, energy efficient cache based on domain wall memory","author":"Venkatesan R.","year":"2012","unstructured":"R. Venkatesan, V. Kozhikkottu, C. Augustine, A. Raychowdhury, K. Roy, and A. Raghunathan, \"Tapecache: a high density, energy efficient cache based on domain wall memory,\" in ACM\/IEEE International Symposium on Low Power Electronics and Design, 2012, p. 185\u2013190.","journal-title":"ACM\/IEEE International Symposium on Low Power Electronics and Design"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Y.-H. Yang S.-H. Chen and Y.-H. Chang \"Evolving skyrmion racetrack memory as energy-efficient last-level cache devices \" in ACM\/IEEE International Symposium on Low Power Electronics and Design 2022.","DOI":"10.1145\/3531437.3539709"},{"key":"e_1_3_2_1_7_1","first-page":"6","volume-title":"Deletion error correction based on polar codes in skyrmion racetrack memory,\" in IEEE Wireless Communications and Networking Conference (WCNC)","author":"Sun H.","year":"2021","unstructured":"H. Sun, R. Liu, K. Tian, T. Zou, and B. Feng, \"Deletion error correction based on polar codes in skyrmion racetrack memory,\" in IEEE Wireless Communications and Networking Conference (WCNC), 2021, pp. 1\u20136."},{"key":"e_1_3_2_1_8_1","first-page":"6","volume-title":"Permutation-write: Optimizing write performance and energy for skyrmion racetrack memory,\" in 57th ACM\/IEEE Design Automation Conference (DAC)","author":"Yang T.-Y.","year":"2020","unstructured":"T.-Y. Yang, M.-C. Yang, J. Li, and W. Kang, \"Permutation-write: Optimizing write performance and energy for skyrmion racetrack memory,\" in 57th ACM\/IEEE Design Automation Conference (DAC), 2020, pp. 1\u20136."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2024.3351917"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3012880"},{"key":"e_1_3_2_1_11_1","first-page":"1","article-title":"Sky-nn: Enabling efficient neural network data processing with skyrmion racetrack memory","author":"Liaw Y.-C.","year":"2023","unstructured":"Y.-C. Liaw, S.-H. Chen, Y.-H. Chang, and Y.-P. Liang, \"Sky-nn: Enabling efficient neural network data processing with skyrmion racetrack memory,\" in IEEE\/ACM International Symposium on Low Power Electronics and Design, 2023, pp. 1\u20136.","journal-title":"IEEE\/ACM International Symposium on Low Power Electronics and Design"},{"key":"e_1_3_2_1_12_1","first-page":"1116","volume-title":"Layout optimization of decision trees on racetrack memory,\" in 2021 58th ACM\/IEEE Design Automation Conference (DAC)","author":"Hakert C.","year":"2021","unstructured":"C. Hakert, A. A. Khan, K.-H. Chen, F. Hameed, J. Castrillon, and J.-J. Chen, \"Blowing trees to the ground: Layout optimization of decision trees on racetrack memory,\" in 2021 58th ACM\/IEEE Design Automation Conference (DAC), 2021, pp. 1111\u20131116."},{"key":"e_1_3_2_1_13_1","first-page":"12","volume-title":"Greenflag: Protecting 3d-racetrack memory from shift errors,\" in 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN)","author":"Mappouras G.","year":"2019","unstructured":"G. Mappouras, A. Vahid, R. Calderbank, and D.J. Sorin, \"Greenflag: Protecting 3d-racetrack memory from shift errors,\" in 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), 2019, pp. 1\u201312."},{"key":"e_1_3_2_1_14_1","first-page":"342","volume-title":"IEEE","author":"Archer S.","year":"2020","unstructured":"S. Archer, G. Mappouras, R. Calderbank, and D. Sorin, \"Foosball coding: Correcting shift errors and bit flip errors in 3d racetrack memory,\" in 2020 50th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN). IEEE, 2020, pp. 331\u2013342."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"issue":"5","key":"e_1_3_2_1_16_1","article-title":"An introduction to b\u03b5-trees and write-optimization,\" log","volume":"40","author":"Bender M. A.","year":"2015","unstructured":"M. A. Bender, M. Farach-Colton, W. Jannen, R. Johnson, B. C. Kuszmaul, D. E. Porter, J. Yuan, and Y. Zhan, \"An introduction to b\u03b5-trees and write-optimization,\" login Usenix Mag., vol. 40, no. 5, 2015.","journal-title":"Usenix Mag."},{"key":"e_1_3_2_1_17_1","first-page":"315","volume-title":"BetrFS: A Right-Optimized Write-Optimized file system,\" in 13th USENIX Conference on File and Storage Technologies","author":"Jannen W.","year":"2015","unstructured":"W. Jannen, J. Yuan, Y. Zhan, A. Akshintala, J. Esmet, Y. Jiao, A. Mittal, P. Pandey, P. Reddy, L. Walsh, M. Bender, M. Farach-Colton, R. Johnson, B. C. Kuszmaul, and D. E. Porter, \"BetrFS: A Right-Optimized Write-Optimized file system,\" in 13th USENIX Conference on File and Storage Technologies, 2015, pp. 301\u2013315."},{"key":"e_1_3_2_1_18_1","volume-title":"Embracing the batch updates of b\u03b5-trees through access port parallelism on skyrmion racetrack memory","author":"Tsai Y.-S.","year":"2024","unstructured":"Y.-S. Tsai, S.-H. Chen, M. Noorlander, and K.-H. Chen, \"Sky\u03b5-tree: Embracing the batch updates of b\u03b5-trees through access port parallelism on skyrmion racetrack memory,\" 2024. [Online]. Available: https:\/\/arxiv.org\/abs\/2407.17499"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3566097.3567854"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372489"},{"key":"e_1_3_2_1_21_1","first-page":"82","volume-title":"Closing the b+-tree vs. lsm-tree write amplification gap on modern storage hardware with built-in transparent compression,\" in 20th USENIX Conference on File and Storage Technologies","author":"Qiao Y.","year":"2022","unstructured":"Y. Qiao, X. Chen, N. Zheng, J. Li, Y. Liu, and T. Zhang, \"Closing the b+-tree vs. lsm-tree write amplification gap on modern storage hardware with built-in transparent compression,\" in 20th USENIX Conference on File and Storage Technologies, 2022, pp. 69\u201382."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1021\/acsnano.7b05105"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2333660.2333707"}],"event":{"name":"SAC '26: 41st ACM\/SIGAPP Symposium on Applied Computing","location":"Grand Hotel Palace Thessaloniki Greece","acronym":"SAC '26","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 41st ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748522.3779751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:18:22Z","timestamp":1781014702000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748522.3779751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":23,"alternative-id":["10.1145\/3748522.3779751","10.1145\/3748522"],"URL":"https:\/\/doi.org\/10.1145\/3748522.3779751","relation":{},"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}