documented hyperqueue

documentation of hyperqueue for capacity computing

docs.it4i/general/capacity-computing.md

@@ -160,19 +160,19 @@ HyperQueue lets you build a computation plan consisting of a large amount of tas
 
 * **Transparent task execution on top of a Slurm/PBS cluster**
 
-  Automatic task distribution amongst jobs, nodes, and cores.
+    Automatic task distribution amongst jobs, nodes, and cores.
 
 * **Dynamic load balancing across jobs**
 
-  Work-stealing scheduler<br>NUMA-aware, core planning, task priorities, task arrays<br> Nodes and tasks may be added/removed on the fly
+    Work-stealing scheduler<br>NUMA-aware, core planning, task priorities, task arrays<br> Nodes and tasks may be added/removed on the fly
 
 * **Scalable**
 
-  Low overhead per task (~100μs)<br>Handles hundreds of nodes and millions of tasks<br>Output streaming avoids creating many files on network filesystems
+    Low overhead per task (~100μs)<br>Handles hundreds of nodes and millions of tasks<br>Output streaming avoids creating many files on network filesystems
 
 * **Easy deployment**
 
-  Single binary, no installation, depends only on *libc*<br>No elevated privileges required
+    Single binary, no installation, depends only on *libc*<br>No elevated privileges required
 
 * **Open source**