From c28a9a49c995e0e30a2a1a9edafb3d4491a31ce1 Mon Sep 17 00:00:00 2001 From: Justin Ethier Date: Tue, 24 Jul 2018 18:26:46 -0400 Subject: [PATCH] Expand intro section --- docs/Lazy-Sweeping.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/docs/Lazy-Sweeping.md b/docs/Lazy-Sweeping.md index 2359a025..7659dad2 100644 --- a/docs/Lazy-Sweeping.md +++ b/docs/Lazy-Sweeping.md @@ -27,6 +27,8 @@ The main goal of this process is to improve performance through: - Thread-Local Data - There is no need to lock the heap for allocation or sweeping since both operations are performed by the same thread. - Reduced Complexity - According to [[1]](#references) the algorithmic complexity of mark-sweep is reduced to be proportional to the size of the live data in the heap instead of the whole heap, similar to a copying collector. Lazy sweeping will perform best when most of the heap is empty. +In the latest version of Cyclone Scheme (0.9) we have modified major GC to use lazy sweeping. We discuss the changes required to the existing GC, present results, and consider next steps. + # Terms - Collector - A thread running the garbage collection code. The collector is responsible for coordinating and performing most of the work for major garbage collections.