urbit/ares
1
1
Fork 0
mirror of https://github.com/urbit/ares.git synced 2024-11-22 15:08:54 +03:00
Code Issues Packages Projects Releases Wiki Activity

[docs] Milestone typos

Browse Source
This commit is contained in:
Edward Amsden 2022-05-09 17:43:26 -04:00 committed by GitHub
parent fbce827944
commit 119569c97e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
docs/proposal/milestones.md
View File

@ -28,7 +28,7 @@ The goal of this set of milestones is to validate the 2stackz memory model and i
The goal of this stage is to generate highly-linearized IR from Nock The goal of this stage is to generate highly-linearized IR from Nock
Mote that a substantial part of this milestone is already accomplished, if unvalidated. Note that a substantial part of this milestone is already accomplished, if unvalidated.
The New Mars project began with linearization of Nock across Nock 2 and Nock 9 being a problem without theoretical or design solution. The New Mars project began with linearization of Nock across Nock 2 and Nock 9 being a problem without theoretical or design solution.
Subject-knowledge analysis (SKA) is the (currently theoretical) artifact which permits such linearization. Subject-knowledge analysis (SKA) is the (currently theoretical) artifact which permits such linearization.
@ -39,7 +39,7 @@ Subject-knowledge analysis (SKA) is the (currently theoretical) artifact which p
## Later: heaps and paging ## Later: heaps and paging
The goal of this stage is to permit New MArs to function fully as a Mars, saving snapshots and event logs, and paging infrequently used and/or large data out to disk. The goal of this stage is to permit New Mars to function fully as a Mars, saving snapshots and event logs, and paging infrequently used and/or large data out to disk.
- Threshhold based eviction to a heap - Threshhold based eviction to a heap
- Heap collection strategies - Heap collection strategies