Preprints
https://doi.org/10.5194/egusphere-2026-5497
https://doi.org/10.5194/egusphere-2026-5497
03 Nov 2026
 | 03 Nov 2026
Status: this preprint is open for discussion and under review for Geoscientific Model Development (GMD).

MERIT-FlowTopo v1.0: a reusable computational foundation for hyperresolution hydrology on the global 90 m drainage network

Lulu Jiang, Huan Wu, Weitian Chen, Zhijun Huang, Dai Yamazaki, Ting Yang, and Lingfeng Li

Abstract. Global hydrological models still run at tens of kilometers, too coarse to resolve local floods; hyperresolution, about 1 km globally and 100 m continentally, remains the goal. With the network already mapped, the cost has shifted from mapping it to computing over it: refining a 10 km grid to 1 km multiplies cells a hundredfold, and deeper, longer flow paths make routing climb several hundredfold. Yet how a flow network should be organized has rarely been studied, though that organization governs the cost as much as the hardware. On the global 90 m MERIT Hydro network of 22.2 billion land pixels, we show how three structural choices do so: ordering sets locality in a core's private cache, layering in the shared cache, and partitioning balances load across processors without communication. Because the network is static, each structure is precomputed once from D8 flow directions and released as MERIT-FlowTopo v1.0, a reusable foundation any model traversing the network in drainage order reads instead of rebuilding. Across four terrain kernels (the elementary memory-bound step shared by routing computations on the fixed network), depth-first ordering cuts serial runtime up to 5.1-fold and lowers the simulated L3 cache-miss rate from about 37 % to 6 %, while a conflict-free downstream layering introduced here keeps converging flows lock-free and deterministic without atomic operations. MERIT-FlowTopo extends MERIT Hydro from a map to a basis for computing on it, fixing in the data the locality, scheduling, and load balance hyperresolution would otherwise demand as parallel-computing expertise.

Publisher's note: Copernicus Publications remains neutral with regard to jurisdictional claims made in the text, published maps, institutional affiliations, or any other geographical representation in this paper. While Copernicus Publications makes every effort to include appropriate place names, the final responsibility lies with the authors. Views expressed in the text are those of the authors and do not necessarily reflect the views of the publisher.
Share
Lulu Jiang, Huan Wu, Weitian Chen, Zhijun Huang, Dai Yamazaki, Ting Yang, and Lingfeng Li

Status: open (until 29 Dec 2026)

Comment types: AC – author | RC – referee | CC – community | EC – editor | CEC – chief editor | : Report abuse
Lulu Jiang, Huan Wu, Weitian Chen, Zhijun Huang, Dai Yamazaki, Ting Yang, and Lingfeng Li

Data sets

MERIT-FlowTopo: A reusable computational foundation for hyperresolution hydrology on the global 90 m drainage network Lulu Jiang, Huan Wu, Weitian Chen, Zhijun Huang, Dai Yamazaki, Ting Yang, Lingfeng Li https://doi.org/10.5281/zenodo.20653059

MERIT-DrainAttr: Baseline drainage attributes for the global 90 m drainage network Lulu Jiang, Huan Wu, Weitian Chen, Zhijun Huang, Dai Yamazaki, Ting Yang, Lingfeng Li https://doi.org/10.5281/zenodo.20686665

Model code and software

MERIT-FlowTopo code: the C and Python implementations and the figure scripts Lulu Jiang, Huan Wu, Weitian Chen, Zhijun Huang, Dai Yamazaki, Ting Yang, Lingfeng Li https://doi.org/10.5281/zenodo.22227621

Video supplement

MERIT-FlowTopo: narrated video overview of the six ordering structures and the three propagation manners Lulu Jiang, Huan Wu, Weitian Chen, Zhijun Huang, Dai Yamazaki, Ting Yang, Lingfeng Li https://youtu.be/tE5K2wM3TTY

Lulu Jiang, Huan Wu, Weitian Chen, Zhijun Huang, Dai Yamazaki, Ting Yang, and Lingfeng Li
Metrics will be available soon.
Latest update: 03 Nov 2026
Download
Short summary
Global river and flood models must sweep billions of connected grid cells in a fixed upstream-to-downstream order, and every tool now rebuilds that order for itself. We precomputed it once for the global 90 m river network and released it as reusable data. Picking the right processing order makes the same computation up to five times faster, and a new conflict-free schedule lets processor cores work in parallel without collisions. Models can read these structures instead of rebuilding them.
Share