public void run() {
// generate test data
- int iter = 700; //200;
+ int iter = 1000; //200;
int seed = 1967;
//Vector testdata = new Vector(iter);
FibHeap fh = new FibHeap();
public static final int kMaxTreeDepth;// = 16;
public TestRunner() {
- kStretchTreeDepth = 12;// 1/2Mb 18; // about 16Mb
- kLongLivedTreeDepth = 10; // 1/8Mb 16; // about 4Mb
- kArraySize = 125000/16; // 1/8Mb 500000; // about 4Mb
+ kStretchTreeDepth = 13;// 1Mb 18; // about 16Mb
+ kLongLivedTreeDepth = 11; // 1/4Mb 16; // about 4Mb
+ kArraySize = 125000/8; // 1/4Mb 500000; // about 4Mb
kMinTreeDepth = 4;
kMaxTreeDepth = 16;
}
//System.printString("task t1\n");
int threadnum = 62;
- int size = 21500;
+ int size = 30000;
int nodenum = size*10;
for(int i = 0; i < threadnum; ++i) {
TestRunner tr = new TestRunner(i, size, nodenum){run};
//System.printString("task t1\n");
int threadnum = 62;
- int size = threadnum * 20;
+ int size = threadnum * 25;
Composer comp = new Composer(threadnum, size){compose};
for(int i = 0; i < threadnum; ++i) {
TestRunner tr = new TestRunner(i, threadnum, size){run};
#define BAMBOO_SMEM_SIZE (64 * 64) // (BAMBOO_PAGE_SIZE)
#define BAMBOO_SHARED_MEM_SIZE ((BAMBOO_PAGE_SIZE) *(BAMBOO_NUM_PAGES))
#else
-#define BAMBOO_NUM_PAGES (256) //(15 * 1024) //(64 * 4 * 0.75) //(1024 * 1024 * 3.5) 3G
+#define BAMBOO_NUM_PAGES (62*(2+3)) //(15 * 1024) //(64 * 4 * 0.75) //(1024 * 1024 * 3.5) 3G
#define BAMBOO_PAGE_SIZE (4 * 1024 * 1024) // (4096)
#define BAMBOO_SMEM_SIZE (4 * 1024 * 1024)
-#define BAMBOO_SHARED_MEM_SIZE (1024 * 1024 * 1024) //(1024 * 1024 * 240)
-//((unsigned long long int)(3.0 * 1024 * 1024 * 1024)) // 3G// ((BAMBOO_PAGE_SIZE) * (BAMBOO_NUM_PAGES))
+#define BAMBOO_SHARED_MEM_SIZE ((BAMBOO_PAGE_SIZE) * (BAMBOO_NUM_PAGES)) //(1024 * 1024 * 240)
+//((unsigned long long int)(3.0 * 1024 * 1024 * 1024)) // 3G
#endif // GC_DEBUG
#ifdef MULTICORE_GC