Applying Wafer-Scale Evolutionary Simulations to Investigate Hypermutator Dynamics in Large Asexual Populations
(and phylogeny tracking, too)
February 21, 2025 @ BEACON Seminar
Matthew Andres Moreno
Complex Systems, Michigan Institute for Data and AI in Society, Ecology and Evolutionary Biology
University of Michigan
Agent-based Evolution & Simulation Scale
📚 [slides, paper, code] https://hopth.ru/de
Scale and Agent-based Evolution Simulations
📧 morenoma@umich.edu
(Dolson and Ofria, 2021)
Scale and Agent-based Evolution Simulations
📧 morenoma@umich.edu
(Dolson and Ofria, 2021)
Scale and Digital Evolution
Avida
(Ofria and Wilke, 2009)
📧 morenoma@umich.edu
Evolution Models in vivo and in silico
LTEE
(Good et al., 2017)
📧 morenoma@umich.edu
E.
coli
experimental evolution:
n>1, experimental manipulations
Evolution Models in vivo and in silico
LTEE
(Good et al., 2017)
Avida
(Ofria and Wilke, 2009)
📧 morenoma@umich.edu
E.
coli
experimental evolution:
n>1, experimental manipulations
simulation and modeling:
synthesize theory, test sufficiency
Evolution Models in vivo and in silico
LTEE
(Good et al., 2017)
Avida
(Ofria and Wilke, 2009)
📧 morenoma@umich.edu
E.
coli
Scale and Digital Evolution
1
processor
~billion replications/day
1
processor
1
processor
Grace Hopper
Cgoodwin, CC BY-SA 4.0 <https://creativecommons.org/licenses/by-sa/4.0>, via Wikimedia Commons
Nejones1987, CC BY-SA 4.0 <https://creativecommons.org/licenses/by-sa/4.0>, via Wikimedia Commons
a bigger ox
a team of oxen
✓
Grace Hopper
Cgoodwin, CC BY-SA 4.0 <https://creativecommons.org/licenses/by-sa/4.0>, via Wikimedia Commons
Nejones1987, CC BY-SA 4.0 <https://creativecommons.org/licenses/by-sa/4.0>, via Wikimedia Commons
a bigger ox
a team of oxen
✓
Grace Hopper
KLAT2 (HANK DIETZ)
KLAT2 (HANK DIETZ)
KLAT2 (HANK DIETZ)
Fugaku
KLAT2 (HANK DIETZ)
The Library of Congress via Wikimedia Commons
“next-generation” high-performance computing (especially AI/ML)
KLAT2 (HANK DIETZ)
The Library of Congress via Wikimedia Commons
NVIDIA A100 GPU
6,912 CUDA cores
KLAT2 (HANK DIETZ)
The Library of Congress via Wikimedia Commons
Graphcore IPU
1,200 cores per chip
clustered up to 1,024
chips
NVIDIA A100 GPU
6,912 CUDA cores
SambaNova
RDU
KLAT2 (HANK DIETZ)
Cerebras
Wafer-Scale
Engine
The Library of Congress via Wikimedia Commons
850,000
cores
NVIDIA A100 GPU
6,912 CUDA cores
Graphcore IPU
1,200 cores per chip
clustered up to 1,024
chips
SambaNova
RDU
…
…
Cerebras Wafer-Scale Engine
850,000
cores
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
…
…
Cerebras Wafer-Scale Engine
850,000
cores
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
…
…
…
…
…
…
…
…
Cerebras Wafer-Scale Engine
850,000
cores
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
…
…
…
…
…
…
…
…
Cerebras Wafer-Scale Engine
850,000
cores
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
…
…
…
…
…
…
…
…
Cerebras Wafer-Scale Engine
850,000
cores
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
data
output
…
…
…
…
…
…
…
…
Cerebras Wafer-Scale Engine
850,000
cores
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
only ~48kb
mem per core
ByteBoost
Workshop ‘24
at supercomputing
ByteBoost
Workshop ‘24
ByteBoost
Workshop ‘24
ByteBoost
Workshop ‘24
GraphCore IPU — another AI/ML accelerator
1,200 cores per chip
clustered up to 1,024 chips
Goal: develop and apply methods to harness next-generation high-performance computing hardware to enable larger agent-based evolution simulations
Part 1:
Hypermutator Dynamics Experiments
on the Wafer-scale Engine
Goal: develop and apply methods to harness next-generation high-performance computing hardware to enable larger agent-based evolution simulations
Part 1:
Hypermutator Dynamics Experiments
on the Wafer-scale Engine
Part 2:
Decentralized Phylogeny Tracking
Goal: develop and apply methods to harness next-generation high-performance computing hardware to enable larger agent-based evolution simulations
Goal: develop methods to harness next-generation high-performance computing hardware to enable larger agent-based evolution simulations
Develop Algorithms and Software for Wafer-Scale Evolution Simulations
Technical Proof-of-Concept Runs
Proof-of
-Concept
Hypothesis-driven Experiments
Goal: develop methods to harness next-generation high-performance computing hardware to enable larger agent-based evolution simulations
we are here
Develop Algorithms and Software for Wafer-Scale Evolution Simulations
Technical Proof-of-Concept Runs
Proof-of
-Concept
Hypothesis-driven Experiments
we are here
Goal: develop methods to harness next-generation high-performance computing hardware to enable larger agent-based evolution simulations
II. phylogeny
tracking
Part 1:
Hypermutator Dynamics Experiments
on the Wafer-scale Engine
📧 morenoma@umich.edu
“normomutator”
“hypermutator”
hypermutator trait
👿 –
higher
deleterious
mutation
load
😇 +
faster
discovery
beneficial
mutations
“hypermutator”
https://mathematical-oncology.org/blog/evofreq-and-hal.html
“hypermutator”
https://mathematical-oncology.org/blog/evofreq-and-hal.html
https://mathematical-oncology.org/blog/evofreq-and-hal.html
“hypermutator”
https://mathematical-oncology.org/blog/evofreq-and-hal.html
https://mathematical-oncology.org/blog/evofreq-and-hal.html
Hypermutator dynamics pertain to
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
hypermutator selection — Raynes et al., 2018
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
hypermutator selection — Raynes et al., 2018
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
hypermutators favored
normomutators favored
hypermutator selection — Raynes et al., 2018
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
hyper
mutator
📚 [these slides] https://hopth.ru/ea
hypermutator selection — Raynes et al., 2018
hypermutators win
<— pop size 10k
?????????
📚 [these slides] https://hopth.ru/ea
hypermutator selection — Raynes et al., 2018
very large
population sizes??
agent-based model
beneficial
λ=1 in 100k
deleterious
λ=1 in 1k
poisson distribution
hypermutator selection — Raynes et al., 2018
beneficial
λ=1 in 1k
deleterious
λ=1 in 10
hypermutator
100x mutation rate
poisson distribution
hypermutator selection — Raynes et al., 2018
agent-based model
←hypermutator
←normomutator
hypermutator selection — Raynes et al., 2018
50/50
←hypermutator
Generations
←normomutator
hypermutator selection — Raynes et al., 2018
50/50
←hypermutator
Generations
←normomutator
hypermutator selection — Raynes et al., 2018
50/50
— versus —
hypermuts win
normomuts win
Island Model GA
Treatment Conditions. Allowed mutational outcomes under compared outcomes. Note that adaptive regime introduces the possibility for selective sweeps.
a) purifying
regime
On-device Performance
b) adaptive
regime
Example reconstructions. Phylogenetic reconstructions of 1 million generation on-hardware simulations. For legibility, phylogeny visualizations were further subsampled to 1k end-state agents. Left phylogenies are log-scaled with ultrametric correction to better show topology and right phylogenies are linear-scaled.
On-device Evolution Trial
Phylometric outcomes. Statistics calculated from reconstruction of 18 million population size/1 million generation on-hardware simulations. Phylometrics were calculated from reconstructions with 10k sampled end-state agents.
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
“
”
📧 morenoma@umich.edu
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
Island Model GA
Treatment Conditions. Allowed mutational outcomes under compared outcomes. Note that adaptive regime introduces the possibility for selective sweeps.
a) purifying
regime
On-device Performance
b) adaptive
regime
Example reconstructions. Phylogenetic reconstructions of 1 million generation on-hardware simulations. For legibility, phylogeny visualizations were further subsampled to 1k end-state agents. Left phylogenies are log-scaled with ultrametric correction to better show topology and right phylogenies are linear-scaled.
On-device Evolution Trial
Phylometric outcomes. Statistics calculated from reconstruction of 18 million population size/1 million generation on-hardware simulations. Phylometrics were calculated from reconstructions with 10k sampled end-state agents.
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
“
”
📧 morenoma@umich.edu
Simulation Results
Preliminary Results
Preliminary Results
normo
lose
Preliminary Results
Preliminary Results
Preliminary Results
normo win in big pops when few beneficial mutations are available
Preliminary Results
normo win in big pops when few beneficial mutations are available
Preliminary Results
Preliminary Results
3 beneficial
available
normo
lose in large pops
pop size up to ~10 million
Preliminary Results
normo
win in large pops
5 beneficial
available
+very large pop size
pop size up to ~1.5 billion
Generations
50/50
50/50
Generations
1 in 100k
denovo
Generations
normomutator
hypermutator
hypermutators fix
normomutators persist
net population size
191 million
num generations
200,000
real time
~70 seconds
hypermutators fix
normomutator
hypermutator
net population size
191 million
num generations
200,000
real time
~70 seconds
normomutators persist
hypermutators fix
normomutators persist
normomutator
hypermutator
net population size
191 million
num generations
200,000
real time
~70 seconds
Preliminary Results
+denovo hypermutator origination
+denovo hypermutator origination
5 → 14 beneficial muts available
normo
win
in large pops
well-mixed
1D ring
2D grid
on GPU
(stronger) spatial structure (weaker)
spatial structure
(✂️ for time)
well-mixed
1D ring
2D grid
on GPU
(stronger) spatial structure (weaker)
normomutators more resilient
normomutators less resilient
well-mixed
1D ring
2D grid
on GPU
(stronger) spatial structure (weaker)
on GPU
well-mixed
1D ring
2D grid
normomutators more resilient
on GPU
well-mixed
1D ring
2D grid
normomutators
more resilient
(>20 ben muts avail)
(stronger) spatial structure (weaker)
on GPU
well-mixed
1D ring
2D grid
normomutators
more resilient
(>20 ben muts avail)
normomutators
less resilient
(<8 ben muts avail)
(stronger) spatial structure (weaker)
on GPU
well-mixed
1D ring
2D grid
normomutators more resilient
normomutators less resilient
Performance 🏎️
Performance
vs. A100 GPU (CuPy)
Speedup
~ 294x faster
WSE vs GPU
WSE ~8x1011 (800 billion) agent-generations per second
WSE ~8x1011 (800 billion) agent-generations per second
WSE ~8x1011 (800 billion) agent-generations per second
295× vs GPU
Performance
Agents per PE | Net Population Size | Simulation Speed (Generations per Second) |
| | |
| | |
Performance
Agents per PE | Net Population Size | Simulation Speed (Generations per Second) |
256 | 190.8 million | 4,306 (std 156) |
| | |
Performance
Agents per PE | Net Population Size | Simulation Speed (Generations per Second) |
256 | 190.8 million | 4,306 (std 156) |
2048 | 1.5 billion | 549 (std 1) |
Performance
WSE ~8x1011 (800 billion) agent-generations per second
Performance
295× vs GPU
Performance
295× vs GPU
111,091× vs CPU
Performance
all ~8x1011 (800 billion) agent-generations per second
Agents per PE | Net Population Size | Simulation Speed (Generations per Second) |
256 | 190.8 million | 4,306 (std 156) |
2048 | 1.5 billion | 549 (std 1) |
Conclusion
Summary
Summary
Summary
Next Steps
Next Steps
VS
osmotic pressure
more adaptive loci
antibiotics
fewer adaptive loci
Martjin Callens et al., 2023
E. Coli
E. Coli
Next Steps
VS
osmotic pressure
more adaptive loci
→
more hypermutators
antibiotics
fewer adaptive loci
→
fewer hypermutators
Martjin Callens et al., 2023
E. Coli
E. Coli
Part II:
Decentralized Phylogeny Tracking
📧 morenoma@umich.edu
…
…
…
…
…
…
…
…
Cerebras Wafer-Scale Engine
48kb mem
😶🌫️
📧 morenoma@umich.edu
…
…
…
…
…
…
…
…
Cerebras Wafer-Scale Engine
48kb mem
😶🌫️
🌸
🌺
🌼
🌻
phylogeny
📧 morenoma@umich.edu
Perfect Tracking:
Complete Observability
Perfect Tracking:
Complete Observability
(Nozoe et al, 2017)
🦠
🦠
🦠
🔬
🦠
Perfect Tracking:
Complete Observability
(Nozoe et al, 2017)
🔬
🦠
🦠
🦠
🦠
Perfect Tracking:
Complete Observability
🌸
🌺
🌼
🌻
🦠
🦠
🦠
👍
(Nozoe et al, 2017)
🔬
🦠
Perfect Tracking:
Complete Observability
🌸
🌺
🌼
🌻
👍
(Nozoe et al, 2017)
🔬
👎
🦠
🦠
🦠
🦠
Perfect Tracking:
Complete Observability
🌸
🌺
🌼
🌻
👍
👎
(Nozoe et al, 2017)
🔬
🦠
🦠
🦠
🦠
Highly-distributed,
Many-core Computation
@MorenoMatthewA 🐘@mas.to
🌸
🌺
🌼
🌻
🚫
❓
@MorenoMatthewA 🐘@mas.to
🌻
🔬
🦠
🦠
🦠
@MorenoMatthewA 🐘@mas.to
🌸
🌺
🌼
🌻
🌻
🔬
🦠
🦠
🦠
@MorenoMatthewA 🐘@mas.to
🌸
🌺
🌼
🌻
🧬
🧬
🧬
🧬
🌻
🔬
🦠
🦠
🦠
@MorenoMatthewA 🐘@mas.to
🪄🐇
🌸
🌺
🌼
🌻
🌺
🌼
🪷
🧬
🧬
🧬
🧬
🌻
🔬
🦠
🦠
🦠
@MorenoMatthewA 🐘@mas.to
🌸
🌺
🌼
🌻
🌸
🌺
🌼
🪷
🧬
🧬
🧬
*inferred estimate
🧬
🌻
🔬
🦠
🦠
🦠
@MorenoMatthewA 🐘@mas.to
🌸
🌺
🌼
🌻
🌸
🌺
🌼
🪷
🧬
🧬
🧬
🧬
*inferred estimate
How to design
.🧬 to facilitate reconstruction?
@MorenoMatthewA 🐘@mas.to
🌸
🌺
🌼
🌻
🌸
🌺
🌼
🪷
🧬
🧬
🧬
🧬
*inferred estimate
Hwang et al., 2019
Crispr-cas9 Barcoding
@MorenoMatthewA 🐘@mas.to
🌸
🌺
🌼
🌻
🌸
🌺
🌼
🪷
🧬
🧬
🧬
🧬
…
…
🧬
= “hstrat” annotation
@MorenoMatthewA 🐘@mas.to
🌸
🌺
🌼
🌻
🌸
🌺
🌼
🪷
🧬
🧬
🧬
🧬
= “hstrat” annotation
…
…
🧬
evolve
under-the-hood “hstrat” algorithm
(✂️ for time)
evolve
evolve
evolve
.B.
.C.
.A.
evolve
.B.
.C.
.A.
evolve
.C.
.B.
.A.
.B.
.C.
.A.
evolve
end-state
.C.
.B.
.A.
.C.
.B.
.A.
.B.
.C.
.A.
evolve
end-state
reconstruct
t=8
t=8
t=8
t=16
t=8
t=16
t=8
t=16
t=8
t=16
t=8
t=16
“steady”
“tilted”
t=8
t=16
t=8
t=16
“steady”
“tilted”
This is the hard/interesting part!!!
Problem Setup — [props?]
Problem Setup — [props?]
Proof-of-concept Experiment (Alife ‘24)
Treatment Conditions. Allowed mutational outcomes under compared outcomes. Note that adaptive regime introduces the possibility for selective sweeps.
a) purifying
regime
b) adaptive
regime
Example reconstructions. Phylogenetic reconstructions of 1 million generation on-hardware simulations. For legibility, phylogeny visualizations were further subsampled to 1k end-state agents. Left phylogenies are log-scaled with ultrametric correction to better show topology and right phylogenies are linear-scaled.
On-device Evolution Trial
Phylometric outcomes. Statistics calculated from reconstruction of 18 million population size/1 million generation on-hardware simulations. Phylometrics were calculated from reconstructions with 10k sampled end-state agents.
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
“
”
Proof-of-concept Experiment (Alife ‘24)
Treatment Conditions. Allowed mutational outcomes under compared outcomes. Note that adaptive regime introduces the possibility for selective sweeps.
a) purifying
regime
b) adaptive
regime
Example reconstructions. Phylogenetic reconstructions of 1 million generation on-hardware simulations. For legibility, phylogeny visualizations were further subsampled to 1k end-state agents. Left phylogenies are log-scaled with ultrametric correction to better show topology and right phylogenies are linear-scaled.
a) purifying regime
b) adaptive regime
👾 =mutate⇒
👾 or 👾—
👾 =mutate⇒
👾 or 👾— or 👾+
On-device Evolution Trial
Phylometric outcomes. Statistics calculated from reconstruction of 18 million population size/1 million generation on-hardware simulations. Phylometrics were calculated from reconstructions with 10k sampled end-state agents.
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
“
”
simple agent model, explicit fitness
Proof-of-concept Experiment (Alife ‘24)
🧬
Treatment Conditions. Allowed mutational outcomes under compared outcomes. Note that adaptive regime introduces the possibility for selective sweeps.
a) purifying
regime
b) adaptive
regime
Example reconstructions. Phylogenetic reconstructions of 1 million generation on-hardware simulations. For legibility, phylogeny visualizations were further subsampled to 1k end-state agents. Left phylogenies are log-scaled with ultrametric correction to better show topology and right phylogenies are linear-scaled.
a) purifying regime
b) adaptive regime
👾 =mutate⇒
👾 or 👾—
👾 =mutate⇒
👾 or 👾— or 👾+
On-device Evolution Trial
Phylometric outcomes. Statistics calculated from reconstruction of 18 million population size/1 million generation on-hardware simulations. Phylometrics were calculated from reconstructions with 10k sampled end-state agents.
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
“
”
simple agent model, explicit fitness
🧬
🧬
🧬
Example Phylogenies
a) purifying
regime
b) adaptive
regime
Phylometric outcomes. Statistics calculated from reconstruction of 18 million population size/1 million generation on-hardware simulations. Phylometrics were calculated from reconstructions with 10k sampled end-state agents.
📧 morenoma@umich.edu
~ 8 million agents
~ 10k tip phylogenies
(-) adaptive muts
(+) adaptive muts
Evolutionary Inference from Phylogeny Structure
📚 [slides, paper, code] https://hopth.ru/de
Phylogeny Structure Metrics
📚 [slides, paper, code] https://hopth.ru/de
Evolutionary Inference from Phylogeny Structure
📚 [slides, paper, code] https://hopth.ru/de
Goal: end-to-end encapsulated workflow
raw sim “genome” strings
🧬🧬🧬🧬🧬🧬🧬
🌻
🌸
🌺
🌼
🌻
phylogeny
One Terminal
Command
Goal: end-to-end encapsulated workflow
🧬🧬🧬🧬🧬🧬🧬
2. extract and decode
markers
3. build tree
🌻
🌸
🌺
🌼
🌻
4. phylogeny
courtesy meat-machinery.com
Goal: end-to-end encapsulated workflow
🧬🧬🧬🧬🧬🧬🧬
2. extract and decode
markers
3. build tree
🌻
🌸
🌺
🌼
🌻
4. phylogeny
courtesy meat-machinery.com
Goal: end-to-end encapsulated workflow
courtesy meat-machinery.com
🧬🧬🧬🧬🧬🧬🧬
2. extract and decode
markers
3. build tree
🌻
🌸
🌺
🌼
🌻
4. phylogeny
Joey
Wagner
⏱️
Connor Yang
Vivaan Singhvi
Goal: high-performance, easy phylogeny reconstruction workflow
raw sim “genome” strings
🧬🧬🧬🧬🧬🧬🧬
🌻
🌸
🌺
🌻
phylogeny
Joey
Wagner
Connor
Yang
Vivaan Singhvi
reconstruction algorithm
Goal: high-performance, easy phylogeny reconstruction workflow
raw sim “genome” strings
🧬🧬🧬🧬🧬🧬🧬
🌻
🌸
🌺
🌼
🌻
phylogeny
reconstruction algorithm
Joey
Wagner
Connor
Yang
Vivaan Singhvi
how to use?
Goal: high-performance, easy phylogeny reconstruction workflow
raw sim “genome” strings
🧬🧬🧬🧬🧬🧬🧬
🌻
🌸
🌺
🌼
🌻
phylogeny
reconstruction algorithm
🧬
how to annotate?
🧬
1.fixed-width bit field
2. generation counter
(e.g., 96 bits)
🧬
1.fixed-width bit field
2. generation counter
(e.g., 96 bits)
generation 572
🧬
1.fixed-width bit field
2. generation counter
(e.g., 96 bits)
DSTREAM LIBRARY
generation 572
stateless!
🧬
1.fixed-width bit field
2. generation counter
(e.g., 96 bits)
DSTREAM LIBRARY
generation 572
randomize bit 35
stateless!
🧬
1.fixed-width bit field
2. generation counter
(e.g., 96 bits)
DSTREAM LIBRARY
generation 572
randomize bit 35
stateless!
Python
C++�Rust
Zig
CSL
(or ~50 LOC)
how to reconstruct?
.csv, .parquet, etc.
how to reconstruct?
.csv, .parquet, etc.
83a3bc
genome hex
472a70
how to reconstruct?
.csv, .parquet, etc.
genome hex
83a3bc
hstrat bitfield offset & width
8, 32
472a70
8, 32
how to reconstruct?
✅ prototype → 🔜 open-source package
.csv, .parquet, etc.
83a3bc
8, 32
40, 16
hstrat bitfield offset & width
generation count offset & width
genome hex
472a70
8, 32
40, 16
how to reconstruct?
✅ prototype → 🔜 open-source package
83a3bc
8, 32
40, 16
(or command line flags)
hstrat bitfield offset & width
generation count offset & width
genome hex
472a70
8, 32
40, 16
how to reconstruct?
.csv, .parquet, etc.
1 Terminal
Command
.csv, .parquet, etc.
83a3bc
8, 32
40, 16
(or command line flags)
hstrat bitfield offset & width
generation count offset & width
genome hex
472a70
8, 32
40, 16
🌻
🌸
🌺
🌻
phylogeny
1 Terminal
Command
.csv, .parquet, etc.
83a3bc
8, 32
40, 16
(or command line flags)
hstrat bitfield offset & width
generation count offset & width
genome hex
472a70
8, 32
40, 16
.csv, .parquet, etc.
🌻
🌸
🌺
🌻
phylogeny
1 Terminal
Command
.csv, .parquet, etc.
83a3bc
8, 32
40, 16
(or command line flags)
via pip or singularity
hstrat bitfield offset & width
generation count offset & width
genome hex
472a70
8, 32
40, 16
.csv, .parquet, etc.
🌻
🌸
🌺
🌻
phylogeny
1 Terminal
Command
.csv, .parquet, etc.
my very cool phenotype data
via pip or singularity
83a3bc
8, 32
40, 16
hstrat bitfield offset & width
generation count offset & width
genome hex
472a70
8, 32
40, 16
.csv, .parquet, etc.
phylogeny
1 Terminal
Command
✅ prototype → 🔜 open-source package
.csv, .parquet, etc.
genome hex 🧬
83a3bc
data bit offset & width
8, 32
generation counter offset & width
40, 16
my very cool phenotype data
via pip or singularity
.csv, .parquet, etc.
high-throughput phylogeny generation (in vivo & in silico)
Liu et al., 2024:
235 million seqs
39k jobs, 30.5 hrs
🌸
🌺
🌼
🌻
high-throughput phylogeny generation (in vivo & in silico)
Liu et al., 2024:
235 million seqs
39k jobs, 30.5 hrs
🌸
🌺
🌼
🌻
existing phylogeny analyses and tools
existing phylogeny analyses and tools
what do you do with a billion tip phylogeny?????
(or 1,000 million tip phylogenies???)
what do you do with a billion tip phylogeny?????
(or 1,000 million tip phylogenies???)
high-throughput phylogeny generation (in vivo & in silico)
contemporary analyses
high-throughput phylogeny generation (in vivo & in silico)
Liu et al., 2024: 235 million seqs
39k jobs, 30.5 hrs
use more
phylogenies
use larger
phylogenies
contemporary analyses
need:
high-throughput phylogeny generation (in vivo & in silico)
Liu et al., 2024: 235 million seqs
39k jobs, 30.5 hrs
Conclusion
“perfect” observability
(Nozoe et al,
2017)
🦠
🦠
🦠
🦠
“sampling-based” observability
“perfect” observability
(Nozoe et al,
2017)
🦠
🌸
🌺
🌼
🌻
🧬
🧬
🧬
🧬
🦠
🦠
🦠
“sampling-based” observability
“perfect” observability
(Nozoe et al,
2017)
🦠
🌸
🌺
🌼
🌻
🧬
🧬
🧬
🧬
🦠
🦠
🦠
in vivo
“sampling-based” observability
“perfect” observability
(Nozoe et al,
2017)
🦠
🌸
🌺
🌼
🌻
🧬
🧬
🧬
🧬
🦠
🦠
🦠
in silico
in vivo
“sampling-based” observability
“perfect” observability
(Nozoe et al,
2017)
🦠
🌸
🌺
🌼
🌻
🧬
🧬
🧬
🧬
🦠
🦠
🦠
🔬
… ← in vivo
in silico
“sampling-based” observability
“perfect” observability
(Nozoe et al,
2017)
🦠
🌸
🌺
🌼
🌻
🧬
🧬
🧬
🧬
🦠
🦠
🦠
🔬
in silico → …
… ← in vivo
“sampling-based” observability
“perfect” observability
(Nozoe et al,
2017)
🦠
🌸
🌺
🌼
🌻
🧬
🧬
🧬
🧬
🦠
🦠
🦠
🔬
in silico → …
… ← in vivo
“approximate” observability
“perfect” observability
(Nozoe et al,
2017)
🦠
🌸
🌺
🌼
🌻
🧬
🧬
🧬
🧬
🦠
🦠
🦠
in silico → …
… ← in vivo
🔬
………………………………………………………………………
(Dolson and Ofria, 2021)
Parallel/distributed Scale-up: Interesting Trade-offs
(Dolson and Ofria, 2021)
Parallel/distributed Scale-up: Interesting Trade-offs
(Dolson and Ofria, 2021)
PSC
Neocortex
(NSF ACCESS)
Argonne
Leadership
Compute Facility
(Dept of Energy)
Today
Condor Galaxy 3,4,5
PSC
Neocortex
(NSF ACCESS)
Argonne
Leadership
Compute Facility
(Dept of Energy)
64 CS-3 chips (54 million cores)�8 exaFLOPs
Today
Today ($$$)
Condor Galaxy 3,4,5
PSC
Neocortex
(NSF ACCESS)
Argonne
Leadership
Compute Facility
(Dept of Energy)
???
64 CS-3 chips (54 million cores)�8 exaFLOPs
As many as 2,048 systems can be combined…
1.84 billion cores
Today
Future
https://spectrum.ieee.org/cerebras-chip-cs3
Today ($$$)
Peter J. Park, CC BY 2.5 <https://creativecommons.org/licenses/by/2.5>, via Wikimedia Commons
kqedquest Via Flickr
ByteBoost
Workshop ‘24
Dr. Luis Zaman
@MorenoMatthewA 🐘@mas.to
This project is supported by the Eric and Wendy Schmidt AI in Science Postdoctoral Fellowship, a Schmidt Sciences program.
Dr. Emily Dolson
📧 morenoma@umich.edu
Joey Wagner
Connor Yang (UROP)
Vivaan Singhvi (UROP)
Office of Advanced Scientific Computing Research (ASCR)
Award Number DE-SC0025634
ByteBoost
Workshop ‘24
Questions?
We have a very bad tendency to base our plans for computers on the equipment we have in house and the things we’re doing now. And totally fail to review them in the light of the equipment that will be available and the things that we will be doing — I think the saddest phrase I ever hear in a computer installation is that horrible one "but we’ve always done it that way." That’s a forbidden phrase in my office.
Capt. Grace Hopper
Future Possibilities: Data, Hardware, Software, and People — August 26, 1982
References
ByteBoost Workshop ‘24
Neocortex @
Leighton Wilson and Mathias Jacquelin
@ Cerebras
Future Work
Results
agent-based model
beneficial
λ=1 in 100k
deleterious
λ=1 in 1k
poisson distribution
agent-based model
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
🏝️ 🏝️ 🏝️ 🏝️
1 billion agents
agent-based model
beneficial
λ=1 in 100k
deleterious
λ=1 in 1k
∞
vs
agent-based model
beneficial
λ=1 in 100k
deleterious
λ=1 in 1k
poisson distribution
∞
vs
agent-based model
beneficial
λ=1 in 100k
deleterious
λ=1 in 1k
poisson distribution
max n
1 billion agents
1 billion agents
agent-based model
beneficial
λ=1 in 100k
deleterious
λ=1 in 1k
poisson distribution
agent-based model
beneficial
p=1 in 100k
deleterious
λ=1 in 1k
n loci available
n loci
n loci
n loci
100 million agents
Generations
50/50
Generations
50/50
Generations
1 in 100k
denovo
1 in 100k
denovo
n loci
1 in 100k
denovo
n loci
1 in 100k
denovo
n loci
1 in 100k
denovo
n loci
1 in 100k
denovo
n loci
1 in 100k
denovo
n loci
1 in 100k
denovo
Next Steps
Next Steps
VS
osmotic pressure
antibiotics
Callens et al., 2023
Next Steps
VS
osmotic pressure
more adaptive loci
more hypermutators
antibiotics
fewer adaptive loci
fewer hypermutators
Callens et al., 2023
Q: how many beneficial muts per strain?
Next Steps
VS
osmotic pressure
more adaptive loci
more hypermutators
antibiotics
fewer adaptive loci
fewer hypermutators
Callens et al., 2023
Q: how many beneficial muts per strain?
Tagged, Event-driven Programming Model
N
E
S
W
“Ramp”
Tagged, Event-driven Programming Model
“Ramp”
N
E
S
W
“Wavelet”
“Wavelet”
Tagged, Event-driven Programming Model
“Ramp”
N
E
S
W
“Wavelet”
“Wavelet”
Queue
…
fn doTask(wav) {
int c = 10;
…
}
Task
[more about WSE programming model in pocket slides]
GraphCore IPU — another AI/ML accelerator
📧 morenoma@umich.edu
Part 1: On-hardware Experiment
Scale and Digital Evolution
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
LTEE
(Good et al., 2017)
E.
coli
Scale and Digital Evolution
LTEE
(Good et al., 2017)
Avida
(Ofria and Wilke, 2009)
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
Image credit: Credit: National Institute of Allergy and Infectious Diseases, National Institutes of Health
E.
coli
Scale and Digital Evolution
LTEE
(Good et al., 2017)
Avida
(Ofria and Wilke, 2009)
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
Image credit: Credit: National Institute of Allergy and Infectious Diseases, National Institutes of Health
E.
coli
Scale and Digital Evolution
Cross-scale Phenomena:
LTEE
(Good et al., 2017)
Avida
(Ofria and Wilke, 2009)
📧 morenoma@umich.edu
📚 [these slides] https://hopth.ru/ea
E.
coli
GPU
ALIEN Project (Heinemann, 2024)
MFM/ULAM/T2 Tiles (Ackley, 2023)
Illuninato x Machina
(Ackley, 2010)
📚 [slides, paper, code] https://hopth.ru/de
Objective: Develop Methods to Harness Next Generation AI/ML Hardware for Agent-based Evolution Experiments
📧 morenoma@umich.edu