 	success04_2 = success04_2 && run_all_experiments<4,2>(8192,32,16);
 	success04_3 = success04_3 && run_all_experiments<4,3>(8192,32,16);
 
+	//success16_0 = success16_0 && run_experiment<16,0>(512,1,512,512,1);
+
 	fprintf(stdout,"\nResults:\n");
 	fprintf(stdout,"\tAlignment16-Offset0: %s\n",(success16_0?"SUCCESS":"FAILURE"));
 	fprintf(stdout,"\tAlignment08-Offset0: %s\n",(success08_0?"SUCCESS":"FAILURE"));

			//printf("%f ",h_odata[out_index+j]);
			if (h_idata[in_index+j] != h_odata[out_index+j])
			{
				fprintf(stdout,"Experiment: %ld element bytes, %d elements, %ld source stride, %ld destination stride, %d DMA warps, %d alignment, %d offset, ",element_size*sizeof(float),element_count,src_stride*sizeof(float),dst_stride*sizeof(float),dma_warps,ALIGNMENT,ALIGN_OFFSET);
				fprintf(stdout,"Index %d of element %d was expecting %f but received %f, ", j, i, h_idata[in_index+j], h_odata[out_index+j]);
				pass = false;
				break;
			}

		// Let's only check full stride cases if element_size is divisible by 31 so we can
		// make the search space a little sparser and also test lots of potential strides
		// on weird alignment offsets
		if ((element_size%1031)==0)
		{
			// Make each of the strides range from min_stride to 2*min_stride
			// This should cover all of the cases for a given element size
