[rvm-research] Question about CopyMS MMTk plan
Baptiste Saleil <[email protected]>
| Newsgroups | gmane.comp.java.jikes.rvm.devel |
|---|---|
| Message-ID | <CABsYLSfEANbyRpGS8fHCUqH3DZsvMT1F0cgET8gxmFBAa_vBqw@mail.gmail.com> |
Hello there, I'm currently working with JikesRVM's GC MMTk. I see in documentation differents StopTheWorld plans for the GC but have an question about one. Can you please give me more details about the algorithm used by the CopyMS plan[1] ? Is it using the "Best of Both Worlds" algorithm from Sylvain Stanchina and Matthias Meyer (ISMM'07) ? What exactly is what you call "nursery" and how do you use it ? Thanks. Baptiste Saleil [1] http://jikesrvm.sourceforge.net/apidocs/latest/org/mmtk/plan/copyms/CopyMS.html ------------------------------------------------------------------------------ This SF.net email is sponsored by Windows: Build for Windows Store. http://p.sf.net/sfu/windows-dev2dev _______________________________________________ Jikesrvm-researchers mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/jikesrvm-researchers