NEMO: Faster Parallel Execution for Highly Contended Blockchain Workloads

Conference Paper (2025)
Author(s)

F. Ezard (Student TU Delft)

C. U. Ileri (IOTA Foundation)

J. Decouchant (TU Delft - Data-Intensive Systems)

Research Group
Data-Intensive Systems
DOI related publication
https://doi.org/10.1109/BRAINS67003.2025.11302922
More Info
expand_more
Publication Year
2025
Language
English
Research Group
Data-Intensive Systems
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository as part of the Taverne amendment. More information about this copyright law amendment can be found at https://www.openaccess.nl. Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Publisher
IEEE
ISBN (print)
979-8-3315-5983-0
ISBN (electronic)
979-8-3315-5982-3
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Following the design of more efficient blockchain consensus algorithms, the execution layer has emerged as the new performance bottleneck of blockchains, especially under high contention. Current parallel execution frameworks either rely on optimistic concurrency control (OCC) or on pessimistic concurrency control (PCC), both of which see their performance decrease when workloads are highly contended, albeit for different reasons. In this work, we present NEMO, a new blockchain execution engine that combines OCC with the object data model to address this challenge. NEMO introduces three core innovations: (i) a greedy commit rule for transactions that do not use shared objects; (ii) refined handling of dependencies to reduce re-executions; and (iii) the use of incomplete but statically derivable read/write hints to guide execution. Through simulated execution experiments, we demonstrate that NEMO significantly reduces redundant computation and achieves higher throughput than representative approaches. For example, with $\mathbf{1 6}$ workers nemo’s throughput is up to $42 \%$ higher than the one of BlockSTM, the state-of-the-art OCC approach, and 61% higher than the pessimistic concurrency control baseline used.

Files

License info not available
warning

File under embargo until 24-06-2026