{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IGORLB57XQSRV7YOISOF7OAQET","short_pith_number":"pith:IGORLB57","schema_version":"1.0","canonical_sha256":"419d1587bfbc251aff0e449c5fb81024e369140c287470b24a5dab5908ffd431","source":{"kind":"arxiv","id":"2605.13398","version":1},"attestation_state":"computed","paper":{"title":"FPGA-Accelerated Lock Management and Transaction Processing: Architecture, Optimization, and Design Space Exploration","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Hardware lock agents on FPGA eliminate DRAM accesses to deliver up to 51 times the transaction throughput of CPU baselines in OLTP systems.","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.AR","authors_text":"Gustavo Alonso, Shien Zhu","submitted_at":"2026-05-13T11:53:59Z","abstract_excerpt":"Online Transaction Processing (OLTP) is a classic application with a growing business. CPU-based OLTP has low lock serving efficiency. The main reason is that most locks are cold, and the lock agent must issue frequent memory accesses to retrieve the lock details to determine whether to grant it. This motivates us to propose dedicated hardware-based lock agents with integrated lock tables to remove the DRAM access overhead.\n  In this paper, we propose hardware-accelerated lock management and transaction processing for database systems. First, we propose a low-latency lock agent optimized for b"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13398","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-13T11:53:59Z","cross_cats_sorted":["cs.DB","cs.DC"],"title_canon_sha256":"18f9ecd9759a4fc3b951e678bb96fc61a7205baa5124604fde236fc27533a5d1","abstract_canon_sha256":"e70feb220a930c1b65e3b0422a517f965117369bfb99ed989a23558cb90b47e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:47.623707Z","signature_b64":"WBIn1MyMf4Ikeh3E8lL08Ez1YLnxLzHk3X9iqhI2m0GPby6ORZ+f1W+Ub3AG23AqEEJUdsmcLKxf3jSq0DaGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"419d1587bfbc251aff0e449c5fb81024e369140c287470b24a5dab5908ffd431","last_reissued_at":"2026-05-18T02:44:47.623276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:47.623276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPGA-Accelerated Lock Management and Transaction Processing: Architecture, Optimization, and Design Space Exploration","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Hardware lock agents on FPGA eliminate DRAM accesses to deliver up to 51 times the transaction throughput of CPU baselines in OLTP systems.","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.AR","authors_text":"Gustavo Alonso, Shien Zhu","submitted_at":"2026-05-13T11:53:59Z","abstract_excerpt":"Online Transaction Processing (OLTP) is a classic application with a growing business. CPU-based OLTP has low lock serving efficiency. The main reason is that most locks are cold, and the lock agent must issue frequent memory accesses to retrieve the lock details to determine whether to grant it. This motivates us to propose dedicated hardware-based lock agents with integrated lock tables to remove the DRAM access overhead.\n  In this paper, we propose hardware-accelerated lock management and transaction processing for database systems. First, we propose a low-latency lock agent optimized for b"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The experiment results show up to 51X higher transaction throughput over the CPU baseline on the TPC-C benchmark.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the FPGA design can sustain the reported throughput at scale without new bottlenecks in interconnect, memory hierarchy, or transaction coordination outside the lock agent.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FPGA lock agents with on-chip tables achieve up to 51X higher TPC-C throughput than CPU baselines by removing DRAM access overhead for lock operations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Hardware lock agents on FPGA eliminate DRAM accesses to deliver up to 51 times the transaction throughput of CPU baselines in OLTP systems.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"dd8b4146fba1b3c9b0d952b9e2f2c55641978e86cdd1a8efd8528679a37f95f1"},"source":{"id":"2605.13398","kind":"arxiv","version":1},"verdict":{"id":"ec975e66-9fa5-4899-8f5c-62a04dc25758","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:39:21.072524Z","strongest_claim":"The experiment results show up to 51X higher transaction throughput over the CPU baseline on the TPC-C benchmark.","one_line_summary":"FPGA lock agents with on-chip tables achieve up to 51X higher TPC-C throughput than CPU baselines by removing DRAM access overhead for lock operations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the FPGA design can sustain the reported throughput at scale without new bottlenecks in interconnect, memory hierarchy, or transaction coordination outside the lock agent.","pith_extraction_headline":"Hardware lock agents on FPGA eliminate DRAM accesses to deliver up to 51 times the transaction throughput of CPU baselines in OLTP systems."},"references":{"count":36,"sample":[{"doi":"","year":2019,"title":"Claude Barthels, Ingo Müller, Konstantin Taranov, Gustavo Alonso, and Torsten Hoefler. 2019. Strong consistency is not hard to get: Two-Phase Locking and Two-Phase Commit on Thousands of Cores.Proceed","work_id":"c141f583-02c6-43c5-9ce5-f0710a192d9d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1995,"title":"Hal Berenson, Phil Bernstein, Jim Gray, Jim Melton, Elizabeth O’Neil, and Patrick O’Neil. 1995. A critique of ANSI SQL isolation levels. InProceedings of the 1995 ACM SIGMOD International Conference o","work_id":"aaad934b-6db4-4f1d-a3a7-ee92c2d84cd4","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1987,"title":"Bernstein, Vassos Hadzilacos, and Nathan Goodman","work_id":"f3393e5a-539f-449a-8b4a-4cb1d102c249","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Wei Cao, Feifei Li, Gui Huang, Jianghang Lou, Jianwei Zhao, Dengcheng He, Mengshi Sun, Yingqiang Zhang, Sheng Wang, Xueqiang Wu, et al. 2022. Polardb- x: An elastic distributed relational database for","work_id":"249a6571-1b31-4c91-bbd0-93ff846f3a25","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Wei Cao, Yang Liu, Zhushi Cheng, Ning Zheng, Wei Li, Wenjie Wu, Linqiang Ouyang, Peng Wang, Yijing Wang, Ray Kuan, Zhenjun Liu, Feng Zhu, and Tong Zhang. 2020. POLARDB meets computational storage: eff","work_id":"dea6b5d9-b906-47f5-a4e9-a6758e631f3f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":36,"snapshot_sha256":"6abc172251e1a5da3f713bc2f073407dde5072af08c60d844645d4ec107ad657","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.13398","created_at":"2026-05-18T02:44:47.623351+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13398v1","created_at":"2026-05-18T02:44:47.623351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13398","created_at":"2026-05-18T02:44:47.623351+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGORLB57XQSR","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGORLB57XQSRV7YO","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGORLB57","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET","json":"https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET.json","graph_json":"https://pith.science/api/pith-number/IGORLB57XQSRV7YOISOF7OAQET/graph.json","events_json":"https://pith.science/api/pith-number/IGORLB57XQSRV7YOISOF7OAQET/events.json","paper":"https://pith.science/paper/IGORLB57"},"agent_actions":{"view_html":"https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET","download_json":"https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET.json","view_paper":"https://pith.science/paper/IGORLB57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13398&json=true","fetch_graph":"https://pith.science/api/pith-number/IGORLB57XQSRV7YOISOF7OAQET/graph.json","fetch_events":"https://pith.science/api/pith-number/IGORLB57XQSRV7YOISOF7OAQET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET/action/storage_attestation","attest_author":"https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET/action/author_attestation","sign_citation":"https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET/action/citation_signature","submit_replication":"https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET/action/replication_record"}},"created_at":"2026-05-18T02:44:47.623351+00:00","updated_at":"2026-05-18T02:44:47.623351+00:00"}