Index: doc/theses/thierry_delisle_PhD/code/relaxed_list.cpp
===================================================================
--- doc/theses/thierry_delisle_PhD/code/relaxed_list.cpp	(revision 50aeb6ffc5d975fd3a5272488078f72cb24797e3)
+++ doc/theses/thierry_delisle_PhD/code/relaxed_list.cpp	(revision 1e24d136f25283f797c025440eb7b69e0b3e0d9d)
@@ -112,4 +112,6 @@
 			if(r < fill)
 				node = new Node(rand.next() % 100);
+			else
+				node = nullptr;
 		}
 
@@ -177,5 +179,5 @@
 			break;
 		}
-		std::cout << "\r" << durr.count();
+		std::cout << "\r" << durr.count() << "/" << duration;
 		std::cout.flush();
 	}
@@ -264,5 +266,5 @@
 
 	std::cout << "Running " << nthreads << " threads (" << (nthreads * nqueues) << " queues) for " << duration << " seconds" << std::endl;
-	run(nthreads, nqueues, duration, fill);
+	run(nthreads, nqueues, fill, duration);
 
 	return 0;