Load (computing): Difference between revisions

Revision as of 09:21, 2 December 2019

Latest revision as of 17:40, 23 May 2025

(43 intermediate revisions by 29 users not shown)

Line 1:

{{Short description|Amount of computational work that a computer system performs}}

{{Use dmy dates|date=March 2013}}

{{refimproveUse dmy dates|date=NovemberSeptember 20102022}}

{{more citations needed|date=November 2010}}

[[File:Big-load.png|thumb|[[htop]] displaying a significant computing load (top right: ''Load average:'').]] In [[UNIX]] [[computing]], the system '''load''' is a measure of the amount of computational work that a computer system performs. The '''load average''' represents the average system load over a period of time. It conventionally appears in the form of three numbers which represent the system load during the last one-, five-, and fifteen-minute periods.

== Unix-style load calculation ==

All Unix and Unix-like systems generate a dimensionless [[Software metric|metric]] of three "load average" numbers in the [[kernel (computeroperating sciencesystem)|kernel]]. Users can easily query the current result from a [[Unix shell]] by running the <ttcode>[[uptime]]</ttcode> command:

<sourcesyntaxhighlight lang="console">

$ uptime

14:34:03 up 10:43, 4 users, load average: 0.06, 0.11, 0.09

</syntaxhighlight>

</source>

The [[W (Unix)|<ttcode>w</ttcode>]] and [[Toptop (Unixsoftware)|<ttcode>top</ttcode>]] commands show the same three load average numbers, as do a range of [[graphical user interface]] utilities.

In operating systems based on the [[Linux kernel]], theythis information can also be easily accessed by reading the [[procfs|<code>/proc/loadavg</code>]] file.

To explore this kind of information in depth, according to the Linux's [[Filesystem Hierarchy Standard]], architecture-dependent information are exposed on the file <code>/proc/stat</code>.<ref>{{Cite web

|url = https://www.kernel.org/doc/html/latest/admin-guide/cpu-load.html

|title = CPU load

|access-date=2023-10-04

}}</ref><ref>{{Cite web

|url = https://tldp.org/LDP/Linux-Filesystem-Hierarchy/html/proc.html

|title = /proc

|access-date=2023-10-04

|website = Linux Filesystem Hierarchy

}}</ref><ref>{{Cite web

|url = https://www.kernel.org/doc/html/latest/filesystems/proc.html#miscellaneous-kernel-statistics-in-proc-stat

|title = Miscellaneous kernel statistics in /proc/stat

|access-date=2023-10-04

}}</ref>

