To see currently running
process
|
ps
|
$ps
|
List the process using most CPU
|
Top , htop
|
$top
|
To stop any process by PID i.e. to
kill process
|
kill {PID}
|
$kill 1012
|
To stop processes by name i.e. to
kill process
|
killall {Process-name}
pkill
xkill
|
$killall httpd
|
To get information about all
running process
|
ps -ag
|
$ps -ag
|
To stop all process except your
shell
|
kill 0
|
$kill 0
|
For background processing (With
&, use to put particular command and program in background)
|
linux-command &
|
$ls / -R | wc -l &
|
To display the owner of the
processes along with the processes
|
ps aux
|
$ps aux
|
To see if a particular process is
running or not. For this purpose you have to use ps command in combination
with the grep command
|
ps ax |
grep process-U-want-to see
|
For e.g. you want to see whether
Apache web server process is running or not then give command
$ ps ax
| grep httpd
|
To see currently running processes
and other information like memory and CPU usage with real time updates.
|
top
|
$top
Note that to exit from top command press q. |
To display a tree of processes
|
pstree
|
$pstree
|
Search Process id of a process
|
pgrep
|
$pgrep firefox
|
Changing Priority of a process
|
nice , renice
|
$renice 19 PID
|
Visit My Data Structure Blog for Programs... It is important for every Computer Science student to understand the concept of Information and how it is organized or how it can be utilized. If we arrange some data in an appropriate sequence, then it forms a Structure and gives us a meaning. This meaning is called Information . A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Data may be organized in many different ways. The logical model of a particular organization of data in a computer is called data structure. The choice of the model based on two considerations. It should be reflect the data in the real world. It should be simple that one can effectively process the data when necessary. E.g. Array, linked list, stack, queue, tree, graph Data structure can be classified into two: Linear: A data structure is said to be linear if its elements form a sequence E.g. Array, linked list, stack, queue Non-Linear: A dat
Comments
Post a Comment