Index: libcfa/src/concurrency/channel.hfa
===================================================================
--- libcfa/src/concurrency/channel.hfa	(revision d63aeba5a24ac19ed7984faac773e20ce8121052)
+++ libcfa/src/concurrency/channel.hfa	(revision 18ea27021ff0fe65c973c52544e628846f77eb1a)
@@ -28,4 +28,5 @@
     exp_backoff_then_block_lock c_lock, p_lock;
     __spinlock_t mutex_lock;
+    char __padding[64]; // avoid false sharing in arrays
 };
 
Index: tests/concurrent/channels/parallel_harness.hfa
===================================================================
--- tests/concurrent/channels/parallel_harness.hfa	(revision d63aeba5a24ac19ed7984faac773e20ce8121052)
+++ tests/concurrent/channels/parallel_harness.hfa	(revision 18ea27021ff0fe65c973c52544e628846f77eb1a)
@@ -100,5 +100,5 @@
 
 int test( size_t Processors, size_t Channels, size_t Producers, size_t Consumers, size_t ChannelSize ) {
-    size_t Clusters = 1;
+    size_t Clusters = Processors;
     // create a cluster
     cluster clus[Clusters];
@@ -108,5 +108,5 @@
     }
 
-    channels = anew( Channels );
+    channels = aalloc( Channels );
 
     // sout | "Processors: " | Processors | " ProdsPerChan: " | Producers | " ConsPerChan: " | Consumers | "Channels: " | Channels | " Channel Size: " | ChannelSize;
@@ -150,19 +150,5 @@
         
     }
-    // for ( i; Channels ) {
-    //     // sout | get_count( channels[i] );
-    //     if ( get_count( channels[i] ) < Consumers ){
-    //         #ifdef BIG
-    //         bigObject b{0};
-    //         #endif
-    //         for ( j; Consumers ) {
-    //             #ifdef BIG
-    //             insert( channels[i], b );
-    //             #else
-    //             insert( channels[i], 0 );
-    //             #endif
-    //         }
-    //     }
-    // }
+
     sout | "cons";
     for ( i; Consumers * Channels ) {