An idle computer has a load number of 0 (the idle process isn'tis not counted). Each [[process (computing)|process]] using or waiting for [[Central processing unit|CPU]] (the ''ready queue'' or [[run queue]]) increments the load number by 1. Each process that terminates decrements it by 1. Most UNIX systems count only processes in the ''running'' (on CPU) or ''runnable'' (waiting for CPU) [[Process statesstate|states]]. However, Linux also includes processes in [[uninterruptible sleep]] states (usually waiting for [[Hard disk drive|disk]] activity), which can lead to markedly different results if many processes remain blocked in [[Input/output|I/O]] due to a busy or stalled I/O system.<ref>http{{Cite web|url=https://linuxtechsupport.blogspot.com/2008/10/what-exactly-is-load-average.html|title=Linux Tech Support: What exactly is a load average?|date=23 October 2008}}</ref> This, for example, includes processes blocking due to an [[Network File System (protocol)|NFS]] server failure or too slow [[Data storage device|media]] (e.g., [[Universal Serial Bus|USB]] 1.x storage devices). Such circumstances can result in an elevated load average, which does not reflect an actual increase in CPU use (but still gives an idea of how long users have to wait).

Systems calculate the load ''average'' as the [[Moving average#Exponential moving average|exponentially damped/weighted moving average]] of the load ''number''. The three values of load average refer to the past one, five, and fifteen minutes of system operation.<ref name="drdobbs">{{cite web |url=httphttps://www.linuxjournal.com/article/9001 |title=Examining Load Average |first=Ray |last=Walker |date=1 December 2006 |work=Linux Journal |accessdateaccess-date=13 March 2012 }}</ref>

Mathematically speaking, all three values always average all the system load since the system started up. They all decay exponentially, but they decay at different ''speeds'': they decay exponentially by ''e'' after 1, 5, and 15 minutes respectively. Hence, the 1-minute load average consists of 63% (more precisely: 1 - 1/''e'') of the load from the last minute and 37% (1/''e'') of the average load since start up, excluding the last minute. For the 5- and 15-minute load averages, the same 63%/37% ratio is computed over 5 minutes and 15 minutes, respectively. Therefore, it is not technically accurate that the 1-minute load average only includes the last 60 seconds of activity, as it includes 37% of the activity from the past, but it is correct to state that it includes ''mostly'' the last minute.

=== Interpretation ===

For single-CPU systems that are [[CPU bound]], one can think of load average as a measure of system utilization during the respective time period. For systems with multiple CPUs, one must divide the load by the number of processors in order to get a comparable measure.

For example, one can interpret a load average of "1.73 0.60 7.98" on a single-CPU system as:

* duringDuring the last minute, the system was overloaded by 73% on average (1.73 runnable processes, so that 0.73 processes had to wait for a turn for a single CPU system on average).

* duringDuring the last 5 minutes, the CPU was idling 40% of the time, on average.

* duringDuring the last 15 minutes, the system was overloaded 698% on average (7.98 runnable processes, so that 6.98 processes had to wait for a turn for a single CPU system on average).

This means that this system (CPU, disk, memory, etc.) could have handled all of the work scheduled for the last minute if it were 1.73 times as fast.

In a system with four CPUs, a load average of 3.73 would indicate that there were, on average, 3.73 processes ready to run, and each one could be scheduled into a CPU.

On modern UNIX systems, the treatment of [[Thread (computer sciencecomputing)|threading]] with respect to load averages varies. Some systems treat threads as processes for the purposes of load average calculation: each thread waiting to run will add 1 to the load. However, other systems, especially systems implementing so-called [[Thread (computer sciencecomputing)#M:N (hybrid threading)|M:N threading]], use different strategies such as counting the process exactly once for the purpose of load (regardless of the number of threads), or counting only threads currently exposed by the user-thread scheduler to the kernel, which may depend on the level of concurrency set on the process. Linux appears to count each thread separately as adding 1 to the load.<ref>See http://serverfault.com/a/524818/27813</ref>

== CPU load vsvis-à-vis CPU utilization ==

The comparative study of different load indices carried out by Ferrari et al.<ref name="Empirical load">Ferrari, Domenico; and Zhou, Songnian; "[http://www.eecs.berkeley.edu/Pubs/TechRpts/1987/CSD-87-353.pdf An Empirical Investigation of Load Indices For Load Balancing Applications]", Proceedings of Performance ’87'87, the 12th International Symposium on Computer Performance Modeling, Measurement, and Evaluation, North Holland Publishers, Amsterdam, Thethe Netherlands, 1988, pp. 515-528515–528</ref> reported that CPU load information based upon the CPU queue length does much better in load balancing compared to CPU utilization. The reason CPU queue length did better is probably because when a host is heavily loaded, its CPU utilization is likely to be close to 100%, and it is unable to reflect the exact load level of the utilization. In contrast, CPU queue lengths can directly reflect the amount of load on a CPU. As an example, two systems, one with 3 and the other with 6 processes in the queue, are both very likely to have utilizations close to 100%, although they obviously differ.{{ororiginal research inline|date=May 2013}}

== Reckoning CPU load ==

On Linux systems, the load-average is not calculated on each clock tick, but driven by a variable value that is based on the HzHZ frequency setting and tested on each clock tick. (HzThis variablesetting isdefines the pulse rate of particular Linux kernel activity. 1&nbsp;Hz is equal to one clock tick; 10ms by default.) Although the Hz value can be configuredrate in some[[hertz]] versions(times ofper the kernelsecond), and it is normally setdefaults to 100. Thefor calculation10&nbsp;ms codeticks. usesKernel theactivities Hzuse valuethis tonumber determineof theticks CPUto Loadtime calculation frequencythemselves. Specifically, the timer.c::calc_load() function, willwhich runcalculates the algorithmload average, runs every 5{{tt|1=LOAD_FREQ = (5*HZ+1)}} Hzticks, or roughlyabout every five times per second. Following is that function iseconds:

<sourcesyntaxhighlight lang="c">

unsigned long avenrun[3];

Line 54 ⟶ 74:

}

}

</syntaxhighlight>

</source>

The countdown is over a {{code|LOAD_FREQ}} of 5 Hz.<ref group="note">

<poem>

1 HZ = 100 ticks

5 HZ = 500 ticks

1 tick = 10 milliseconds

500 ticks = 5000 milliseconds (or 5 seconds)

So, 5 HZ means that {{code|CALC_LOAD}} is called every 5 seconds.

</poem>

</ref>

The avenrun array contains 1-minute, 5-minute and 15-minute average. The {{code|CALC_LOAD}} macro and its associated values are defined in sched.h :

The avenrun array contains 1-minute, 5-minute and 15-minute average. The {{code|CALC_LOAD}} macro and its associated values are defined in sched.h :

<source lang="c">

<sourcesyntaxhighlight lang="c">

#define FSHIFT 11 /* nr of bits of precision */

#define FIXED_1 (1<<FSHIFT) /* 1.0 as fixed-point */

#define LOAD_FREQ (5*HZ+1) /* 5 sec intervals */

#define EXP_1 1884 /* 1/exp(5sec/1min) as fixed-point */

#define EXP_5 2014 /* 1/exp(5sec/5min) */

Line 78 ⟶ 90:

load += n*(FIXED_1-exp); \

load >>= FSHIFT;

</syntaxhighlight>

</source>

The "sampled" calculation of load averages is a somewhat common behavior; FreeBSD, too, only refreshes the value every five seconds. The interval is usually taken to not be exact so that they do not collect processes that are scheduled to fire at a certain moment.<ref>{{cite web |title=How is load average calculated on FreeBSD? |url=https://unix.stackexchange.com/a/342778 |website=Unix & Linux Stack Exchange}}</ref>

==Other system performance commands==

A post on the Linux mailing list considers its {{tt|+1}} tick insufficient to avoid [[Moiré pattern|Moiré artifacts]] from such collection, and suggests an interval of 4.61 seconds instead.<ref>{{cite web |last1=Ripke |first1=Klaus |title=Linux-Kernel Archive: LOAD_FREQ (4*HZ+61) avoids loadavg Moire |url=https://lkml.iu.edu/hypermail/linux/kernel/1111.1/02446.html |website=lkml.iu.edu |date=2011}} [https://ripke.com/loadavg/moire graph & patch<!-- Actual title at target: Moiré patterns in linux load average (Moiré mangled in title as Moiré) -->]</ref> This change is common among [[Android (operating system)|Android system]] kernels, although the exact expression used assumes an HZ of 100.<ref>{{cite web |title=Patch kernel with the 4.61s load thing · Issue #2109 · AOSC-Dev/aosc-os-abbs |url=https://github.com/AOSC-Dev/aosc-os-abbs/issues/2109 |website=GitHub |language=en}}</ref>

== Other system performance commands ==

Other commands for assessing system performance include:

* <ttcode>[[uptime]]</ttcode>{{Snd}} the system reliability and load average

* <code>[[Toptop (Unixsoftware)|<tt>top]]</ttcode>]]{{Snd}} for an overall system view

* <code>[[Vmstat (Unix)|<tt>vmstat]]</ttcode>]]{{Snd}} vmstat reports information about runablerunnable or blocked processes, memory, paging, block I/O, traps, and CPU.

* [[Htop (Unix)|<ttcode>[[htop]]</ttcode>]]{{Snd}} interactive process viewer

* <ttcode>dool</code> (formerly <code>dstat</ttcode>),<ref>{{cite [httpweb |url=https://daggithub.wiee.rscom/home-madescottchiefbaker/dool |title=dool - Python3 compatible clone of dstat/ |last=Baker |first=Scott |date=September 28, 2022 |website=[[GitHub]] |access-date=November 22, 2022 |quote=...Dag Wieers ceased development of Dstat...}}</ref> <code>atop</code>{{Snd}} helps correlate all existing resource data for processes, memory, paging, block I/O, traps, and CPU activity.

* <code>[[iftop|<tt>iftop]]</ttcode>]]{{Snd}} interactive network traffic viewer per interface

* <ttcode>nethogs</ttcode>{{Snd}} interactive network traffic viewer per process

* <ttcode>iotop</ttcode>{{Snd}} interactive I/O viewer<ref>http{{Cite web|url=https://man7.org/linux/man-pages/man8/iotop.8.html</ref>|title interactive= I/O viewerIotop(8) - [http://guichaz.free.fr/iotop/Linux iotopmanual homepage]page}}</ref>

* [[Iostat (Unix)|<ttcode>[[iostat]]</ttcode>]]{{Snd}} for storage I/O statistics

* [[Netstat (Unix)|<ttcode>[[netstat]]</ttcode>]]{{Snd}} for network statistics

* <ttcode>[[mpstat]]</ttcode>{{Snd}} for CPU statistics

* <ttcode>tload</ttcode>{{Snd}} load average graph for terminal

* <ttcode>[[xload]]</ttcode>{{Snd}} load average graph for X

* <ttcode>/proc/loadavg</ttcode>{{Snd}} text file containing load average

== See also ==

* [[CPU usage]]

==External linksReferences ==

{{reflist}}

== External links ==

* {{cite web

|author = Brendan Gregg

|title = Linux Load Averages: Solving the Mystery

|url = httphttps://www.brendangregg.com/blog/2017-08-08/linux-load-averages.html

|date = 8 August 2017

|accessdateaccess-date = 2018-01-22

}}

* {{cite web

|title = UNIX Load Average –{{Snd}} Part 1: How It Works

|url = http://www.teamquest.com/pdfs/whitepaper/ldavg1.pdf

|author = [[Neil J. Gunther]]

|publisher = TeamQuest

|format access-date = pdf2009-08-12

|date}} =

|accessdate = 2009-08-12

}}<ref group="note">This paper's discussion is useful, but it contains at least one error, in equation 3 (Section 4.2, page 12): The equation should be <math>load(t) = n e^{-\frac 5{60}} + load(t-1) (1 - e^{-\frac 5{60}})</math> instead of <math>load(t) = load(t-1) e^{-\frac 5{60}} + n (1 - e^{-\frac 5{60}}).</math></ref>

* {{cite web

|title = Understanding Linux CPU Load -{{Snd}} when should you be worried?

|url = httphttps://blog.scoutapp.com/articles/2009/07/31/understanding-load-averages

|author = Andre Lewis

|date = 31 July 2009

|accessdateaccess-date = 2011-07-21

}} Explanation using an illustrated traffic analogy.

* {{cite web

|author = Ray Walker

|title = Examining Load Average

|url = httphttps://www.linuxjournal.com/article/9001

|publisher = Linux Journal

|date = 1 December 2006

|accessdateaccess-date = 2011-07-21

}}

* {{cite web

Line 139 ⟶ 156:

|publisher = LoadAvg

}}

== Notes ==

<references group="note"/>

==References==

{{reflist}}

[[Category:Operating system technology]]