From 29b43e178b9b0bcaa9e20adbeddb7d60159dbfcc Mon Sep 17 00:00:00 2001 From: zah Date: Wed, 12 Feb 2014 02:54:57 -0800 Subject: [PATCH] Updated GSoC 2014 Ideas (markdown) --- GSoC-2014-Ideas.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/GSoC-2014-Ideas.md b/GSoC-2014-Ideas.md index aeccf92..eb460e0 100644 --- a/GSoC-2014-Ideas.md +++ b/GSoC-2014-Ideas.md @@ -32,7 +32,7 @@ ___ #### Make Nimrod a viable research platform for Garbage Collection algorithms **Skill Requirements:** Familiarity with the various GC approaches and algorithms, knowledge of the compiler codegen modules. -Most of the popular garbage collected languages of today require a separately distributed run-time environment, responsible for executing the code and providing a predetermined set of garbage collection algorithms. This leaves little room for experimentation with various approaches and condemns GC researchers to develop and test their algorithms on specialized platforms such as the [Jikes RVM](http://jikesrvm.org/) that have limited practical significance. +Most of the popular garbage collected languages of today require a separately distributed run-time environment, providing only a predetermined set of garbage collection algorithms. This leaves little room for experimentation with various approaches and condemns GC researchers to develop and test their algorithms on specialized platforms such as the [Jikes RVM](http://jikesrvm.org/) that have limited practical significance. In contrast, in Nimrod, the garbage collection algorithm is chosen at compile-time and embedded in the resulting stand-alone native executable. This enables the users to pick a GC algorithm that's most suitable to their project and allows for a proliferation of GC algorithms, developed by independent groups and individuals, without requiring any modifications to be made to the standard Nimrod distribution.