12-21-2011
Alternately, if you feel as though SAR makes you uncomfortable, you could load the info into Ksar and get better data and graphs. Or you can use one of many tools such as:
Nagios
Hyperic
ZenOSS
Zabbix
I have used and like Hyperic.
8 More Discussions You Might Find Interesting
1. AIX
In lieu of not having filemon (AIX 5100-09) does anyone have have any
recomendations of freeware I can get to analyze an I/O issue on my AIX
box? (1 Reply)
Discussion started by: capeme
1 Replies
2. Shell Programming and Scripting
I am pretty new at shell scripting, but I managed to make a primative shell script to connect from my webserver (bluehost) to an external data server via ftp or sftp or whatever I need. This script is :
#!/bin/sh
HOST='ftp.host.com'
USER='username'
PASSWD='password'
FILE='file'
ftp -n... (7 Replies)
Discussion started by: mesoeast
7 Replies
3. UNIX for Dummies Questions & Answers
Hi, I'm working on gathering information stored in .txt files. The format of the data within the .txt files is shown in the picture uploaded with this post. Sections like the one pictured are repeated (with different data, same format) many times within each .txt file but each section is of data... (4 Replies)
Discussion started by: p43hd
4 Replies
4. Linux
Hi
Routing tables in a typical linux kernel are implemented using hash data structures. So if the hash table is forced to behave more like a linked list(i.e create chaining) the purpose of using hash is defeated and time complexity increases.
I want to try to assess the performance deterioration... (0 Replies)
Discussion started by: coolvaibhav
0 Replies
5. UNIX for Advanced & Expert Users
Hi everyone,
I would like to ask if it is possible to gather SAR data on a specified time. let say yesterdays report, i want to get data at around 12PM and 5PM.
thank you. (2 Replies)
Discussion started by: cwiggler
2 Replies
6. UNIX for Dummies Questions & Answers
Hi Guys,
I've wondered for some time the performance analysis between using sed and awk. say i want to print lines from a very large file. For ex say a file with 100,000 records. i want to print the lines 25,000 to 26,000 i can do so by the following commands:
sed -n '25000,26000 p'... (11 Replies)
Discussion started by: Irishboy24
11 Replies
7. AIX
Hi
I need a list of code analysis tools for C programs, that can work on AIX environment such as :
dynamic or static code analysis
Code Complexity Measures
Test Coverage Analyzer
Unit tests
profiling tools
Source code formatter
I've found several tools but not compatible with AIX... (0 Replies)
Discussion started by: SteAlma
0 Replies
8. Shell Programming and Scripting
Hello world!
I need to gather all the data from different folders and copy it in an one unique text file in columns format.
Let me explain, letīs say "a, b, c" are 3 data files of thousands and thousands lines (in the reality, I have nearly one hundred).
"a, b, c" are located in the folders... (5 Replies)
Discussion started by: user10600
5 Replies
LEARN ABOUT DEBIAN
dispatch_benchmark_f
dispatch_benchmark(3) BSD Library Functions Manual dispatch_benchmark(3)
NAME
dispatch_benchmark -- Measures block execution time
SYNOPSIS
#include <dispatch/dispatch.h>
uint64_t
dispatch_benchmark(size_t count, void (^block)(void));
uint64_t
dispatch_benchmark_f(size_t count, void *context, void (*function)(void *));
DESCRIPTION
The dispatch_benchmark() function executes the given block multiple times according to the count variable and then returns the average number
of nanoseconds per execution. This function is for debugging and performance analysis work. For the best results, pass a high count value
to dispatch_benchmark(). When benchmarking concurrent code, please compare the serial version of the code against the concurrent version,
and compare the concurrent version on different classes of hardware. Please look for inflection points with various data sets and keep the
following facts in mind:
o Code bound by computational bandwidth may be inferred by proportional changes in performance as concurrency is increased.
o Code bound by memory bandwidth may be inferred by negligible changes in performance as concurrency is increased.
o Code bound by critical sections may be inferred by retrograde changes in performance as concurrency is increased.
o Intentional: locks, mutexes, and condition variables.
o Accidental: unrelated and frequently modified data on the same cache-line.
RETURN VALUE
The dispatch_benchmark() function returns the average number of nanoseconds the given block takes to execute.
SEE ALSO
dispatch(3)
Darwin May 1, 2009 Darwin