Commit 3cca219a authored by David Hrbáč's avatar David Hrbáč

Links OK

parent ed50d950
# Applying for Resources
Computational resources may be allocated by any of the following [Computing resources allocation](http://www.it4i.cz/computing-resources-allocation/?lang=en) mechanisms.
Computational resources may be allocated by any of the following [Computing resources allocation][a] mechanisms.
Academic researchers can apply for computational resources via [Open Access Competitions](http://www.it4i.cz/open-access-competition/?lang=en&lang=en).
Academic researchers can apply for computational resources via [Open Access Competitions][b].
Anyone is welcomed to apply via the [Directors Discretion.](http://www.it4i.cz/obtaining-computational-resources-through-directors-discretion/?lang=en&lang=en)
Anyone is welcomed to apply via the [Directors Discretion][c].
Foreign (mostly European) users can obtain computational resources via the [PRACE (DECI) program](http://www.prace-ri.eu/DECI-Projects).
Foreign (mostly European) users can obtain computational resources via the [PRACE (DECI) program][d].
In all cases, IT4Innovations’ access mechanisms are aimed at distributing computational resources while taking into account the development and application of supercomputing methods and their benefits and usefulness for society. The applicants are expected to submit a proposal. In the proposal, the applicants **apply for a particular amount of core-hours** of computational resources. The requested core-hours should be substantiated by scientific excellence of the proposal, its computational maturity and expected impacts. Proposals do undergo a scientific, technical and economic evaluation. The allocation decisions are based on this evaluation. More information at [Computing resources allocation](http://www.it4i.cz/computing-resources-allocation/?lang=en) and [Obtaining Login Credentials](general/obtaining-login-credentials/obtaining-login-credentials/) page.
In all cases, IT4Innovations’ access mechanisms are aimed at distributing computational resources while taking into account the development and application of supercomputing methods and their benefits and usefulness for society. The applicants are expected to submit a proposal. In the proposal, the applicants **apply for a particular amount of core-hours** of computational resources. The requested core-hours should be substantiated by scientific excellence of the proposal, its computational maturity and expected impacts. Proposals do undergo a scientific, technical and economic evaluation. The allocation decisions are based on this evaluation. More information at [Computing resources allocation][a] and [Obtaining Login Credentials][1] page.
[1]: obtaining-login-credentials/obtaining-login-credentials.md
[a]: http://www.it4i.cz/computing-resources-allocation/?lang=en
[b]: http://www.it4i.cz/open-access-competition/?lang=en&lang=en
[c]: http://www.it4i.cz/obtaining-computational-resources-through-directors-discretion/?lang=en&lang=en
[d]: http://www.prace-ri.eu/DECI-Projects
# Resource Allocation and Job Execution
To run a [job](/#terminology-frequently-used-on-these-pages), [computational resources](salomon/resources-allocation-policy#resource-accounting-policy) for this particular job must be allocated. This is done via the PBS Pro job workload manager software, which distributes workloads across the supercomputer. Extensive information about PBS Pro can be found in the [PBS Pro User's Guide](/pbspro).
To run a [job][1], computational resources for this particular job must be allocated. This is done via the PBS Pro job workload manager software, which distributes workloads across the supercomputer. Extensive information about PBS Pro can be found in the [PBS Pro User's Guide][2].
## Resources Allocation Policy
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](salomon/job-priority#fair-share-priority) ensures that individual users may consume approximately equal amount of resources per week. The resources are accessible via queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following queues are are the most important:
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][3] ensures that individual users may consume approximately equal amount of resources per week. The resources are accessible via queues for queueing the jobs. The queues provide prioritized and exclusive access to the computational resources. Following queues are are the most important:
* **qexp**, the Express queue
* **qprod**, the Production queue
......@@ -14,9 +14,9 @@ The resources are allocated to the job in a fair-share fashion, subject to const
* **qfree**, the Free resource utilization queue
!!! note
Check the queue status at [https://extranet.it4i.cz/](https://extranet.it4i.cz/)
Check the queue status [here][a].
Read more on the [Resource AllocationPolicy](salomon/resources-allocation-policy) page.
Read more on the [Resource AllocationPolicy][4] page.
## Job Submission and Execution
......@@ -25,7 +25,7 @@ Read more on the [Resource AllocationPolicy](salomon/resources-allocation-policy
The qsub submits the job into the queue. The qsub command creates a request to the PBS Job manager for allocation of specified resources. The **smallest allocation unit is entire node, 16 cores**, with exception of the qexp queue. The resources will be allocated when available, subject to allocation policies and constraints. **After the resources are allocated the jobscript or interactive shell is executed on first of the allocated nodes.**
Read more on the [Job submission and execution](salomon/job-submission-and-execution) page.
Read more on the [Job submission and execution][5] page.
## Capacity Computing
......@@ -36,4 +36,13 @@ Use GNU Parallel and/or Job arrays when running (many) single core jobs.
In many cases, it is useful to submit huge (100+) number of computational jobs into the PBS queue system. Huge number of (small) jobs is one of the most effective ways to execute embarrassingly parallel calculations, achieving best runtime, throughput and computer utilization. In this chapter, we discuss the the recommended way to run huge number of jobs, including **ways to run huge number of single core jobs**.
Read more on [Capacity computing](salomon/capacity-computing) page.
Read more on [Capacity computing][6] page.
[1]: #terminology-frequently-used-on-these-pages
[2]: ../pbspro.md
[3]: ../salomon/job-priority.md#fair-share-priority
[4]: ../salomon/resources-allocation-policy.md
[5]: ../salomon/job-submission-and-execution.md
[6]: ../salomon/capacity-computing.md
[a]: https://extranet.it4i.cz/
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment