Lines Matching refs:processes
25 @deftypefun int getrusage (int @var{processes}, struct rusage *@var{rusage})
29 This function reports resource usage totals for processes specified by
30 @var{processes}, storing the information in @code{*@var{rusage}}.
32 In most systems, @var{processes} has only two valid values:
41 All child processes (direct and indirect) that have already terminated.
49 The argument @var{processes} is not valid.
67 Time spent in operating system code on behalf of @var{processes}.
71 number of kilobytes of physical memory that @var{processes} used
77 processes.
94 The number of times @var{processes} was swapped entirely out of main memory.
98 of @var{processes}.
102 of @var{processes}.
114 The number of times @var{processes} voluntarily invoked a context switch
315 The maximum number of processes that can be created with the same user ID.
443 When multiple processes simultaneously require CPU time, the system's
444 scheduling policy and process CPU priorities determine which processes
451 only resource a process uses or that processes contend for. In some
454 respect to other processes. The priorities discussed in this section
465 multiple CPUs, and knowing that the number of processes that can run at
496 On systems of the past, and most systems today, all processes have
499 accommodate realtime systems, in which it is vital that certain processes
506 When two processes are in contention to use the CPU at any instant, the
510 processes that are running or ``ready to run,'' which means they are
517 When two processes are running or ready to run and both have the same
519 CPU is determined by the scheduling policy. If the processes have
525 can be trusted not to hog the CPU. Such processes are designed to block
550 Interrupt handlers live in that limbo between processes. The CPU is
559 processes get to run while the page faults in is of no consequence,
596 Whenever two processes with the same absolute priority are ready to run,
598 If the processes have absolute priority 0, the kernel makes this decision
602 If two processes are ready to run but have different absolute priorities,
606 Each process has a scheduling policy. For processes with absolute
616 The most sensible case is where all the processes with a certain
620 In Round Robin, processes share the CPU, each one running for a small
622 circular fashion. Of course, only processes that are ready to run and
635 Judicious use of @code{sched_yield} function invocations by processes
639 To understand how scheduling works when processes of different scheduling
641 gritty details of how processes enter and exit the ready to run list.
697 tasks IDs, and not processes and process IDs.
945 processes in the system are doing and how fast it executes, this
959 This section is about the scheduling among processes whose absolute
961 are left over after the processes with higher absolute priority have
963 among the great unwashed processes gets them.
977 Zero processes to govern themselves by their own familiar scheduling
995 over time. The dynamic priority is meaningless for processes with
1008 selection of processes for new time slices is basically round robin.
1009 But the scheduler does throw a bone to the low priority processes: A
1024 in the Unix garden of Eden, all processes shared equally in the bounty
1025 of the computer system. But not all processes really need the same
1080 Return the nice value of a set of processes; @var{class} and @var{id}
1081 specify which ones (see below). If the processes specified do not all
1109 Set the nice value of a set of processes to @var{niceval}; @var{class}
1138 processes in which you are interested. These are the possible values of
1148 All the processes in a particular process group. The argument @var{id} is
1153 All the processes owned by a particular user (i.e., whose real uid
1194 the different processes which are runnable on all available CPUs in a
1195 way which allows the system to work most efficiently. Which processes
1207 making progress by other processes or threads using CPU resources. In
1424 Unix systems normally provide processes virtual address spaces. This
1433 is process isolation. The different processes running on the system
1439 processes see can actually be larger than the physical memory available.
1447 memory of all the processes is larger than the available physical memory
1487 processes on the same system. Therefore the system should be queried at
1565 The use of threads or processes with shared memory allows an application
1568 to have at any time as many processes running as there are processors.
1620 @dfn{load average}. This is a number indicating how many processes were