ST03N: SAP Workload Monitor

Transaction code ST03N is used to analyze statistical data for the ABAP kernel and
monitor the performance of a system. You can display the total values for all instances,
and compare the performance of particular instances over a period of time. ST03N is the
replacement of transaction code ST03.
The workload overview provides system administrators with various detailed information
about the most important workload data, such as the CPU time, the nm!er of data!ase
c"an#es, the response times, and so on. You can display the workload overview for all
task types ($ialo#, Back#rond, %&C, A'(, and Update, or only for one particular task
type.
Workload )*er*ie+
!orkload statistic overview
Processin# time
This is e"uivalent to response time minus the sum of wait time, database re"uest time, load
time, roll time, and en"ueue time
,int: # $% of &'( time.
Pro!lem: &heck on hardware side.
CPU time
) work process uses the &'(.
,int: *0+ of response time.
, (sin- transaction code ST0., -o to /etail )nalysis 0enu 1# Top &'( , check e%istence of
Non1S)' (e%ternal pro-rams by sortin- by &'( time. Try to run these e%ternal pro-rams in
offline hours.
, (sin- transaction code ST0$, check for any swappin- happenin- in all the buffers. 2f there
is hi-h swappin- for any buffer, increase the si3e of the buffer.
%esponse time
The time when a dialo- process sends a re"uest to a dispatcher work process, and the
dialo- is complete and the data is transferred to the presentation layer. The response time
does not include the time for transferrin- the data from the S)' front end to the application
server.
,int: 4 second (dialo-, 54 second (update
Wait time
The time when a user re"uest sits in the dispatcher "ueue. 2t starts when user re"uest is
entered in the dispatcher "ueue6 and ends when the re"uest starts bein- processed.
,int: 5 40+ of response time
Pro!lem: 7on- runnin- tasks, locked tasks, not enou-h work process.
Soltion:
, (sin- transaction code S080, look for all the confi-ured work processes are in !aitin- or
9unnin- state. 2f all the wotk processes are runnin- state, then increase the number of
/ialo- work processes.
, (sin- transaction code SM--, monitor and analy3e the total work processes confi-ured in
all the servers and instances.
$B calls
Number of parsed accesses to the database.
,int: /: calls;re"uests -ood ratio is 4<40 = efficiency table bufferin-
$B re.ests/$B Time
The time when a database re"uest is put throu-h to the database interface > when the
database interface has delivered the result.
,int: *0+ of response time
Pro!lem: &'(;memory bottleneck on /: server, e%pensive S?7 statement, missin-
inde%es, small buffer, missin- statistics
Soltion:
(sin- transaction code ST0*,
, The value of data!ase !ffer .ality (0 123, if 5, increase database buffer cache
si3e.
, %eads/User Calls (4 30, if #, the e%pensive S?7 statements need to be tune.
Some of e%pensive S?7 statement problems<
i incorrect inde% access (Solution = create new inde% or reor-ani3e the inde%
ii hi-h table si3e (Solution = archive the old entries
A*era#e load 5 #eneration
The time needed to load and -enerate ob@ects.
,int: 5 40+ of response time, 5 80ms.
Pro!lem: 'ro-ram buffer, &() buffer, screen buffer too small.
6U7 time
9esponse time between the dispatcher and the A(2 durin- the round trips (round trips are
communication steps between the S)' system and the front end durin- a transaction step.
,int: 5 $00ms.
Pro!lem: Network between A(2 > S)' A(2.
Soltion:
, (sin- transaction code ST0-, -o to $etail Analysis Men 1# 'AN C"eck !y P7N6. 2f
there is hi-h )v-. time or 7oss time for any presentation servers, means there are some
settin-s need to be chan-e for the presentation server.
, (sin- transaction code S(38, e%ecute report P%)&6(N9C)%%9%(P)%T92. Brom the
output check if any user assi-ned with # 4000 user menu nodes.
%oll in time
The time needed to roll user conte%t information into the work process.
,int: 5 $0ms.
Pro!lem: S)' memory confi-uration (e%tended memory, roll buffer.
%oll +ait time
?ueue time in the roll area.
,int: 5 $00ms.
Pro!lem: Network between A(2 > S)'.