05-31-2006
OK and thank you.
I will run wmstat -n 1 4 this afternoon when server load is more significant.
Il will post the result to you.
9 More Discussions You Might Find Interesting
1. SCO
Hello,
Can someone share his experience with SCO unix server performance tuning?
- how to make some performance analysis
- how to tune up a server for better performance
Thank you! (0 Replies)
Discussion started by: forumuser7
0 Replies
2. AIX
This is post number 3 in a series of unanswered "TUNING" questions. :D
With AIX 5.3 TL4, the page size can vary from the original "4k". They can now be "64k" and a couple other sizes. They also do not have to all be the same. Some can remain "4k" while others are "64k" which is what seems to... (2 Replies)
Discussion started by: kah00na
2 Replies
3. Shell Programming and Scripting
Hi,
I would like to connect UNIX server to UNIX server through shell scripts
and i have some concepts . But i am totally confused how to connect UNIX
server to UNIX server throuth running a script. It will be greatful to me if
any buddy will help me.
with simple example please.
Thanks in... (2 Replies)
Discussion started by: phatan
2 Replies
4. Web Development
We have been tuning MySQL lately and I ran accoss two useful tools that you might be interested in:
mysqltuner.pl
tuning-primer.sh
Both of these scripts are quite useful for MySQL tuning. Here is some sample output of mysqltuner.pl
>> MySQLTuner 0.9.8 - Major Hayden... (3 Replies)
Discussion started by: Neo
3 Replies
5. Shell Programming and Scripting
Hi Gurus,
I'm a unix newbie and I would like to connect to multiple unix servers from unix server using shell script i.e from server a to server b,c,d etc. I want to copy the files from unix server a to server b, c, d. I can access staright using ssh without the need to have password and user... (5 Replies)
Discussion started by: sexyTrojan
5 Replies
6. Shell Programming and Scripting
Hi all,
I have created a script which adding two columns and removing two columns for all files.
Filename: Cust_information_1200_201010.txt
Source Data:
"1","Cust information","123","106001","street","1-203 high street"
"1","Cust information","124","105001","street","1-203 high street"
... (0 Replies)
Discussion started by: onesuri
0 Replies
7. AIX
Hi all,
From Googling, I found that the basics used for troubleshooting UNIX/AIX performance issues are commands like vmstat, iostat and sar. I believe these are generic commands regardless of what UNIX flavour is in used, only difference being is the format of the output.
In a real case... (2 Replies)
Discussion started by: newbie_01
2 Replies
8. Shell Programming and Scripting
Hi All,
Let me know how can i find and delete files from one unix server to another unix server which are 'N' days older.
Please note that I need to delete files on remote unix server.So, probably i will need to use sftp, but question is how can i identify files and folders which are 'N'... (2 Replies)
Discussion started by: sachinkl
2 Replies
9. AIX
Greetings,
i'm wondering if there is a way to determine minimum memory requirement for AIX kernel and OS functions? We use memdetails script from perfpmr package to see actual memory allocation, for example like this:
===========================================================================... (5 Replies)
Discussion started by: dzodzo
5 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)
NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS
--predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO
bup-midx(1), bup-save(1)
BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown- bup-margin(1)