The REAPER Stack: Compiling a Chemical Mechanism at Run Time

A chemistry model repeats the same reaction bookkeeping in many cells and at many times. The concentrations change; the identities of the reactants usually do not. REAPER uses that fixed structure to write a small set of specialized programs after the model has loaded its mechanism. A system compiler turns them into a library that the solver attaches and later runs reuse. We explain the construction, and six appendices explain the computer science from the ground up, after Feynman’s lectures on computation. TurboMICM provides working examples of the generated kernels, and has measured such kernels at five to six times the generic path inside one solver. The complete run-time loading and caching path remains a design; its own startup cost has not been measured.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-26
DOI
https://doi.org/10.5281/zenodo.23654084
Primary Topic
Parallel Computing and Optimization Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The REAPER Stack: Compiling a Chemical Mechanism at Run Time

David Fillmore
Zenodo (CERN European Organization for Nuclear Research)
Parallel Computing and Optimization Techniques
preprint

The REAPER Stack: Compiling a Chemical Mechanism at Run Time

David Fillmore
preprint en

Abstract

A chemistry model repeats the same reaction bookkeeping in many cells and at many times. The concentrations change; the identities of the reactants usually do not. REAPER uses that fixed structure to write a small set of specialized programs after the model has loaded its mechanism. A system compiler turns them into a library that the solver attaches and later runs reuse. We explain the construction, and six appendices explain the computer science from the ground up, after Feynman’s lectures on computation. TurboMICM provides working examples of the generated kernels, and has measured such kernels at five to six times the generic path inside one solver. The complete run-time loading and caching path remains a design; its own startup cost has not been measured.

Zenodo (CERN European Organization for Nuclear Research)
National Aeronautics and Space Administration (US)
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon