diff --git a/.spelling b/.spelling
index 5087e18b3bf88c7e1e20d5cd4757b518b7533b68..8bb1fc223af4955de6d57fa26186b23630386154 100644
--- a/.spelling
+++ b/.spelling
@@ -75,6 +75,8 @@ DECI
 supercomputing
 AnyConnect
 X11
+backfilling
+backfilled
  - docs.it4i/anselm-cluster-documentation/environment-and-modules.md
 MODULEPATH
 bashrc
@@ -113,6 +115,8 @@ RedHat
  - docs.it4i/anselm-cluster-documentation/job-priority.md
 walltime
 qexp
+_List.fairshare
+_time
  - docs.it4i/anselm-cluster-documentation/job-submission-and-execution.md
 15209.srv11
 qsub
@@ -243,3 +247,7 @@ r4i7n17
 cns577
 cns1008
 r37u31n1008
+ - docs.it4i/anselm-cluster-documentation/resources-allocation-policy.md
+qsub
+it4ifree
+it4i.portal.clients
diff --git a/docs.it4i/anselm-cluster-documentation/job-priority.md b/docs.it4i/anselm-cluster-documentation/job-priority.md
index 6e88bea5090180461e8885beaabd0c408a3e11d1..347926c31b3b54f41a62f1a9ccc6b474052507d3 100644
--- a/docs.it4i/anselm-cluster-documentation/job-priority.md
+++ b/docs.it4i/anselm-cluster-documentation/job-priority.md
@@ -9,24 +9,24 @@ Scheduler gives each job an execution priority and then uses this job execution
 Job execution priority on Anselm is determined by these job properties (in order of importance):
 
 1.  queue priority
-2.  fairshare priority
+2.  fair-share priority
 3.  eligible time
 
 ### Queue priority
 
 Queue priority is priority of queue where job is queued before execution.
 
-Queue priority has the biggest impact on job execution priority. Execution priority of jobs in higher priority queues is always greater than execution priority of jobs in lower priority queues. Other properties of job used for determining job execution priority (fairshare priority, eligible time) cannot compete with queue priority.
+Queue priority has the biggest impact on job execution priority. Execution priority of jobs in higher priority queues is always greater than execution priority of jobs in lower priority queues. Other properties of job used for determining job execution priority (fair-share priority, eligible time) cannot compete with queue priority.
 
 Queue priorities can be seen at <https://extranet.it4i.cz/anselm/queues>
 
-### Fairshare priority
+### Fair-share priority
 
-Fairshare priority is priority calculated on recent usage of resources. Fairshare priority is calculated per project, all members of project share same fairshare priority. Projects with higher recent usage have lower fairshare priority than projects with lower or none recent usage.
+Fair-share priority is priority calculated on recent usage of resources. Fair-share priority is calculated per project, all members of project share same fair-share priority. Projects with higher recent usage have lower fair-share priority than projects with lower or none recent usage.
 
-Fairshare priority is used for ranking jobs with equal queue priority.
+Fair-share priority is used for ranking jobs with equal queue priority.
 
-Fairshare priority is calculated as
+Fair-share priority is calculated as
 
 ![](../../img/fairshare_formula.png)
 
@@ -34,15 +34,15 @@ where MAX_FAIRSHARE has value 1E6, usage~Project~ is cumulated usage by all memb
 
 Usage counts allocated core hours (ncpus*walltime). Usage is decayed, or cut in half periodically, at the interval 168 hours (one week). Jobs queued in queue qexp are not calculated to project's usage.
 
->Calculated usage and fairshare priority can be seen at <https://extranet.it4i.cz/anselm/projects>.
+>Calculated usage and fair-share priority can be seen at <https://extranet.it4i.cz/anselm/projects>.
 
-Calculated fairshare priority can be also seen as Resource_List.fairshare attribute of a job.
+Calculated fair-share priority can be also seen as Resource_List.fairshare attribute of a job.
 
 ###Eligible time
 
 Eligible time is amount (in seconds) of eligible time job accrued while waiting to run. Jobs with higher eligible time gains higher priority.
 
-Eligible time has the least impact on execution priority. Eligible time is used for sorting jobs with equal queue priority and fairshare priority. It is very, very difficult for eligible time to compete with fairshare priority.
+Eligible time has the least impact on execution priority. Eligible time is used for sorting jobs with equal queue priority and fair-share priority. It is very, very difficult for eligible time to compete with fair-share priority.
 
 Eligible time can be seen as eligible_time attribute of job.
 
diff --git a/docs.it4i/anselm-cluster-documentation/resource-allocation-and-job-execution.md b/docs.it4i/anselm-cluster-documentation/resource-allocation-and-job-execution.md
index fa2f1d68798e408b03e146a93097b8d42116f7e6..a4f8f2e36251c0b7881e05f1ec3cf925588b22b0 100644
--- a/docs.it4i/anselm-cluster-documentation/resource-allocation-and-job-execution.md
+++ b/docs.it4i/anselm-cluster-documentation/resource-allocation-and-job-execution.md
@@ -5,7 +5,7 @@ To run a [job](../introduction/), [computational resources](../introduction/) fo
 
 Resources Allocation Policy
 ---------------------------
-The resources are allocated to the job in a fairshare fashion, subject to constraints set by the queue and resources available to the Project. [The Fairshare](job-priority/) at Anselm ensures that individual users may consume approximately equal amount of resources per week. The resources are accessible via several queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following queues are available to Anselm users:
+The resources are allocated to the job in a fair-share fashion, subject to constraints set by the queue and resources available to the Project. [The Fair-share](job-priority/) at Anselm ensures that individual users may consume approximately equal amount of resources per week. The resources are accessible via several queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following queues are available to Anselm users:
 
 - **qexp**, the Express queue
 - **qprod**, the Production queue
diff --git a/docs.it4i/anselm-cluster-documentation/resources-allocation-policy.md b/docs.it4i/anselm-cluster-documentation/resources-allocation-policy.md
index 72fd68b2380189a12e9c414095cd0e5920059db0..90edd08ccd20e6c0af2490f66c6f91107b32d128 100644
--- a/docs.it4i/anselm-cluster-documentation/resources-allocation-policy.md
+++ b/docs.it4i/anselm-cluster-documentation/resources-allocation-policy.md
@@ -3,7 +3,7 @@ Resources Allocation Policy
 
 Resources Allocation Policy
 ---------------------------
-The resources are allocated to the job in a fairshare fashion, subject to constraints set by the queue and resources available to the Project. The Fairshare at Anselm ensures that individual users may consume approximately equal amount of resources per week. Detailed information in the [Job scheduling](job-priority/) section. The resources are accessible via several queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following table provides the queue partitioning overview:
+The resources are allocated to the job in a fair-share fashion, subject to constraints set by the queue and resources available to the Project. The Fair-share at Anselm ensures that individual users may consume approximately equal amount of resources per week. Detailed information in the [Job scheduling](job-priority/) section. The resources are accessible via several queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following table provides the queue partitioning overview:
 
 !!! Note "Note"
 	Check the queue status at https://extranet.it4i.cz/anselm/
diff --git a/docs.it4i/salomon/job-priority.md b/docs.it4i/salomon/job-priority.md
index 5f479260d59b55b4434427fa7ccfeaac5fb18eb9..e84eb0a2b1e5b7c3ffd80d41e8b6303f839646fe 100644
--- a/docs.it4i/salomon/job-priority.md
+++ b/docs.it4i/salomon/job-priority.md
@@ -8,24 +8,24 @@ Scheduler gives each job an execution priority and then uses this job execution
 Job execution priority is determined by these job properties (in order of importance):
 
 1.  queue priority
-2.  fairshare priority
+2.  fair-share priority
 3.  eligible time
 
 ### Queue priority
 
 Queue priority is priority of queue where job is queued before execution.
 
-Queue priority has the biggest impact on job execution priority. Execution priority of jobs in higher priority queues is always greater than execution priority of jobs in lower priority queues. Other properties of job used for determining job execution priority (fairshare priority, eligible time) cannot compete with queue priority.
+Queue priority has the biggest impact on job execution priority. Execution priority of jobs in higher priority queues is always greater than execution priority of jobs in lower priority queues. Other properties of job used for determining job execution priority (fair-share priority, eligible time) cannot compete with queue priority.
 
 Queue priorities can be seen at <https://extranet.it4i.cz/rsweb/salomon/queues>
 
-### Fairshare priority
+### Fair-share priority
 
-Fairshare priority is priority calculated on recent usage of resources. Fairshare priority is calculated per project, all members of project share same fairshare priority. Projects with higher recent usage have lower fairshare priority than projects with lower or none recent usage.
+Fair-share priority is priority calculated on recent usage of resources. Fair-share priority is calculated per project, all members of project share same fair-share priority. Projects with higher recent usage have lower fair-share priority than projects with lower or none recent usage.
 
-Fairshare priority is used for ranking jobs with equal queue priority.
+Fair-share priority is used for ranking jobs with equal queue priority.
 
-Fairshare priority is calculated as
+Fair-share priority is calculated as
 
 ![](../../img/fairshare_formula.png)
 
@@ -34,15 +34,15 @@ where MAX_FAIRSHARE has value 1E6, usage~Project~ is cumulated usage by all memb
 Usage counts allocated core hours (ncpus*walltime). Usage is decayed, or cut in half periodically, at the interval 168 hours (one week). Jobs queued in queue qexp are not calculated to project's usage.
 
 !!! Note "Note"
-	Calculated usage and fairshare priority can be seen at <https://extranet.it4i.cz/rsweb/salomon/projects>.
+	Calculated usage and fair-share priority can be seen at <https://extranet.it4i.cz/rsweb/salomon/projects>.
 
-Calculated fairshare priority can be also seen as Resource_List.fairshare attribute of a job.
+Calculated fair-share priority can be also seen as Resource_List.fairshare attribute of a job.
 
 ###Eligible time
 
 Eligible time is amount (in seconds) of eligible time job accrued while waiting to run. Jobs with higher eligible time gains higher priority.
 
-Eligible time has the least impact on execution priority. Eligible time is used for sorting jobs with equal queue priority and fairshare priority. It is very, very difficult for eligible time to compete with fairshare priority.
+Eligible time has the least impact on execution priority. Eligible time is used for sorting jobs with equal queue priority and fair-share priority. It is very, very difficult for eligible time to compete with fair-share priority.
 
 Eligible time can be seen as eligible_time attribute of job.
 
diff --git a/docs.it4i/salomon/resource-allocation-and-job-execution.md b/docs.it4i/salomon/resource-allocation-and-job-execution.md
index 597f034b6602d00e5f653d81e8e077487817aaa1..283ae774617c28048f6f8d9e892bd2dbfe8ae73b 100644
--- a/docs.it4i/salomon/resource-allocation-and-job-execution.md
+++ b/docs.it4i/salomon/resource-allocation-and-job-execution.md
@@ -5,7 +5,7 @@ To run a [job](job-submission-and-execution/), [computational resources](resourc
 
 Resources Allocation Policy
 ---------------------------
-The resources are allocated to the job in a fairshare fashion, subject to constraints set by the queue and resources available to the Project. [The Fairshare](job-priority/) at Salomon ensures that individual users may consume approximately equal amount of resources per week. The resources are accessible via several queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following queues are available to Anselm users:
+The resources are allocated to the job in a fair-share fashion, subject to constraints set by the queue and resources available to the Project. [The Fair-share](job-priority/) at Salomon ensures that individual users may consume approximately equal amount of resources per week. The resources are accessible via several queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following queues are available to Anselm users:
 
 - **qexp**, the Express queue
 - **qprod**, the Production queue
diff --git a/docs.it4i/salomon/resources-allocation-policy.md b/docs.it4i/salomon/resources-allocation-policy.md
index 7c4462b59198787955704deeaa8d2343e587791b..d3813d410761b1286caec2f90213a18950586167 100644
--- a/docs.it4i/salomon/resources-allocation-policy.md
+++ b/docs.it4i/salomon/resources-allocation-policy.md
@@ -3,7 +3,7 @@ Resources Allocation Policy
 
 Resources Allocation Policy
 ---------------------------
-The resources are allocated to the job in a fairshare fashion, subject to constraints set by the queue and resources available to the Project. The Fairshare at Anselm ensures that individual users may consume approximately equal amount of resources per week. Detailed information in the [Job scheduling](job-priority/) section. The resources are accessible via several queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following table provides the queue partitioning overview:
+The resources are allocated to the job in a fair-share fashion, subject to constraints set by the queue and resources available to the Project. The Fair-share at Anselm ensures that individual users may consume approximately equal amount of resources per week. Detailed information in the [Job scheduling](job-priority/) section. The resources are accessible via several queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following table provides the queue partitioning overview:
 
 !!! Note "Note"
 	Check the queue status at https://extranet.it4i.cz/rsweb/salomon/