Index: libcfa/src/concurrency/ready_queue.cfa
===================================================================
--- libcfa/src/concurrency/ready_queue.cfa	(revision 431cd4fc38b74e3dd30d07d84dd46cb8017afe4e)
+++ libcfa/src/concurrency/ready_queue.cfa	(revision c8a02103529bbac3a87ecc27896ddaea00e4e292)
@@ -44,6 +44,8 @@
 	#define BIAS 4
 	#define READYQ_SHARD_FACTOR 4
+	#define SEQUENTIAL_SHARD 1
 #elif defined(USE_WORK_STEALING)
 	#define READYQ_SHARD_FACTOR 2
+	#define SEQUENTIAL_SHARD 2
 #else
 	#error no scheduling strategy selected
@@ -216,5 +218,5 @@
 
 void ^?{}(__ready_queue_t & this) with (this) {
-	verify( 1 == lanes.count );
+	verify( SEQUENTIAL_SHARD == lanes.count );
 	free(lanes.data);
 	free(lanes.tscs);
@@ -614,5 +616,5 @@
 			ncount = target * READYQ_SHARD_FACTOR;
 		} else {
-			ncount = 1;
+			ncount = SEQUENTIAL_SHARD;
 		}
 
@@ -662,5 +664,5 @@
 		// Find new count
 		// Make sure we always have atleast 1 list
-		lanes.count = target >= 2 ? target * READYQ_SHARD_FACTOR: 1;
+		lanes.count = target >= 2 ? target * READYQ_SHARD_FACTOR: SEQUENTIAL_SHARD;
 		/* paranoid */ verify( ocount >= lanes.count );
 		/* paranoid */ verify( lanes.count == target * READYQ_SHARD_FACTOR || target < 2 );