• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0

Testing a GC implementation

1 post in this topic

Just finished implementing a "cooperative" incremental conservative mark and sweep garbage collector. Basic test coverage is also present and passes, BUT ... having trouble coming up with bigger tests and stress tests to better understand its behavior and theoretical limits.

How to generate a mess of classes and modify the relations without accidentally killing off too many branches or having it infinitely glow? Ideas?

(minor note: in the end i want to record the modifications/additions as replay for tests, so - generating it does not have to be super fast, just reasonable).

Some details about the GC implementation (most of it likely fairly irrelevant to the question, but anyway):

User view (slightly relevant to the question):

struct GcObject {
  USE_GC(100); // adds GC trait to this class (not inheritable), 100 = hint of how many objects you expect to have (not a limit in any sense)
  GC<GcObject> var_next; // behaves as a pointer to GcObject
  // GC<NonGcObject> var_error; // this is compile time error (all GC pointers, a'la GCRoot etc, accept only objects with GC trait)
  Array<GcObject> var_array; // there are wrappers for a few things i use the most: array/vector and hashmap - the wrapper detects on its own that it is for GC-trait objects and does what it needs to do (most notably, the array will be for "GcObject*"). + version for dynamic root and static

struct NonGcObject {
  GCRoot<GcObject> var_root; // dynamic root for GC - behaves as a pointer to GcObject
  // GC<GcObject> var_error; // this is runtime error (assert) - so, debug mode only

GCStatic<GcObject> var_static; // static root for GC - behaves as a pointer to GcObject
//GC<GcObject> var_error; // assert

// currently there is no way to detect misplaced GCRoot/GCStatic

* It is meant for class-objects and not data blobs.
* Discards pointers to already encountered objects very cache friendly (32MB of objects are covered by 2-16 pages of GC internal structures needed for identification / discard) - does not reference objects memory at any point.
* Per object type: discovers and records object structure for faster processing in future (however: never assumes that it identified the structure correctly - except locations for non pointers to GC memory). If it detects that an object can not have any pointers to GC memory then it will skip processing of all objects of the relevant type in future.
* Processes in patches per type (for cache locality of the target objects and GC internals).
* GC trait adds a memory pooling scheme for the class - cache locality for GC and whatever is using the class.
* Pool: maintains an ordered list (inc pointer address) of free items - to eliminate degradation of locality as much as possible.
* GC does not touch the objects memory on delete if the object does not have a destructor. Same for constructor - but that is hardly useful.
* Does not examine stack and hence does not allow invocation at random points.
* Garbage collection invocation: MemGC::tickMain(timeslice_in_seconds).
* It is possible to offload the majority of the work to a worker thread - but i doubt it is useful and i probably will never implement it.
* Allocation of GC-trait objects is not thread safe - simply never needed, which makes justifying the overhead rather impossible.
* probably something more

Edited by tanzanite7

Share this post

Link to post
Share on other sites
You have basically three axes to worry about:

- Number of allocations
- Depth of reference tree
- Lifetime of objects

Things get interesting at basically any extreme combination of two or more of these axes. It should be pretty straightforward to invent a test that can stress each axis individually, and then you can combine them to stress multiple areas simultaneously.

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  
Followers 0