Category:Performance: Difference between revisions

From VASP Wiki
No edit summary
No edit summary
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
== How to ==
The [[:Category:Performance|performance]] of VASP depends on multiple factors that the user can influence. First of all, state-of-the-art computer architecture, proper use of libraries, and compilation are prerequisites for good performance; see the [[:Category:Installation|instructions on installation]].
*Memory requirements of VASP: {{TAG|Memory requirements}}.
 
*Not enough memory what to do: {{TAG|Not enough memory}}.
Then, there are many features and algorithms implemented in VASP. Sometimes different algorithms can compute the same quantity with one algorithm being better performing for specific systems. For instance, one algorithm is faster for metallic systems, or another is suitable for systems with many atoms, etc.
----
 
Next, there are two main aspects of performance: memory consumption and compute time. These are discussed in detail on the following pages: 
* [[:Category:Memory| Memory]] 
* [[:Category:Parallelization| Parallelization]] 


[[Category:VASP|Technical Implementation]][[Category:Calculation setup|Calculation setup]]
[[Category:VASP|Technical Implementation]][[Category:Calculation setup|Calculation setup]]

Latest revision as of 10:18, 12 August 2022

The performance of VASP depends on multiple factors that the user can influence. First of all, state-of-the-art computer architecture, proper use of libraries, and compilation are prerequisites for good performance; see the instructions on installation.

Then, there are many features and algorithms implemented in VASP. Sometimes different algorithms can compute the same quantity with one algorithm being better performing for specific systems. For instance, one algorithm is faster for metallic systems, or another is suitable for systems with many atoms, etc.

Next, there are two main aspects of performance: memory consumption and compute time. These are discussed in detail on the following pages: