Fix typos in "In_Order_Queue" lesson

Lesson_Materials/In_Order_Queue/index.html

@@ -159,7 +159,7 @@
 						<div class="col" data-markdown>
 							* All commands are executed serially
 							* Ease of programming (no race conditions can occur)
-							* Potentialy lower-latency than out-of-order queues
+							* Potentially lower-latency than out-of-order queues
 							* Doesn't allow concurrency, potentially suboptimal performance
 						</div>
 					</div>
@@ -171,7 +171,10 @@
 					<div class="container">
 						<div class="col">
 							<code class="code-100pc"><pre>
-std::vector<std::pair<sycl::queue, std::function>> queues_tasks;
+using queue_task_pair =
+  std::pair&ltsycl::queue, std::function&gt;;
+std::vector&ltqueue_task_pair&gt queues_tasks;
+
 for (auto [Q, task]: queues_tasks)
   Q.submit(task);
 
@@ -181,7 +184,7 @@
 						</div>
 						<div class="col" data-markdown>
 							* Manual Scheduling (tasks need to be mapped to queues)
-							* Allow concurency between queues
+							* Allow concurrency between queues
 							* Painful to extract full concurrency
 						</div>
 					</div>
@@ -212,7 +215,7 @@
 					</div>
 					<div class="container" data-markdown>
 						- Transform the serial in-order scheduling to allow concurrent execution (using an out-of-order queue or multiple in-order queues)
-						- Mesure speedup
+						- Measure speedup
 					</div>
 				</section>
 				<section>

README.md

@@ -47,7 +47,8 @@ Pull Request so that they can be reviewed and merged in a timely manner.
 
 ### List of Contributors
 
-Codeplay Software Ltd., Heidelberg University, Intel, Xilinx and University of Bristol.
+Codeplay Software Ltd., Heidelberg University, Intel, Xilinx, University of Bristol,
+and Stream HPC.
 
 ## Supporting Organizations