Bitonic Sort Update 2 (#318)

* Changed default values and added auto sort at start

* Added stepIndex and totalStep to execution Information and allowed for dynamic updating of sort speed

* Scaffolding for global sort and renaming of controller elements from 'cell' to 'controller' to accord with Dat.gui's built in types

* removed anys for greggman

* Safety commit

* Adjusted bindGroups and uniform placement and added different visualization of swap regions

* Adjusted bindGroups, adjusted uniforms, and added a new visualization of swap regions

* Removed pointerEvents from non-interactive gui elements and added atomic account of number of swaps performed during a sort

* Made totalSwaps non-interactive :(

* Condense information in multiple Gui elements down to single Gui elements

* Added thread constraint

* Added ability to constrain maximum number of threads/invocations per workgroup, which reflects in the execution information as well

* Get rid of todos

* Remove unused folder

* removed references to threads in main.ts, removed references to removed portions of code, codeMirror for compute shader now displays the .ts file from which the compute shader is constructed rather than a version of the compute shader that takes an arbitrary number of invocationsPerWorkgroup

* Removed all references to threads in bitonicCompute.ts

* Added new descriptions for each of the settings elements

* Implemented most ben-clayton naming suggestions

* Fixed minor spacing issue to make prettier happy

Author: cmhhelgeson

src/sample/bitonicSort/computeShader.ts renamed to src/sample/bitonicSort/bitonicCompute.ts

@@ -1,8 +1,8 @@
 export const computeArgKeys = ['width', 'height', 'algo', 'blockHeight'];
 
-export const NaiveBitonicCompute = (threadsPerWorkgroup: number) => {
-  if (threadsPerWorkgroup % 2 !== 0 || threadsPerWorkgroup > 256) {
-    threadsPerWorkgroup = 256;
+export const NaiveBitonicCompute = (workgroupSize: number) => {
+  if (workgroupSize % 2 !== 0 || workgroupSize > 256) {
+    workgroupSize = 256;
   }
   // Ensure that workgroupSize is half the number of elements
   return `
@@ -15,7 +15,7 @@ struct Uniforms {
 }
 
 // Create local workgroup data that can contain all elements
-var<workgroup> local_data: array<u32, ${threadsPerWorkgroup * 2}>;
+var<workgroup> local_data: array<u32, ${workgroupSize * 2}>;
 
 // Define groups (functions refer to this data)
 @group(0) @binding(0) var<storage, read> input_data: array<u32>;
@@ -35,25 +35,25 @@ fn local_compare_and_swap(idx_before: u32, idx_after: u32) {
   return;
 }
 
-// thread_id goes from 0 to threadsPerWorkgroup
-fn get_flip_indices(thread_id: u32, block_height: u32) -> vec2<u32> {
+// invoke_id goes from 0 to workgroupSize
+fn get_flip_indices(invoke_id: u32, block_height: u32) -> vec2<u32> {
   // Caculate index offset (i.e move indices into correct block)
-  let block_offset: u32 = ((2 * thread_id) / block_height) * block_height;
+  let block_offset: u32 = ((2 * invoke_id) / block_height) * block_height;
   let half_height = block_height / 2;
   // Calculate index spacing
   var idx: vec2<u32> = vec2<u32>(
-    thread_id % half_height, block_height - (thread_id % half_height) - 1,
+    invoke_id % half_height, block_height - (invoke_id % half_height) - 1,
   );
   idx.x += block_offset;
   idx.y += block_offset;
   return idx;
 }
 
-fn get_disperse_indices(thread_id: u32, block_height: u32) -> vec2<u32> {
-  var block_offset: u32 = ((2 * thread_id) / block_height) * block_height;
+fn get_disperse_indices(invoke_id: u32, block_height: u32) -> vec2<u32> {
+  var block_offset: u32 = ((2 * invoke_id) / block_height) * block_height;
   let half_height = block_height / 2;
 	var idx: vec2<u32> = vec2<u32>(
-    thread_id % half_height, (thread_id % half_height) + half_height
+    invoke_id % half_height, (invoke_id % half_height) + half_height
   );
   idx.x += block_offset;
   idx.y += block_offset;
@@ -73,20 +73,20 @@ const ALGO_LOCAL_FLIP = 1;
 const ALGO_LOCAL_DISPERSE = 2;
 const ALGO_GLOBAL_FLIP = 3;
 
-// Our compute shader will execute specified # of threads or elements / 2 threads
-@compute @workgroup_size(${threadsPerWorkgroup}, 1, 1)
+// Our compute shader will execute specified # of invocations or elements / 2 invocations
+@compute @workgroup_size(${workgroupSize}, 1, 1)
 fn computeMain(
   @builtin(global_invocation_id) global_id: vec3<u32>,
   @builtin(local_invocation_id) local_id: vec3<u32>,
   @builtin(workgroup_id) workgroup_id: vec3<u32>,
 ) {
 
-  let offset = ${threadsPerWorkgroup} * 2 * workgroup_id.x;
+  let offset = ${workgroupSize} * 2 * workgroup_id.x;
   // If we will perform a local swap, then populate the local data
   if (uniforms.algo <= 2) {
     // Assign range of input_data to local_data.
     // Range cannot exceed maxWorkgroupsX * 2
-    // Each thread will populate the workgroup data... (1 thread for every 2 elements)
+    // Each invocation will populate the workgroup data... (1 invocation for every 2 elements)
     local_data[local_id.x * 2] = input_data[offset + local_id.x * 2];
     local_data[local_id.x * 2 + 1] = input_data[offset + local_id.x * 2 + 1];
   }
@@ -116,7 +116,7 @@ fn computeMain(
     }
   }
 
-  // Ensure that all threads have swapped their own regions of data
+  // Ensure that all invocations have swapped their own regions of data
   workgroupBarrier();
 
   if (uniforms.algo <= ALGO_LOCAL_DISPERSE) {