pith. sign in
Pith Number

pith:IGORLB57

pith:2026:IGORLB57XQSRV7YOISOF7OAQET
not attested not anchored not stored refs resolved

FPGA-Accelerated Lock Management and Transaction Processing: Architecture, Optimization, and Design Space Exploration

Gustavo Alonso, Shien Zhu

Hardware lock agents on FPGA eliminate DRAM accesses to deliver up to 51 times the transaction throughput of CPU baselines in OLTP systems.

arxiv:2605.13398 v1 · 2026-05-13 · cs.AR · cs.DB · cs.DC

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?
Add to your LaTeX paper 
\usepackage{pith}
\pithnumber{IGORLB57XQSRV7YOISOF7OAQET}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
✓ Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

The experiment results show up to 51X higher transaction throughput over the CPU baseline on the TPC-C benchmark.

C2weakest 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.

C3one 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.

References

36 extracted · 36 resolved · 0 Pith anchors

[1] 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 2019
[2] 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 1995
[3] Bernstein, Vassos Hadzilacos, and Nathan Goodman 1987
[4] 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 2022
[5] 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 2020
Receipt and verification
First computed 2026-05-18T02:44:47.623276Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

419d1587bfbc251aff0e449c5fb81024e369140c287470b24a5dab5908ffd431

Aliases

arxiv: 2605.13398 · arxiv_version: 2605.13398v1 · doi: 10.48550/arxiv.2605.13398 · pith_short_12: IGORLB57XQSR · pith_short_16: IGORLB57XQSRV7YO · pith_short_8: IGORLB57
Agent API
Resolver JSON Graph JSON Events JSON Schema Signing key
Verify this Pith Number yourself 
curl -sH 'Accept: application/ld+json' https://pith.science/pith/IGORLB57XQSRV7YOISOF7OAQET \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 419d1587bfbc251aff0e449c5fb81024e369140c287470b24a5dab5908ffd431
Canonical record JSON 
{
  "metadata": {
    "abstract_canon_sha256": "e70feb220a930c1b65e3b0422a517f965117369bfb99ed989a23558cb90b47e2",
    "cross_cats_sorted": [
      "cs.DB",
      "cs.DC"
    ],
    "license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
    "primary_cat": "cs.AR",
    "submitted_at": "2026-05-13T11:53:59Z",
    "title_canon_sha256": "18f9ecd9759a4fc3b951e678bb96fc61a7205baa5124604fde236fc27533a5d1"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13398",
    "kind": "arxiv",
    "version": 1
  }
}