Archived: GCTest2.java - Garbage Collection Test Program

Java 8 GC Tutorials - Herong's Tutorial Examples

∟Archived: GCTest2.java - Garbage Collection Test Program

This section describes a garbage collection test program - GCTest2.java.

We all know that objects that are not referenced will be removed from memory by the garbage collector. But we don't know how this process works exactly. I wrote the following program to try to figure this out.

/* GCTest2.java
 * Copyright (c) HerongYang.com. All Rights Reserved.
 */
import java.util.*;
class GCTest2 {
   static MyList objList = null;
   static int wait = 1000; // in milliseconds: 1 second
   static int objSize = 1280; // in KB, default = 1.25 M
   static int initSteps = 320; // # of initial objects
   static int testSteps = 32; // # of added objects
   public static void main(String[] arg) {
      if (arg.length>0) objSize = Integer.parseInt(arg[0]);
      if (arg.length>1) initSteps = Integer.parseInt(arg[1]);
      if (arg.length>2) testSteps = Integer.parseInt(arg[2]);
      System.out.println("Test parameters:");
      System.out.println("   Object size: "+objSize+"KB");
      System.out.println("   Initial objects and data size: "
         +initSteps+", "+(initSteps*objSize)+"KB");
      System.out.println("   Added objects and data size: "
         +testSteps+", "+(testSteps*objSize)+"KB");
      objList = new MyList();
      myTest();
   }
   public static void myTest() {
      for (int m=0; m<initSteps; m++) {
         objList.add(new MyObject());
      }

      Runtime rt = Runtime.getRuntime();
      System.out.println(
         "Time  Total  Free  Used  Free  Total  Act.  Dead  Over");
      System.out.println(
         "sec.   Mem.  Mem.  Mem.    %.   Obj.  Obj.  Obj.  Head");
      long dt0 = System.currentTimeMillis()/1000;
      while (true) {
         for (int m=0; m<testSteps; m++) {
            objList.add(new MyObject());
         }
         for (int m=0; m<testSteps; m++) {
            objList.removeTail();
         }

         mySleep(wait);
         long tm = rt.totalMemory()/1024;
         long fm = rt.freeMemory()/1024;
         long ratio = (100*fm)/tm;
         long dt = System.currentTimeMillis()/1000 - dt0;
         long to = MyObject.getCount()*objSize;
         long ao = MyList.getCount()*objSize;
         System.out.println(dt
            +"  "+tm+"  "+fm+"  "+(tm-fm)+"  "+ratio+"%"
            +"  "+to+"  "+ao+"  "+(to-ao)
            +"  "+(tm-fm-to));
      }
   }

   static void mySleep(int t) {
      try {
         Thread.sleep(t);
      } catch (InterruptedException e) {
         System.out.println("Interreupted...");
      }
   }
   static class MyObject {
      private static long count = 0;
      private long[] obj = null;
      public MyObject next = null;
      public MyObject prev = null;
      public MyObject() {
         count++;
         obj = new long[objSize*128]; //128*8=1024 bytes
      }
      protected final void finalize() {
         count--;
      }
      static long getCount() {
         return count;
      }
   }
   static class MyList {
      static long count = 0;
      MyObject head = null;
      MyObject tail = null;
      static long getCount() {
         return count;
      }
      void add(MyObject o) {
         // add the new object to the head;
         if (head==null) {
            head = o;
            tail = o;
         } else {
            o.prev = head;
            head.next = o;
            head = o;
         }
         count++;
      }
      void removeTail() {
         if (tail!=null) {
            if (tail.next==null) {
               tail = null;
               head = null;
            } else {
               tail = tail.next;
               tail.prev = null;
            }
            count--;
         }
      }
      void removeHead() {
         if (head!=null) {
            if (head.prev==null) {
               tail = null;
               head = null;
            } else {
               head = head.prev;
               head.next = null;
            }
            count--;
         }
      }
   }
}

Some notes on the test program:

An inner class MyObject is used to represent a generic object. It has a fixed size of 128KB plus some overhead.
Another inner class MyList is used to as a manager to register and release objects. It uses a linked list data structure to do the job.
The main test method, myTest(), is divided two sections: the initialization section where a number of objects are added to the linked list; and the endless loop section where objects are added to the linked list, then removed from the list.
Three parameters are supported. The first one is "objSize" representing the data size of each object in KB. The second one is "initSteps" representing the number of steps to initialize the linked list. "initSteps" is also representing the number of objects being created to build the initial linked list. The first one is "testSteps" representing the number of steps to extend and shrink the linked list. "testSteps" is also representing the number of objects being created to extend the linked list and later being removed from the linked list.
Two types of statistics are collected by the program: memory usage statistics, including total memory, free memory, and the percentage of the free memory over total memory; and counts of object data size, including the total object data size, the active object size, and the dead object data size.
Memory usages and object data sizes are printed out in units of kilobytes (KB).
The overhead memory usage represents the memory that is used by the program, but not by the allocated data objects.